PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_dgeevx (f08nb)
Purpose
nag_lapack_dgeevx (f08nb) computes the eigenvalues and, optionally, the left and/or right eigenvectors for an by real nonsymmetric matrix .
Optionally, it also computes a balancing transformation to improve the conditioning of the eigenvalues and eigenvectors, reciprocal condition numbers for the eigenvalues, and reciprocal condition numbers for the right eigenvectors.
Syntax
[
a,
wr,
wi,
vl,
vr,
ilo,
ihi,
scale,
abnrm,
rconde,
rcondv,
info] = f08nb(
balanc,
jobvl,
jobvr,
sense,
a, 'n',
n)
[
a,
wr,
wi,
vl,
vr,
ilo,
ihi,
scale,
abnrm,
rconde,
rcondv,
info] = nag_lapack_dgeevx(
balanc,
jobvl,
jobvr,
sense,
a, 'n',
n)
Description
The right eigenvector
of
satisfies
where
is the
th eigenvalue of
. The left eigenvector
of
satisfies
where
denotes the conjugate transpose of
.
Balancing a matrix means permuting the rows and columns to make it more nearly upper triangular, and applying a diagonal similarity transformation
, where
is a diagonal matrix, with the aim of making its rows and columns closer in norm and the condition numbers of its eigenvalues and eigenvectors smaller. The computed reciprocal condition numbers correspond to the balanced matrix. Permuting rows and columns will not change the condition numbers (in exact arithmetic) but diagonal scaling will. For further explanation of balancing, see Section 4.8.1.2 of
Anderson et al. (1999).
Following the optional balancing, the matrix is first reduced to upper Hessenberg form by means of unitary similarity transformations, and the algorithm is then used to further reduce the matrix to upper triangular Schur form, , from which the eigenvalues are computed. Optionally, the eigenvectors of are also computed and backtransformed to those of .
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)
-
Indicates how the input matrix should be diagonally scaled and/or permuted to improve the conditioning of its eigenvalues.
- Do not diagonally scale or permute.
- Perform permutations to make the matrix more nearly upper triangular. Do not diagonally scale.
- Diagonally scale the matrix, i.e., replace by , where is a diagonal matrix chosen to make the rows and columns of more equal in norm. Do not permute.
- Both diagonally scale and permute .
Computed reciprocal condition numbers will be for the matrix after balancing and/or permuting. Permuting does not change condition numbers (in exact arithmetic), but balancing does.
Constraint:
, , or .
- 2:
– string (length ≥ 1)
-
If
, the left eigenvectors of
are not computed.
If , the left eigenvectors of are computed.
If
or
,
jobvl must be set to
.
Constraint:
or .
- 3:
– string (length ≥ 1)
-
If
, the right eigenvectors of
are not computed.
If , the right eigenvectors of are computed.
If
or
,
jobvr must be set to
.
Constraint:
or .
- 4:
– string (length ≥ 1)
-
Determines which reciprocal condition numbers are computed.
- None are computed.
- Computed for eigenvalues only.
- Computed for right eigenvectors only.
- Computed for eigenvalues and right eigenvectors.
If or , both left and right eigenvectors must also be computed ( and ).
Constraint:
, , or .
- 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 by matrix .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the array
a and the second dimension of the array
a. (An error is raised if these dimensions are not equal.)
, the order of the matrix .
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 has been overwritten. If
or
,
contains the real Schur form of the balanced version of the input matrix
.
- 2:
– double array
- 3:
– double array
-
The dimension of the arrays
wr and
wi will be
wr and
wi contain the real and imaginary parts, respectively, of the computed eigenvalues. Complex conjugate pairs of eigenvalues appear consecutively with the eigenvalue having the positive imaginary part first.
- 4:
– double 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 eigenvectors
are stored one after another in the columns of
vl, in the same order as their corresponding eigenvalues. If the
th eigenvalue is real, then
, the
th column of
vl. If the
th and
st eigenvalues form a complex conjugate pair, then
and
.
If
,
vl is not referenced.
- 5:
– double 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 eigenvectors
are stored one after another in the columns of
vr, in the same order as their corresponding eigenvalues. If the
th eigenvalue is real, then
, the
th column of
vr. If the
th and
st eigenvalues form a complex conjugate pair, then
and
.
If
,
vr is not referenced.
- 6:
– int64int32nag_int scalar
- 7:
– int64int32nag_int scalar
-
ilo and
ihi are integer values determined when
was balanced. The balanced
has
if
and
or
.
- 8:
– double array
-
The dimension of the array
scale will be
Details of the permutations and scaling factors applied when balancing
.
If
is the index of the row and column interchanged with row and column
, and
is the scaling factor applied to row and column
, then
- , for ;
- , for ;
- , for .
The order in which the interchanges are made is
n to
, then
to
.
- 9:
– double scalar
-
The -norm of the balanced matrix (the maximum of the sum of absolute values of elements of any column).
- 10:
– double array
-
The dimension of the array
rconde will be
is the reciprocal condition number of the th eigenvalue.
- 11:
– double array
-
The dimension of the array
rcondv will be
is the reciprocal condition number of the th right eigenvector.
- 12:
– 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:
balanc, 2:
jobvl, 3:
jobvr, 4:
sense, 5:
n, 6:
a, 7:
lda, 8:
wr, 9:
wi, 10:
vl, 11:
ldvl, 12:
vr, 13:
ldvr, 14:
ilo, 15:
ihi, 16:
scale, 17:
abnrm, 18:
rconde, 19:
rcondv, 20:
work, 21:
lwork, 22:
iwork, 23:
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
-
If
, the
algorithm failed to compute all the eigenvalues, and no eigenvectors or condition numbers have been computed; elements
and
of
wr and
wi contain eigenvalues which have converged.
Accuracy
The computed eigenvalues and eigenvectors are exact for a nearby matrix
, where
and
is the
machine precision. See Section 4.8 of
Anderson et al. (1999) for further details.
Further Comments
Each eigenvector is normalized to have Euclidean norm equal to unity and the element of largest absolute value real.
The total number of floating-point operations is proportional to .
The complex analogue of this function is
nag_lapack_zgeevx (f08np).
Example
This example finds all the eigenvalues and right eigenvectors of the matrix
together with estimates of the condition number and forward error bounds for each eigenvalue and eigenvector. The option to balance the matrix is used. In order to compute the condition numbers of the eigenvalues, the left eigenvectors also have to be computed, but they are not printed out in this example.
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:
f08nb_example
function f08nb_example
fprintf('f08nb example results\n\n');
n = 4;
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];
balanc = 'Balance';
jobvl = 'Vectors (left)';
jobvr = 'Vectors (right)';
sense = 'Both reciprocal condition numbers';
[a, wr, wi, vl, vr, ilo, ihi, scale, abnrm, rconde, rcondv, info] = ...
f08nb( ...
balanc, jobvl, jobvr, sense, a);
disp('Eigenvalues');
fprintf('\n Eigenvalue rcond\n\n');
for j=1:n
fprintf('%3d',j);
if wi(j)==0
fprintf('%15.4e%24.4f\n',wr(j),rconde(j));
elseif wi(j)<0
fprintf('%15.4e - %10.4ei%10.4f\n',wr(j),abs(wi(j)),rconde(j));
else
fprintf('%15.4e + %10.4ei%10.4f\n',wr(j),wi(j),rconde(j));
end
end
fprintf('\nEigenvectors\n\n');
fprintf(' Eigenvector rcond\n');
evecs = complex(zeros(n,n));
k = 1;
conjugating = false;
for j = 1:n
fprintf('\n%3d',j);
if wi(j)==0 && ~conjugating
fprintf('%15.4e%24.4f\n',vr(1,k),rcondv(j));
fprintf('%18.4e\n',vr(2:n,k));
k = k + 1;
else
if conjugating
pl = '-';
mi = '+';
else
pl = '+';
mi = '-';
end
for l = 1:n
if (l>1)
fprintf('%3s', ' ');
end
if vr(l,k+1)>0
fprintf('%15.4e %s %10.4ei', vr(l,k), pl, vr(l,k+1));
else
fprintf('%15.4e %s %10.4ei', vr(l,k), mi, abs(vr(l,k+1)));
end
if l==1
fprintf('%10.4f', rcondv(j));
end
fprintf('\n');
end
if conjugating
k = k + 2;
end
conjugating = ~conjugating;
end
end
f08nb example results
Eigenvalues
Eigenvalue rcond
1 7.9948e-01 0.9936
2 -9.9412e-02 + 4.0079e-01i 0.7027
3 -9.9412e-02 - 4.0079e-01i 0.7027
4 -1.0066e-01 0.5710
Eigenvectors
Eigenvector rcond
1 -6.5509e-01 0.6252
-5.2363e-01
5.3622e-01
-9.5607e-02
2 -1.9330e-01 + 2.5463e-01i 0.3996
2.5186e-01 - 5.2240e-01i
9.7182e-02 - 3.0838e-01i
6.7595e-01 - 0.0000e+00i
3 -1.9330e-01 - 2.5463e-01i 0.3996
2.5186e-01 + 5.2240e-01i
9.7182e-02 + 3.0838e-01i
6.7595e-01 + 0.0000e+00i
4 1.2533e-01 0.3125
3.3202e-01
5.9384e-01
7.2209e-01
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015