PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_zggsvp (f08vs)
Purpose
nag_lapack_zggsvp (f08vs) uses unitary transformations to simultaneously reduce the by matrix and the by matrix to upper triangular form. This factorization is usually used as a preprocessing step for computing the generalized singular value decomposition (GSVD).
Syntax
[
a,
b,
k,
l,
u,
v,
q,
info] = f08vs(
jobu,
jobv,
jobq,
a,
b,
tola,
tolb, 'm',
m, 'p',
p, 'n',
n)
[
a,
b,
k,
l,
u,
v,
q,
info] = nag_lapack_zggsvp(
jobu,
jobv,
jobq,
a,
b,
tola,
tolb, 'm',
m, 'p',
p, 'n',
n)
Description
nag_lapack_zggsvp (f08vs) computes unitary matrices
,
and
such that
where the
by
matrix
and
by
matrix
are nonsingular upper triangular;
is
by
upper triangular if
and is
by
upper trapezoidal otherwise.
is the effective numerical rank of the
by
matrix
.
This decomposition is usually used as the preprocessing step for computing the Generalized Singular Value Decomposition (GSVD), see function
nag_lapack_zggsvd (f08vn).
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
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Parameters
Compulsory Input Parameters
- 1:
– string (length ≥ 1)
-
If
, the unitary matrix
is computed.
If , is not computed.
Constraint:
or .
- 2:
– string (length ≥ 1)
-
If
, the unitary matrix
is computed.
If , is not computed.
Constraint:
or .
- 3:
– string (length ≥ 1)
-
If
, the unitary matrix
is computed.
If , is not computed.
Constraint:
or .
- 4:
– 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 .
- 5:
– 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 .
- 6:
– double scalar
- 7:
– double scalar
-
tola and
tolb are the thresholds to determine the effective numerical rank of matrix
and a subblock of
. Generally, they are set to
where
is the
machine precision.
The size of
tola and
tolb may affect the size of backward errors of the decomposition.
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 first dimension of the array
b.
, the number of rows of the matrix .
Constraint:
.
- 3:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
a.
, the number of columns of the matrices and .
Constraint:
.
Output Parameters
- 1:
– complex array
-
The first dimension of the array
a will be
.
The second dimension of the array
a will be
.
Contains the triangular (or trapezoidal) matrix described in
Description.
- 2:
– complex array
-
The first dimension of the array
b will be
.
The second dimension of the array
b will be
.
Contains the triangular matrix described in
Description.
- 3:
– int64int32nag_int scalar
- 4:
– int64int32nag_int scalar
-
k and
l specify the dimension of the subblocks
and
as described in
Description;
is the effective numerical rank of
.
- 5:
– complex array
-
The first dimension,
, of the array
u will be
- if , ;
- otherwise .
The second dimension of the array
u will be
if
and
otherwise.
If
,
u contains the unitary matrix
.
If
,
u is not referenced.
- 6:
– complex array
-
The first dimension,
, of the array
v will be
- if , ;
- otherwise .
The second dimension of the array
v will be
if
and
otherwise.
If
,
v contains the unitary matrix
.
If
,
v is not referenced.
- 7:
– complex array
-
The first dimension,
, of the array
q will be
- if , ;
- otherwise .
The second dimension of the array
q will be
if
and
otherwise.
If
,
q contains the unitary matrix
.
If
,
q is not referenced.
- 8:
– 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:
jobu, 2:
jobv, 3:
jobq, 4:
m, 5:
p, 6:
n, 7:
a, 8:
lda, 9:
b, 10:
ldb, 11:
tola, 12:
tolb, 13:
k, 14:
l, 15:
u, 16:
ldu, 17:
v, 18:
ldv, 19:
q, 20:
ldq, 21:
iwork, 22:
rwork, 23:
tau, 24:
work, 25:
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 nearly the exact factorization for nearby matrices
and
, where
and
is the
machine precision.
Further Comments
The real analogue of this function is
nag_lapack_dggsvp (f08ve).
Example
This example finds the generalized factorization
of the matrix pair
, where
and
Open in the MATLAB editor:
f08vs_example
function f08vs_example
fprintf('f08vs example results\n\n');
m = 6;
n = 4;
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];
p = 2;
b = complex([ 1 0 -1 0;
0 1 0 -1]);
tola = max(m,n)*norm(a,1)*x02aj;
tolb = max(p,n)*norm(a,1)*x02aj;
[S, T, k, l, U, V, Q, info] = ...
f08vs( ...
'U', 'V', 'Q', a, b, tola, tolb);
[S, T, alpha, beta, U, V, Q, ncycle, info] = ...
f08ys( ...
'U', 'V', 'Q', k, l, S, T, tola, tolb, U, V, Q);
fprintf('Number of infinite generalized singular values = %3d\n',k);
fprintf('Number of finite generalized singular values = %3d\n',l);
fprintf('Effective rank of the matrix pair (A^T B^T)^T = %3d\n',k+l);
fprintf('Number of cycles of the Kogbetliantz method = %3d\n\n',ncycle);
disp('Finite generalized singular values');
disp(alpha(k+1:k+l)./beta(k+1:k+l));
f08vs example results
Number of infinite generalized singular values = 2
Number of finite generalized singular values = 2
Effective rank of the matrix pair (A^T B^T)^T = 4
Number of cycles of the Kogbetliantz method = 2
Finite generalized singular values
2.0720
1.1058
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015