hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_eigen_real_gen_eigsys (f02ec)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_eigen_real_gen_eigsys (f02ec) computes selected eigenvalues and eigenvectors of a real general matrix.

Syntax

[a, m, wr, wi, vr, vi, ifail] = f02ec(crit, a, wl, wu, mest, 'n', n)
[a, m, wr, wi, vr, vi, ifail] = nag_eigen_real_gen_eigsys(crit, a, wl, wu, mest, 'n', n)

Description

nag_eigen_real_gen_eigsys (f02ec) computes selected eigenvalues and the corresponding right eigenvectors of a real general matrix A:
Axi = λi xi .  
Eigenvalues λi may be selected either by modulus, satisfying:
wl λi wu ,  
or by real part, satisfying:
wl Reλi wu .  
Note that even though A is real, λi and xi may be complex. If xi is an eigenvector corresponding to a complex eigenvalue λi, then the complex conjugate vector x-i is the eigenvector corresponding to the complex conjugate eigenvalue λ-i. The eigenvalues in a complex conjugate pair λi and λ-i are either both selected or both not selected.

References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Parameters

Compulsory Input Parameters

1:     crit – string (length ≥ 1)
Indicates the criterion for selecting eigenvalues.
crit='M'
Eigenvalues are selected according to their moduli: wlλiwu.
crit='R'
Eigenvalues are selected according to their real parts: wlReλiwu.
Constraint: crit='M' or 'R'.
2:     aldan – double array
lda, the first dimension of the array, must satisfy the constraint ldamax1,n.
The n by n general matrix A.
3:     wl – double scalar
4:     wu – double scalar
wl and wu, the lower and upper bounds on the criterion for the selected eigenvalues (see crit).
Constraint: wu>wl.
5:     mest int64int32nag_int scalar
The second dimension of the arrays vr and vi. mest must be an upper bound on m, the number of eigenvalues and eigenvectors selected. No eigenvectors are computed if mest<m.
Constraint: mestmax1,m.

Optional Input Parameters

1:     n int64int32nag_int scalar
Default: the second dimension of the array a.
n, the order of the matrix A.
Constraint: n0.

Output Parameters

1:     aldan – double array
Contains the Hessenberg form of the balanced input matrix A (see Further Comments).
2:     m int64int32nag_int scalar
m, the number of eigenvalues actually selected.
3:     wrn – double array
4:     win – double array
The first m elements of wr and wi hold the real and imaginary parts, respectively, of the selected eigenvalues; elements m+1 to n contain the other eigenvalues. Complex conjugate pairs of eigenvalues are stored in consecutive elements of the arrays, with the eigenvalue having positive imaginary part first. See also Further Comments.
5:     vrldvrmest – double array
Contains the real parts of the selected eigenvectors, with the ith column holding the real part of the eigenvector associated with the eigenvalue λi (stored in wri and wii).
6:     vildvimest – double array
Contains the imaginary parts of the selected eigenvectors, with the ith column holding the imaginary part of the eigenvector associated with the eigenvalue λi (stored in wri and wii).
7:     ifail int64int32nag_int scalar
ifail=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

   ifail=1
On entry,crit'M' or 'R',
orn<0,
orlda<max1,n,
orwuwl,
ormest<1,
orldvr<max1,n,
orldvi<max1,n,
orlwork<max1,n×n+4.
   ifail=2
The QR algorithm failed to compute all the eigenvalues. No eigenvectors have been computed.
   ifail=3
There are more than mest eigenvalues in the specified range. The actual number of eigenvalues in the range is returned in m. No eigenvectors have been computed. Rerun with the second dimension of vr and vi=mestm.
W  ifail=4
Inverse iteration failed to compute all the specified eigenvectors. If an eigenvector failed to converge, the corresponding column of vr and vi is set to zero.
   ifail=-99
An unexpected error has been triggered by this routine. Please contact NAG.
   ifail=-399
Your licence key may have expired or may not have been installed correctly.
   ifail=-999
Dynamic memory allocation failed.

Accuracy

If λi is an exact eigenvalue, and λ~i is the corresponding computed value, then
λ~i-λicnεA2si,  
where cn is a modestly increasing function of n, ε is the machine precision, and si is the reciprocal condition number of λi; A is the balanced form of the original matrix A (see Further Comments), and AA.
If xi is the corresponding exact eigenvector, and x~i is the corresponding computed eigenvector, then the angle θx~i,xi between them is bounded as follows:
θx~i,xicnεA2sepi,  
where sepi is the reciprocal condition number of xi.
The condition numbers si and sepi may be computed from the Hessenberg form of the balanced matrix A which is returned in the array a. This requires calling nag_lapack_dhseqr (f08pe) with job='S' to compute the Schur form of A, followed by nag_lapack_dtrsna (f08ql).

Further Comments

nag_eigen_real_gen_eigsys (f02ec) calls functions from LAPACK in Chapter F08. It first balances the matrix, using a diagonal similarity transformation to reduce its norm; and then reduces the balanced matrix A to upper Hessenberg form H, using an orthogonal similarity transformation: A=QHQT. The function uses the Hessenberg QR algorithm to compute all the eigenvalues of H, which are the same as the eigenvalues of A. It computes the eigenvectors of H which correspond to the selected eigenvalues, using inverse iteration. It premultiplies the eigenvectors by Q to form the eigenvectors of A; and finally transforms the eigenvectors to those of the original matrix A.
Each eigenvector x (real or complex) is normalized so that x2=1, and the element of largest absolute value is real.
The inverse iteration function may make a small perturbation to the real parts of close eigenvalues, and this may shift their moduli just outside the specified bounds. If you are relying on eigenvalues being within the bounds, you should test them on return from nag_eigen_real_gen_eigsys (f02ec).
The time taken by the function is approximately proportional to n3.
The function can be used to compute all eigenvalues and eigenvectors, by setting wl large and negative, and wu large and positive.

Example

This example computes those eigenvalues of the matrix A whose moduli lie in the range 0.2,0.5, and their corresponding eigenvectors, where
A= 0.35 0.45 -0.14 -0.17 0.09 0.07 -0.54 0.35 -0.44 -0.33 -0.03 0.17 0.25 -0.32 -0.13 0.11 .  
function f02ec_example


fprintf('f02ec example results\n\n');

a = [ 0.35,  0.45, -0.14, -0.17;
      0.09,  0.07, -0.54,  0.35;
     -0.44, -0.33, -0.03,  0.17;
      0.25, -0.32, -0.13,  0.11];

% Find eigenvalues of A such that 0.2 <= |eig| <= 0.5
crit = 'Moduli';
wl   = 0.2;
wu   = 0.5;
mest = int64(3);

[a, m, wr, wi, vr, vi, ifail] = f02ec( ...
                                       crit, a, wl, wu, mest);

evals = wr(1:m) + i*wi(1:m);
disp('Eigenvalues');
disp(evals);

evecs = vr(:,1:m) + i*vi(:,1:m);
disp('Eigenvectors');
disp(evecs);


f02ec example results

Eigenvalues
  -0.0994 + 0.4008i
  -0.0994 - 0.4008i

Eigenvectors
  -0.1933 + 0.2546i  -0.1933 - 0.2546i
   0.2519 - 0.5224i   0.2519 + 0.5224i
   0.0972 - 0.3084i   0.0972 + 0.3084i
   0.6760 + 0.0000i   0.6760 + 0.0000i


PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015