PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_zggev (f08wn)
Purpose
nag_lapack_zggev (f08wn) computes for a pair of by complex nonsymmetric matrices the generalized eigenvalues and, optionally, the left and/or right generalized eigenvectors using the algorithm.
Syntax
[
a,
b,
alpha,
beta,
vl,
vr,
info] = f08wn(
jobvl,
jobvr,
a,
b, 'n',
n)
[
a,
b,
alpha,
beta,
vl,
vr,
info] = nag_lapack_zggev(
jobvl,
jobvr,
a,
b, 'n',
n)
Description
A generalized eigenvalue for a pair of matrices is a scalar or a ratio , such that is singular. It is usually represented as the pair , as there is a reasonable interpretation for , and even for both being zero.
The right generalized eigenvector
corresponding to the generalized eigenvalue
of
satisfies
The left generalized eigenvector
corresponding to the generalized eigenvalue
of
satisfies
where
is the conjugate-transpose of
.
All the eigenvalues and, if required, all the eigenvectors of the complex generalized eigenproblem
, where
and
are complex, square matrices, are determined using the
algorithm. The complex
algorithm consists of three stages:
1. |
is reduced to upper Hessenberg form (with real, non-negative subdiagonal elements) and at the same time is reduced to upper triangular form. |
2. |
is further reduced to triangular form while the triangular form of is maintained and the diagonal elements of are made real and non-negative. This is the generalized Schur form of the pair .
This function does not actually produce the eigenvalues , but instead returns and such that
The division by becomes your responsibility, since may be zero, indicating an infinite eigenvalue. |
3. |
If the eigenvectors are required they are obtained from the triangular matrices and then transformed back into the original coordinate system. |
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
Wilkinson J H (1979) Kronecker's canonical form and the algorithm Linear Algebra Appl. 28 285–303
Parameters
Compulsory Input Parameters
- 1:
– string (length ≥ 1)
-
If
, do not compute the left generalized eigenvectors.
If , compute the left generalized eigenvectors.
Constraint:
or .
- 2:
– string (length ≥ 1)
-
If
, do not compute the right generalized eigenvectors.
If , compute the right generalized eigenvectors.
Constraint:
or .
- 3:
– 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 matrix in the pair .
- 4:
– 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 matrix in the pair .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the arrays
a,
b and the second dimension of the arrays
a,
b. (An error is raised if these dimensions are not equal.)
, the order 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
.
- 2:
– complex array
-
The first dimension of the array
b will be
.
The second dimension of the array
b will be
.
- 3:
– complex array
-
See the description of
beta.
- 4:
– complex array
-
, for
, will be the generalized eigenvalues.
Note: the quotients may easily overflow or underflow, and may even be zero. Thus, you should avoid naively computing the ratio . However, will always be less than and usually comparable with in magnitude, and will always be less than and usually comparable with .
- 5:
– complex array
-
The first dimension,
, of the array
vl will be
- if , ;
- otherwise .
The second dimension of the array
vl will be
if
and
otherwise.
If
, the left generalized eigenvectors
are stored one after another in the columns of
vl, in the same order as the corresponding eigenvalues. Each eigenvector will be scaled so the largest component will have
.
If
,
vl is not referenced.
- 6:
– complex array
-
The first dimension,
, of the array
vr will be
- if , ;
- otherwise .
The second dimension of the array
vr will be
if
and
otherwise.
If
, the right generalized eigenvectors
are stored one after another in the columns of
vr, in the same order as the corresponding eigenvalues. Each eigenvector will be scaled so the largest component will have
.
If
,
vr is not referenced.
- 7:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
Cases prefixed with W are classified as warnings and
do not generate an error of type NAG:error_n. See nag_issue_warnings.
-
If , parameter had an illegal value on entry. The parameters are numbered as follows:
1:
jobvl, 2:
jobvr, 3:
n, 4:
a, 5:
lda, 6:
b, 7:
ldb, 8:
alpha, 9:
beta, 10:
vl, 11:
ldvl, 12:
vr, 13:
ldvr, 14:
work, 15:
lwork, 16:
rwork, 17:
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.
- W
-
The iteration failed. No eigenvectors have been calculated, but and should be correct for .
-
-
Unexpected error returned from
nag_lapack_zhgeqz (f08xs).
-
-
Accuracy
The computed eigenvalues and eigenvectors are exact for a nearby matrices
and
, where
and
is the
machine precision. See Section 4.11 of
Anderson et al. (1999) for further details.
Note: interpretation of results obtained with the
algorithm often requires a clear understanding of the effects of small changes in the original data. These effects are reviewed in
Wilkinson (1979), in relation to the significance of small values of
and
. It should be noted that if
and
are
both small for any
, it may be that no reliance can be placed on
any of the computed eigenvalues
. You are recommended to study
Wilkinson (1979) and, if in difficulty, to seek expert advice on determining the sensitivity of the eigenvalues to perturbations in the data.
Further Comments
The total number of floating-point operations is proportional to .
The real analogue of this function is
nag_lapack_dggev (f08wa).
Example
This example finds all the eigenvalues and right eigenvectors of the matrix pair
,
where
and
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:
f08wn_example
function f08wn_example
fprintf('f08wn example results\n\n');
n = 4;
a = [ -21.10 - 22.50i, 53.5 - 50.5i, -34.5 + 127.5i, 7.5 + 0.5i;
-0.46 - 7.78i, -3.5 - 37.5i, -15.5 + 58.5i, -10.5 - 1.5i;
4.30 - 5.50i, 39.7 - 17.1i, -68.5 + 12.5i, -7.5 - 3.5i;
5.50 + 4.40i, 14.4 + 43.3i, -32.5 - 46.00i, -19.0 - 32.5i];
b = [ 1 - 5i, 1.6 + 1.2i, -3 + 0i, 0 - 1i;
0.8 - 0.6i, 3 - 5i, -4 + 3i, -2.4 - 3.2i;
1 + 0i, 2.4 + 1.8i, -4 - 5i, 0 - 3i;
0 + 1i, -1.8 + 2.4i, 0 - 4i, 4 - 5i];
jobvl = 'No left vectors';
jobvr = 'Vectors (right)';
[~, ~, alpha, beta, ~, VR, info] = ...
f08wn( ...
jobvl, jobvr, a, b);
small = x02am;
[eigs, pos] = sort(alpha./beta);
for j=1:n
if (abs(alpha(pos(j)))*small >= abs(beta(pos(j))))
fprintf('\n%4d: Eigenvalue is numerically infinite or undetermined\n',j);
fprintf('%4d: alpha = (%11.4e,%11.4e), beta = (%11.4e,%11.4e)\n', ...
j, real(alpha(j)), imag(alpha(j)), real(beta(j)), imag(beta(j)));
else
fprintf('Eigenvalue (%d):\n', j);
disp(eigs(j));
end
fprintf('Eigenvector (%d):\n', j);
disp(VR(:, pos(j))/VR(1, pos(j)));
end
f08wn example results
Eigenvalue (1):
3.0000 - 1.0000i
Eigenvector (1):
1.0000 + 0.0000i
0.1600 - 0.1200i
0.1200 - 0.1600i
0.1600 + 0.1200i
Eigenvalue (2):
2.0000 - 5.0000i
Eigenvector (2):
1.0000 - 0.0000i
0.0046 - 0.0034i
0.0629 + 0.0000i
-0.0000 + 0.0629i
Eigenvalue (3):
4.0000 - 5.0000i
Eigenvector (3):
1.0000 + 0.0000i
0.0089 - 0.0067i
-0.0333 + 0.0000i
-0.0000 + 0.1556i
Eigenvalue (4):
3.0000 - 9.0000i
Eigenvector (4):
1.0000 - 0.0000i
0.1600 - 0.1200i
0.1200 + 0.1600i
-0.1600 + 0.1200i
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015