PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_dgeqrf (f08ae)
Purpose
nag_lapack_dgeqrf (f08ae) computes the factorization of a real by matrix.
Syntax
Description
nag_lapack_dgeqrf (f08ae) forms the factorization of an arbitrary rectangular real by matrix. No pivoting is performed.
If
, the factorization is given by:
where
is an
by
upper triangular matrix and
is an
by
orthogonal matrix. It is sometimes more convenient to write the factorization as
which reduces to
where
consists of the first
columns of
, and
the remaining
columns.
If
,
is trapezoidal, and the factorization can be written
where
is upper triangular and
is rectangular.
The matrix
is not formed explicitly but is represented as a product of
elementary reflectors (see the
F08 Chapter Introduction for details). Functions are provided to work with
in this representation (see
Further Comments).
Note also that for any
, the information returned in the first
columns of the array
a represents a
factorization of the first
columns of the original matrix
.
References
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Parameters
Compulsory Input Parameters
- 1:
– double array
-
The first dimension of the array
a must be at least
.
The second dimension of the array
a must be at least
.
The by matrix .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the array
a.
, the number of rows of the matrix .
Constraint:
.
- 2:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
a.
, the number of columns of the matrix .
Constraint:
.
Output Parameters
- 1:
– double array
-
The first dimension of the array
a will be
.
The second dimension of the array
a will be
.
If
, the elements below the diagonal store details of the orthogonal matrix
and the upper triangle stores the corresponding elements of the
by
upper triangular matrix
.
If , the strictly lower triangular part stores details of the orthogonal matrix and the remaining elements store the corresponding elements of the by upper trapezoidal matrix .
- 2:
– double array
-
The dimension of the array
tau will be
Further details of the orthogonal matrix .
- 3:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
-
If , parameter had an illegal value on entry. The parameters are numbered as follows:
1:
m, 2:
n, 3:
a, 4:
lda, 5:
tau, 6:
work, 7:
lwork, 8:
info.
It is possible that
info refers to a parameter that is omitted from the MATLAB interface. This usually indicates that an error in one of the other input parameters has caused an incorrect value to be inferred.
Accuracy
The computed factorization is the exact factorization of a nearby matrix
, where
and
is the
machine precision.
Further Comments
The total number of floating-point operations is approximately if or if .
To form the orthogonal matrix
nag_lapack_dgeqrf (f08ae) may be followed by a call to
nag_lapack_dorgqr (f08af):
[a, info] = f08af(a, tau, 'k', min(m,n));
but note that the second dimension of the array
a must be at least
m, which may be larger than was required by
nag_lapack_dgeqrf (f08ae).
When
, it is often only the first
columns of
that are required, and they may be formed by the call:
[a, info] = f08af(a, tau);
To apply
to an arbitrary real rectangular matrix
,
nag_lapack_dgeqrf (f08ae) may be followed by a call to
nag_lapack_dormqr (f08ag). For example,
[c, info] = f08ag('Left', 'Transpose', a, tau, c, 'k', min(m,n));
forms
, where
is
by
.
To compute a
factorization with column pivoting, use
nag_lapack_dtpqrt (f08bb) or
nag_lapack_dgeqpf (f08be).
The complex analogue of this function is
nag_lapack_zgeqrf (f08as).
Example
This example solves the linear least squares problems
where
and
are the columns of the matrix
,
Open in the MATLAB editor:
f08ae_example
function f08ae_example
fprintf('f08ae example results\n\n');
a = [-0.57, -1.28, -0.39, 0.25;
-1.93, 1.08, -0.31, -2.14;
2.30, 0.24, 0.40, -0.35;
-1.93, 0.64, -0.66, 0.08;
0.15, 0.30, 0.15, -2.13;
-0.02, 1.03, -1.43, 0.50];
b = [-2.67, 0.41;
-0.55, -3.10;
3.34, -4.01;
-0.77, 2.76;
0.48, -6.17;
4.10, 0.21];
[a, tau, info] = f08ae(a);
[b, info] = f08ag(...
'Left', 'Transpose', a, tau, b);
[b, info] = f07te(...
'Upper', 'No Transpose', 'Non-Unit', a, b, 'n', int64(4));
if (info >0)
fprintf('The upper triangular factor, R, of A is singular,\n');
fprintf('the least squares solution could not be computed.\n');
else
[ifail] = x04ca('General', ' ', b(1:4,:), 'Least-squares solution(s)');
rnorm = zeros(2,1);
for j=1:2
rnorm(j) = norm(b(5:6,j));
end
fprintf('\nSquare root(s) of the residual sum(s) of squares\n');
fprintf('\t%11.2e %11.2e\n', rnorm(1), rnorm(2));
end
f08ae example results
Least-squares solution(s)
1 2
1 1.5339 -1.5753
2 1.8707 0.5559
3 -1.5241 1.3119
4 0.0392 2.9585
Square root(s) of the residual sum(s) of squares
2.22e-02 1.38e-02
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015