cgeevx - compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
SUBROUTINE CGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, * LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONE, RCONV, WORK, * LDWORK, WORK2, INFO) CHARACTER * 1 BALANC, JOBVL, JOBVR, SENSE COMPLEX A(LDA,*), W(*), VL(LDVL,*), VR(LDVR,*), WORK(*) INTEGER N, LDA, LDVL, LDVR, ILO, IHI, LDWORK, INFO REAL ABNRM REAL SCALE(*), RCONE(*), RCONV(*), WORK2(*)
SUBROUTINE CGEEVX_64( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, * LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONE, RCONV, WORK, * LDWORK, WORK2, INFO) CHARACTER * 1 BALANC, JOBVL, JOBVR, SENSE COMPLEX A(LDA,*), W(*), VL(LDVL,*), VR(LDVR,*), WORK(*) INTEGER*8 N, LDA, LDVL, LDVR, ILO, IHI, LDWORK, INFO REAL ABNRM REAL SCALE(*), RCONE(*), RCONV(*), WORK2(*)
SUBROUTINE GEEVX( BALANC, JOBVL, JOBVR, SENSE, [N], A, [LDA], W, VL, * [LDVL], VR, [LDVR], ILO, IHI, SCALE, ABNRM, RCONE, RCONV, [WORK], * [LDWORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: BALANC, JOBVL, JOBVR, SENSE COMPLEX, DIMENSION(:) :: W, WORK COMPLEX, DIMENSION(:,:) :: A, VL, VR INTEGER :: N, LDA, LDVL, LDVR, ILO, IHI, LDWORK, INFO REAL :: ABNRM REAL, DIMENSION(:) :: SCALE, RCONE, RCONV, WORK2
SUBROUTINE GEEVX_64( BALANC, JOBVL, JOBVR, SENSE, [N], A, [LDA], W, * VL, [LDVL], VR, [LDVR], ILO, IHI, SCALE, ABNRM, RCONE, RCONV, * [WORK], [LDWORK], [WORK2], [INFO]) CHARACTER(LEN=1) :: BALANC, JOBVL, JOBVR, SENSE COMPLEX, DIMENSION(:) :: W, WORK COMPLEX, DIMENSION(:,:) :: A, VL, VR INTEGER(8) :: N, LDA, LDVL, LDVR, ILO, IHI, LDWORK, INFO REAL :: ABNRM REAL, DIMENSION(:) :: SCALE, RCONE, RCONV, WORK2
#include <sunperf.h>
void cgeevx(char balanc, char jobvl, char jobvr, char sense, int n, complex *a, int lda, complex *w, complex *vl, int ldvl, complex *vr, int ldvr, int *ilo, int *ihi, float *scale, float *abnrm, float *rcone, float *rconv, int *info);
void cgeevx_64(char balanc, char jobvl, char jobvr, char sense, long n, complex *a, long lda, complex *w, complex *vl, long ldvl, complex *vr, long ldvr, long *ilo, long *ihi, float *scale, float *abnrm, float *rcone, float *rconv, long *info);
cgeevx computes for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors.
Optionally also, it computes a balancing transformation to improve the conditioning of the eigenvalues and eigenvectors (ILO, IHI, SCALE, and ABNRM), reciprocal condition numbers for the eigenvalues (RCONDE), and reciprocal condition numbers for the right
eigenvectors (RCONDV).
The right eigenvector v(j) of A satisfies
A * v(j) = lambda(j) * v(j)
where lambda(j) is its eigenvalue.
The left eigenvector u(j) of A satisfies
u(j)**H * A = lambda(j) * u(j)**H
where u(j)**H denotes the conjugate transpose of u(j).
The computed eigenvectors are normalized to have Euclidean norm equal to 1 and largest component real.
Balancing a matrix means permuting the rows and columns to make it more nearly upper triangular, and applying a diagonal similarity transformation D * A * D**(-1), where D is a diagonal matrix, to make 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.10.2 of the LAPACK Users' Guide.
= 'P': Perform permutations to make the matrix more nearly upper triangular. Do not diagonally scale; = 'S': Diagonally scale the matrix, ie. replace A by D*A*D**(-1), where D is a diagonal matrix chosen to make the rows and columns of A more equal in norm. Do not permute; = 'B': Both diagonally scale and permute A.
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.
= 'N': left eigenvectors of A are not computed;
= 'V': left eigenvectors of A are computed. If SENSE = 'E' or 'B', JOBVL must = 'V'.
= 'N': right eigenvectors of A are not computed;
= 'V': right eigenvectors of A are computed. If SENSE = 'E' or 'B', JOBVR must = 'V'.
= 'E': Computed for eigenvalues only;
= 'V': Computed for right eigenvectors only;
= 'B': Computed for eigenvalues and right eigenvectors.
If SENSE = 'E' or 'B', both left and right eigenvectors must also be computed (JOBVL = 'V' and JOBVR = 'V').
u(j) are stored one
after another in the columns of VL, in the same order
as their eigenvalues.
If JOBVL = 'N', VL is not referenced.
u(j) = VL(:,j), the j-th column of VL.
v(j) are stored one
after another in the columns of VR, in the same order
as their eigenvalues.
If JOBVR = 'N', VR is not referenced.
v(j) = VR(:,j), the j-th column of VR.
A(i,j) = 0 if I > J and
J = 1,...,ILO-1 or I = IHI+1,...,N.
A(i,j) = 0 if I > J and
J = 1,...,ILO-1 or I = IHI+1,...,N.
P(j) is the index of the row and column
interchanged with row and column j, and D(j) is the scaling
factor applied to row and column j, then
SCALE(J) = P(J), for J = 1,...,ILO-1
= D(J), for J = ILO,...,IHI
= P(J) for J = IHI+1,...,N.
The order in which the interchanges are made is N to IHI+1,
then 1 to ILO-1.
RCONE(j) is the reciprocal condition number of the j-th
eigenvalue.
RCONV(j) is the reciprocal condition number of the j-th
right eigenvector.
WORK(1) returns the optimal LDWORK.
If LDWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LDWORK is issued by XERBLA.
dimension(2*N)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value.
> 0: if INFO = i, the QR algorithm failed to compute all the eigenvalues, and no eigenvectors or condition numbers have been computed; elements 1:ILO-1 and i+1:N of W contain eigenvalues which have converged.