SRC/dtrevc.f(3)
π¦ SRC/dtrevc.f(3) β Library Functions Manual π¦
okay bestie, welcome to the Library Functions Manual page for SRC/dtrevc.f(3) β itβs giving very βlinear algebra but make it fashionβ energy, and honestly? iconic. π
β¨
π NAME π
SRC/dtrevc.f
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine dtrevc (side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr,
mm, m, work, info)
DTREVC
β¨ Function/Subroutine Documentation β¨
subroutine dtrevc (character side, character howmny, logical, dimension( * )
select, integer n, double precision, dimension( ldt, * ) t, integer ldt,
double precision, dimension( ldvl, * ) vl, integer ldvl, double
precision, dimension( ldvr, * ) vr, integer ldvr, integer mm, integer m,
double precision, dimension( * ) work, integer info)
DTREVC
π Purpose π
DTREVC computes some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T.
Matrices of this type are produced by the Schur factorization of a real general matrix: A = Q*T*Q**T, as computed by DHSEQR.
The right eigenvector x and the left eigenvector y of T corresponding to an eigenvalue w are defined by:
T*x = w*x, (y**H)*T = w*(y**H)
where y**H denotes the conjugate transpose of y.
The eigenvalues are not input to this routine, but are read directly from the diagonal blocks of T.
This routine returns the matrices X and/or Y of right and left eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an input matrix. If Q is the orthogonal factor that reduces a matrix A to Schur form T, then Q*X and Q*Y are the matrices of right and left eigenvectors of A.
π«Ά Parameters π«Ά
SIDEβSIDE is CHARACTER*1= 'R': compute right eigenvectors only;= 'L': compute left eigenvectors only;= 'B': compute both right and left eigenvectors.
HOWMNYβHOWMNY is CHARACTER*1= 'A': compute all right and/or left eigenvectors;= 'B': compute all right and/or left eigenvectors, backtransformed by the matrices inVRand/orVL;= 'S': compute selected right and/or left eigenvectors, as indicated by the logical arraySELECT.
SELECTβSELECT is LOGICAL array, dimension (N)- If
HOWMNY = 'S',SELECTspecifies the eigenvectors to be computed. - If
w(j)is a real eigenvalue, the corresponding real eigenvector is computed ifSELECT(j)is.TRUE.. - If
w(j)andw(j+1)are the real and imaginary parts of a complex eigenvalue, the corresponding complex eigenvector is computed if eitherSELECT(j)orSELECT(j+1)is.TRUE., and on exitSELECT(j)is set to.TRUE.andSELECT(j+1)is set to.FALSE.. - Not referenced if
HOWMNY = 'A'or'B'.
- If
NβN is INTEGER; the order of the matrixT.N >= 0.TβT is DOUBLE PRECISION array, dimension (LDT,N); the upper quasi-triangular matrixTin Schur canonical form.LDTβLDT is INTEGER; the leading dimension of the arrayT.LDT >= max(1,N).VLβVL is DOUBLE PRECISION array, dimension (LDVL,MM)- On entry, if
SIDE = 'L'or'B'andHOWMNY = 'B',VLmust contain anN-by-NmatrixQ(usually the orthogonal matrixQof Schur vectors returned byDHSEQR). - On exit, if
SIDE = 'L'or'B',VLcontains:- if
HOWMNY = 'A', the matrixYof left eigenvectors ofT; - if
HOWMNY = 'B', the matrixQ*Y; - if
HOWMNY = 'S', the left eigenvectors ofTspecified bySELECT, stored consecutively in the columns ofVL, in the same order as their eigenvalues.
- if
- A complex eigenvector corresponding to a complex eigenvalue is stored in two consecutive columns, the first holding the real part, and the second the imaginary part.
- Not referenced if
SIDE = 'R'.
- On entry, if
LDVLβLDVL is INTEGER; the leading dimension of the arrayVL.LDVL >= 1, and ifSIDE = 'L'or'B',LDVL >= N.VRβVR is DOUBLE PRECISION array, dimension (LDVR,MM)- On entry, if
SIDE = 'R'or'B'andHOWMNY = 'B',VRmust contain anN-by-NmatrixQ(usually the orthogonal matrixQof Schur vectors returned byDHSEQR). - On exit, if
SIDE = 'R'or'B',VRcontains:- if
HOWMNY = 'A', the matrixXof right eigenvectors ofT; - if
HOWMNY = 'B', the matrixQ*X; - if
HOWMNY = 'S', the right eigenvectors ofTspecified bySELECT, stored consecutively in the columns ofVR, in the same order as their eigenvalues.
- if
- A complex eigenvector corresponding to a complex eigenvalue is stored in two consecutive columns, the first holding the real part and the second the imaginary part.
- Not referenced if
SIDE = 'L'.
- On entry, if
LDVRβLDVR is INTEGER; the leading dimension of the arrayVR.LDVR >= 1, and ifSIDE = 'R'or'B',LDVR >= N.MMβMM is INTEGER; the number of columns in the arraysVLand/orVR.MM >= M.MβM is INTEGER; the number of columns in the arraysVLand/orVRactually used to store the eigenvectors. IfHOWMNY = 'A'or'B',Mis set toN. Each selected real eigenvector occupies one column and each selected complex eigenvector occupies two columns.WORKβWORK is DOUBLE PRECISION array, dimension (3*N).INFOβINFO is INTEGER= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π₯ Further Details π₯
The algorithm used in this program is basically backward (forward) substitution, with scaling to make the the code robust against possible overflow.
Each eigenvector is normalized so that the element of largest magnitude has magnitude 1; here the magnitude of a complex number (x,y) is taken to be |x| + |y|.
Definition at line 220 of file dtrevc.f.
π«Ά Author π«Ά
Generated automatically by Doxygen for LAPACK from the source code.
xoxo bestie, this page is living in LAPACK Version 3.12.0 and the source file is SRC/dtrevc.f(3) β slay and happy eigenvector-ing π
β¨
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms