PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_dgghrd (f08we)
Purpose
nag_lapack_dgghrd (f08we) reduces a pair of real matrices , where is upper triangular, to the generalized upper Hessenberg form using orthogonal transformations.
Syntax
[
a,
b,
q,
z,
info] = f08we(
compq,
compz,
ilo,
ihi,
a,
b,
q,
z, 'n',
n)
[
a,
b,
q,
z,
info] = nag_lapack_dgghrd(
compq,
compz,
ilo,
ihi,
a,
b,
q,
z, 'n',
n)
Description
nag_lapack_dgghrd (f08we) is the third step in the solution of the real generalized eigenvalue problem
The (optional) first step balances the two matrices using
nag_lapack_dggbal (f08wh). In the second step, matrix
is reduced to upper triangular form using the
factorization function
nag_lapack_dgeqrf (f08ae) and this orthogonal transformation
is applied to matrix
by calling
nag_lapack_dormqr (f08ag).
nag_lapack_dgghrd (f08we) reduces a pair of real matrices
, where
is upper triangular, to the generalized upper Hessenberg form using orthogonal transformations. This two-sided transformation is of the form
where
is an upper Hessenberg matrix,
is an upper triangular matrix and
and
are orthogonal matrices determined as products of Givens rotations. They may either be formed explicitly, or they may be postmultiplied into input matrices
and
, so that
References
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Moler C B and Stewart G W (1973) An algorithm for generalized matrix eigenproblems SIAM J. Numer. Anal. 10 241–256
Parameters
Compulsory Input Parameters
- 1:
– string (length ≥ 1)
-
Specifies the form of the computed orthogonal matrix
.
- Do not compute .
- The orthogonal matrix is returned.
- q must contain an orthogonal matrix , and the product is returned.
Constraint:
, or .
- 2:
– string (length ≥ 1)
-
Specifies the form of the computed orthogonal matrix
.
- Do not compute .
- The orthogonal matrix is returned.
- z must contain an orthogonal matrix , and the product is returned.
Constraint:
, or .
- 3:
– int64int32nag_int scalar
- 4:
– int64int32nag_int scalar
-
and
as determined by a previous call to
nag_lapack_dggbal (f08wh). Otherwise, they should be set to
and
, respectively.
Constraints:
- if , ;
- if , and .
- 5:
– 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 matrix
of the matrix pair
. Usually, this is the matrix
returned by
nag_lapack_dormqr (f08ag).
- 6:
– double array
-
The first dimension of the array
b must be at least
.
The second dimension of the array
b must be at least
.
The upper triangular matrix
of the matrix pair
. Usually, this is the matrix
returned by the
factorization function
nag_lapack_dgeqrf (f08ae).
- 7:
– double array
-
The first dimension,
, of the array
q must satisfy
- if or , ;
- if , .
The second dimension of the array
q must be at least
if
or
and at least
if
.
If
,
q must contain an orthogonal matrix
.
If
,
q is not referenced.
- 8:
– double array
-
The first dimension,
, of the array
z must satisfy
- if or , ;
- if , .
The second dimension of the array
z must be at least
if
or
and at least
if
.
If
,
z must contain an orthogonal matrix
.
If
,
z is not referenced.
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the array
z.
, the order of the matrices and .
Constraint:
.
Output Parameters
- 1:
– double array
-
The first dimension of the array
a will be
.
The second dimension of the array
a will be
.
a stores the upper Hessenberg matrix
.
- 2:
– double array
-
The first dimension of the array
b will be
.
The second dimension of the array
b will be
.
b stores the upper triangular matrix
.
- 3:
– double array
-
The first dimension,
, of the array
q will be
- if or , ;
- if , .
The second dimension of the array
q will be
if
or
and at least
if
.
If
,
q contains the orthogonal matrix
.
If
,
q stores
.
- 4:
– double array
-
The first dimension,
, of the array
z will be
- if or , ;
- if , .
The second dimension of the array
z will be
if
or
and at least
if
.
If
,
z contains the orthogonal matrix
.
If
,
z stores
.
- 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:
compq, 2:
compz, 3:
n, 4:
ilo, 5:
ihi, 6:
a, 7:
lda, 8:
b, 9:
ldb, 10:
q, 11:
ldq, 12:
z, 13:
ldz, 14:
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 reduction to the generalized Hessenberg form is implemented using orthogonal transformations which are backward stable.
Further Comments
This function is usually followed by
nag_lapack_dhgeqz (f08xe) which implements the
algorithm for computing generalized eigenvalues of a reduced pair of matrices.
The complex analogue of this function is
nag_lapack_zgghrd (f08ws).
Example
Open in the MATLAB editor:
f08we_example
function f08we_example
fprintf('f08we example results\n\n');
a = [ 1.0 1.0 1.0 1.0 1.0;
2.0 4.0 8.0 16.0 32.0;
3.0 9.0 27.0 81.0 243.0;
4.0 16.0 64.0 256.0 1024.0;
5.0 25.0 125.0 625.0 3125.0];
b = a';
%' Balance A and B
job = 'B';
[a, b, ilo, ihi, lscale, rscale, info] = ...
f08wh( ...
job, a, b);
bbal = b(ilo:ihi,ilo:ihi);
abal = a(ilo:ihi,ilo:ihi);
[QR, tau, info] = f08ae(bbal);
side = 'Left';
trans = 'Transpose';
[c, info] = f08ag( ...
side, trans, QR, tau, abal);
compq = 'No Q';
compz = 'No Z';
z = eye(4);
q = eye(4);
jlo = int64(1);
jhi = int64(ihi-ilo+1);
[H, T, ~, ~, info] = ...
f08we( ...
compq, compz, jlo, jhi, c, QR, q, z);
job = 'Eigenvalues';
[~, ~, alphar, alphai, beta, ~, ~, info] = ...
f08xe( ...
job, compq, compz, jlo, jhi, H, T, q, z);
disp('Generalized eigenvalues of (A,B):');
w = complex(alphar+i*alphai);
disp(w./beta);
f08we example results
Generalized eigenvalues of (A,B):
-2.4367 + 0.0000i
0.6069 + 0.7948i
0.6069 - 0.7948i
1.0000 + 0.0000i
-0.4104 + 0.0000i
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015