PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_zgeqrf (f08as)
Purpose
nag_lapack_zgeqrf (f08as) computes the factorization of a complex by matrix.
Syntax
Description
nag_lapack_zgeqrf (f08as) forms the factorization of an arbitrary rectangular complex by matrix. No pivoting is performed.
If
, the factorization is given by:
where
is an
by
upper triangular matrix (with real diagonal elements) and
is an
by
unitary 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:
– complex 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:
– complex 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 unitary 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 unitary matrix and the remaining elements store the corresponding elements of the by upper trapezoidal matrix .
The diagonal elements of are real.
- 2:
– complex array
-
The dimension of the array
tau will be
Further details of the unitary 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 real floating-point operations is approximately if or if .
To form the unitary matrix
nag_lapack_zgeqrf (f08as) may be followed by a call to
nag_lapack_zungqr (f08at):
[a, info] = f08at(a, tau);
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_zgeqrf (f08as).
When
, it is often only the first
columns of
that are required, and they may be formed by the call:
[a, info] = f08at(a(:,1:n), tau);
To apply
to an arbitrary complex rectangular matrix
,
nag_lapack_zgeqrf (f08as) may be followed by a call to
nag_lapack_zunmqr (f08au). For example,
[c, info] = f08au('Left', 'Conjugate Transpose', a, tau, c);
forms
, where
is
by
.
To compute a
factorization with column pivoting, use
nag_lapack_zgeqpf (f08bs).
The real analogue of this function is
nag_lapack_dgeqrf (f08ae).
Example
This example solves the linear least squares problems
where
and
are the columns of the matrix
,
and
Open in the MATLAB editor:
f08as_example
function f08as_example
fprintf('f08as example results\n\n');
a = [ 0.96 - 0.81i, -0.03 + 0.96i, -0.91 + 2.06i, -0.05 + 0.41i;
-0.98 + 1.98i, -1.20 + 0.19i, -0.66 + 0.42i, -0.81 + 0.56i;
0.62 - 0.46i, 1.01 + 0.02i, 0.63 - 0.17i, -1.11 + 0.60i;
-0.37 + 0.38i, 0.19 - 0.54i, -0.98 - 0.36i, 0.22 - 0.20i;
0.83 + 0.51i, 0.20 + 0.01i, -0.17 - 0.46i, 1.47 + 1.59i;
1.08 - 0.28i, 0.20 - 0.12i, -0.07 + 1.23i, 0.26 + 0.26i];
b = [-2.09 + 1.93i, 3.26 - 2.70i;
3.34 - 3.53i, -6.22 + 1.16i;
-4.94 - 2.04i, 7.94 - 3.13i;
0.17 + 4.23i, 1.04 - 4.26i;
-5.19 + 3.63i, -2.31 - 2.12i;
0.98 + 2.53i, -1.39 - 4.05i];
[qr, tau, info] = f08as(a);
[c, info] = f08au(...
'Left', 'Conjugate transpose', qr, tau, b);
[x, info] = f07ts(...
'Upper', 'No transpose', 'Non-Unit', qr(1:4,:), c(1:4,:));
fprintf('Least-squares solution(s)\n');
disp(x);
fprintf('Square root(s) of the residual sum(s) of squares\n');
for i=1:2
fprintf('%8.3f ',norm(c(5:6,i)));
end
fprintf('\n');
f08as example results
Least-squares solution(s)
-0.5044 - 1.2179i 0.7629 + 1.4529i
-2.4281 + 2.8574i 5.1570 - 3.6089i
1.4872 - 2.1955i -2.6518 + 2.1203i
0.4537 + 2.6904i -2.7606 + 0.3318i
Square root(s) of the residual sum(s) of squares
0.069 0.187
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015