SRC/ztrevc.f(3)
π SRC/ztrevc.f(3) β Library Functions Manual π
okay bestie, this is the page for SRC/ztrevc.f in the Library Functions Manual. it's the LAPACK routine ZTREVC, and yes, it's giving linear algebra main character energy π₯
π NAME π
SRC/ztrevc.f
πΈ SYNOPSIS πΈ
π¦ Functions/Subroutines π¦
subroutine ztrevc (side, howmny, select, n, t, ldt, vl, ldvl, vr, ldvr,
mm, m, work, rwork, info)
ZTREVC
β¨ Function/Subroutine Documentation β¨
subroutine ztrevc (character side, character howmny, logical, dimension( * )
select, integer n, complex*16, dimension( ldt, * ) t, integer ldt,
complex*16, dimension( ldvl, * ) vl, integer ldvl, complex*16,
dimension( ldvr, * ) vr, integer ldvr, integer mm, integer m,
complex*16, dimension( * ) work, double precision, dimension( * ) rwork,
integer info)
ZTREVC
π Purpose π
okay so ZTREVC computes some or all of the right and/or left eigenvectors of a complex upper triangular matrix T. Matrices of this type are produced by the Schur factorization of a complex general matrix: A = Q*T*Q**H, as computed by ZHSEQR.
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 the vector y. The eigenvalues are not input to this routine, but are read directly from the diagonal 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 unitary 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βSIDEisCHARACTER*1= 'R': compute right eigenvectors only;= 'L': compute left eigenvectors only;= 'B': compute both right and left eigenvectors.
HOWMNYβHOWMNYisCHARACTER*1= 'A': compute all right and/or left eigenvectors;= 'B': compute all right and/or left eigenvectors, backtransformed using the matrices supplied inVRand/orVL;= 'S': compute selected right and/or left eigenvectors, as indicated by the logical arraySELECT.
SELECTβSELECTisLOGICALarray, dimension(N). IfHOWMNY = 'S',SELECTspecifies the eigenvectors to be computed. The eigenvector corresponding to thej-th eigenvalue is computed ifSELECT(j) = .TRUE.. Not referenced ifHOWMNY = 'A'or'B'.NβNisINTEGER. The order of the matrixT.N >= 0.TβTisCOMPLEX*16array, dimension(LDT,N). The upper triangular matrixT.Tis modified, but restored on exit.LDTβLDTisINTEGER. The leading dimension of the arrayT.LDT >= max(1,N).VLβVLisCOMPLEX*16array, dimension(LDVL,MM). On entry, ifSIDE = 'L'or'B'andHOWMNY = 'B',VLmust contain anN-by-NmatrixQ(usually the unitary matrixQof Schur vectors returned byZHSEQR). On exit, ifSIDE = '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. Not referenced ifSIDE = 'R'.
- if
LDVLβLDVLisINTEGER. The leading dimension of the arrayVL.LDVL >= 1, and ifSIDE = 'L'or'B',LDVL >= N.VRβVRisCOMPLEX*16array, dimension(LDVR,MM). On entry, ifSIDE = 'R'or'B'andHOWMNY = 'B',VRmust contain anN-by-NmatrixQ(usually the unitary matrixQof Schur vectors returned byZHSEQR). On exit, ifSIDE = '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. Not referenced ifSIDE = 'L'.
- if
LDVRβLDVRisINTEGER. The leading dimension of the arrayVR.LDVR >= 1, and ifSIDE = 'R'or'B';LDVR >= N.MMβMMisINTEGER. The number of columns in the arraysVLand/orVR.MM >= M.MβMisINTEGER. The number of columns in the arraysVLand/orVRactually used to store the eigenvectors. IfHOWMNY = 'A'or'B',Mis set toN. Each selected eigenvector occupies one column.WORKβWORKisCOMPLEX*16array, dimension(2*N).RWORKβRWORKisDOUBLE PRECISIONarray, dimension(N).INFOβINFOisINTEGER= 0: successful exit< 0: ifINFO = -i, thei-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 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 π
Definition at line 216 of file ztrevc.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
That's the whole page, bestie π Footer vibes: LAPACK Β· Version 3.12.0 Β· SRC/ztrevc.f(3). There's no date on this footer, so I'm not inventing one β periodt π
β¨
π¦ 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