PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_zggqrf (f08zs)
Purpose
nag_lapack_zggqrf (f08zs) computes a generalized factorization of a complex matrix pair , where is an by matrix and is an by matrix.
Syntax
[
a,
taua,
b,
taub,
info] = f08zs(
a,
b, 'n',
n, 'm',
m, 'p',
p)
[
a,
taua,
b,
taub,
info] = nag_lapack_zggqrf(
a,
b, 'n',
n, 'm',
m, 'p',
p)
Description
nag_lapack_zggqrf (f08zs) forms the generalized
factorization of an
by
matrix
and an
by
matrix
where
is an
by
unitary matrix,
is a
by
unitary matrix and
and
are of the form
with
upper triangular,
with
or
upper triangular.
In particular, if
is square and nonsingular, the generalized
factorization of
and
implicitly gives the
factorization of
as
References
Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999)
LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia
http://www.netlib.org/lapack/lug
Anderson E, Bai Z and Dongarra J (1992) Generalized QR factorization and its applications Linear Algebra Appl. (Volume 162–164) 243–271
Hammarling S (1987) The numerical solution of the general Gauss-Markov linear model Mathematics in Signal Processing (eds T S Durrani, J B Abbiss, J E Hudson, R N Madan, J G McWhirter and T A Moore) 441–456 Oxford University Press
Paige C C (1990) Some aspects of generalized factorizations . In Reliable Numerical Computation (eds M G Cox and S Hammarling) 73–91 Oxford University Press
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 .
- 2:
– complex array
-
The first dimension of the array
b must be at least
.
The second dimension of the array
b must be at least
.
The by matrix .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the arrays
a,
b. (An error is raised if these dimensions are not equal.)
, the number of rows of the matrices and .
Constraint:
.
- 2:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
a.
, the number of columns of the matrix .
Constraint:
.
- 3:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
b.
, 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
.
The elements on and above the diagonal of the array contain the
by
upper trapezoidal matrix
(
is upper triangular if
); the elements below the diagonal, with the array
taua, represent the unitary matrix
as a product of
elementary reflectors (see
Representation of orthogonal or unitary matrices in the F08 Chapter Introduction).
- 2:
– complex array
-
The scalar factors of the elementary reflectors which represent the unitary matrix .
- 3:
– complex array
-
The first dimension of the array
b will be
.
The second dimension of the array
b will be
.
If
, the upper triangle of the subarray
contains the
by
upper triangular matrix
.
If
, the elements on and above the
th subdiagonal contain the
by
upper trapezoidal matrix
; the remaining elements, with the array
taub, represent the unitary matrix
as a product of elementary reflectors (see
Representation of orthogonal or unitary matrices in the F08 Chapter Introduction).
- 4:
– complex array
-
The scalar factors of the elementary reflectors which represent the unitary matrix .
- 5:
– 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:
n, 2:
m, 3:
p, 4:
a, 5:
lda, 6:
taua, 7:
b, 8:
ldb, 9:
taub, 10:
work, 11:
lwork, 12:
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 generalized
factorization is the exact factorization for nearby matrices
and
, where
and
is the
machine precision.
Further Comments
The unitary matrices
and
may be formed explicitly by calls to
nag_lapack_zungqr (f08at) and
nag_lapack_zungrq (f08cw) respectively.
nag_lapack_zunmqr (f08au) may be used to multiply
by another matrix and
nag_lapack_zunmrq (f08cx) may be used to multiply
by another matrix.
The real analogue of this function is
nag_lapack_dggqrf (f08ze).
Example
This example solves the general Gauss–Markov linear model problem
where
and
The solution is obtained by first computing a generalized factorization of the matrix pair . The example illustrates the general solution process, although the above data corresponds to a simple weighted least squares problem.
Note that the block size (NB) of assumed in this example is not realistic for such a small problem, but should be suitable for large problems.
Open in the MATLAB editor:
f08zs_example
function f08zs_example
fprintf('f08zs example results\n\n');
a = [ 0.96 - 0.81i, -0.03 + 0.96i, -0.91 + 2.06i;
-0.98 + 1.98i, -1.20 + 0.19i, -0.66 + 0.42i;
0.62 - 0.46i, 1.01 + 0.02i, 0.63 - 0.17i;
1.08 - 0.28i, 0.20 - 0.12i, -0.07 + 1.23i];
b = [ 0.5 - 1i, 0 + 0i, 0 + 0i, 0 + 0i;
0 + 0i, 1 - 2i, 0 + 0i, 0 + 0i;
0 + 0i, 0 + 0i, 2 - 3i, 0 + 0i;
0 + 0i, 0 + 0i, 0 + 0i, 5 - 4i];
d = [ 6.00 - 0.40i;
-5.27 + 0.90i;
2.72 - 2.13i;
-1.30 - 2.80i];
[n,m] = size(a);
p = size(b,2);
[a, taua, b, taub, info] = f08zs( ...
a, b);
[c, info] = f08au( ...
'Left', 'Conjugate Transpose', a, taua, d);
y = zeros(p, 1);
if n > m
indy = m+p-n+1:p;
[y(indy), info] = f07ts( ...
'Upper', 'No transpose', 'Non-unit', ...
complex(b(m+1:n, indy)), c(m+1:n));
rnorm = norm(y(indy), 1);
c = c - b(:,indy)*y(indy);
end
[c(1:m), info] = f07ts( ...
'Upper', 'No transpose', 'Non-unit', a(1:m,:), c(1:m));
[b(max(1, n-p+1):n,:), y, info] = ...
f08cx( ...
'Left', 'Conjugate Transpose', b(max(1, n-p+1):n,:), taub, y);
disp('Generalized least squares solution');
disp(c(1:m));
ncols = int64(80);
indent = int64(0);
[ifail] = x04db( ...
'Gen', ' ', y, 'B', '1P,E10.2', 'Residual vector', ...
'N', 'N', ncols, indent);
fprintf('\nSquare root of the residual sum of squares\n%11.2e\n', ...
rnorm);
f08zs example results
Generalized least squares solution
-0.9846 + 1.9950i
3.9929 - 4.9748i
-3.0026 + 0.9994i
Residual vector
( 1.26E-04, -4.66E-04)
( 1.11E-03, -8.61E-04)
( 3.84E-03, -1.82E-03)
( 2.03E-03, 3.02E-03)
Square root of the residual sum of squares
5.79e-03
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015