ZGGESX(3)
β¨ ZGGESX(3) β¨
okay bestie gather round, this is the zggesx.f(3) page and it comes to you straight from the Library Functions Manual π
it's filed under /home/abui...RC/zggesx.f(3), and yes we're gonna get through all of it together, no cap π«Ά
π NAME π
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zggesx.f
that's it. that's the name. the whole entire path IS the name and honestly? iconic of it π
π¦ SYNOPSIS π¦
Functions/Subroutines
subroutine ZGGESX (jobvsl, jobvsr, sort, selctg, sense, n, a, lda, b,
ldb, sdim, alpha, beta, vsl, ldvsl, vsr, ldvsr, rconde, rcondv,
work, lwork, rwork, iwork, liwork, bwork, info)
ZGGESX computes the eigenvalues, the Schur form, and, optionally, the matrix of Schur vectors for GE matrices β main character energy fr fr π
π Function/Subroutine Documentation π
π subroutine ZGGESX π
subroutine ZGGESX (character jobvsl, character jobvsr, character sort,
external selctg, character sense, integer n, complex*16, dimension( lda,
* ) a, integer lda, complex*16, dimension( ldb, * ) b, integer ldb,
integer sdim, complex*16, dimension( * ) alpha, complex*16, dimension( *
) beta, complex*16, dimension( ldvsl, * ) vsl, integer ldvsl,
complex*16, dimension( ldvsr, * ) vsr, integer ldvsr, double precision,
dimension( 2 ) rconde, double precision, dimension( 2 ) rcondv,
complex*16, dimension( * ) work, integer lwork, double precision,
dimension( * ) rwork, integer, dimension( * ) iwork, integer liwork,
logical, dimension( * ) bwork, integer info)
ZGGESX computes the eigenvalues, the Schur form, and, optionally, the matrix of Schur vectors for GE matrices πΈ (yes it says it twice, it's just that confident β¨)
π Purpose π
ZGGESX computes, for a pair of N-by-N complex nonsymmetric matrices (A,B), the generalized eigenvalues, the complex Schur form (S,T), and, optionally, the left and/or right matrices of Schur vectors (VSL and VSR). this gives the generalized Schur factorization:
(A,B) = ( (VSL) S (VSR)**H, (VSL) T (VSR)**H )
where (VSR)**H is the conjugate-transpose of VSR. that's the conjugate-transpose bestie, we do not forget the H π
Optionally, it also orders the eigenvalues so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper triangular matrix S and the upper triangular matrix T; computes a reciprocal condition number for the average of the selected eigenvalues (RCONDE); and computes a reciprocal condition number for the right and left deflating subspaces corresponding to the selected eigenvalues (RCONDV). the leading columns of VSL and VSR then form an orthonormal basis for the corresponding left and right eigenspaces (deflating subspaces) β¨ like that's actually so much and it does it all without complaining π«Ά
A generalized eigenvalue for a pair of matrices (A,B) is a scalar w or a ratio alpha/beta = w, such that A - w*B is singular. it is usually represented as the pair (alpha,beta), since there is a reasonable interpretation for beta=0 or for both of them being zero π okay so that's the whole vibe of a generalized eigenvalue, got it.
A pair of matrices (S,T) is in generalized complex Schur form if T is upper triangular with non-negative diagonal and S is upper triangular. upper triangular, non-negative diagonal on T, no weirdness. periodt π
π₯ Parameters π₯
π« JOBVSL
JOBVSL is CHARACTER*1.
= 'N': nope, do not compute the left Schur vectors;= 'V': yep, compute the left Schur vectors.
π« JOBVSR
JOBVSR is CHARACTER*1.
= 'N': do not compute the right Schur vectors;= 'V': compute the right Schur vectors.
π« SORT
SORT is CHARACTER*1. it specifies whether or not to order the eigenvalues on the diagonal of the generalized Schur form.
= 'N': eigenvalues are not ordered;= 'S': eigenvalues are ordered (seeSELCTG).
π« SELCTG
SELCTG is a LOGICAL FUNCTION of two COMPLEX*16 arguments. SELCTG must be declared EXTERNAL in the calling subroutine β
- if
SORT = 'N',SELCTGis not referenced. - if
SORT = 'S',SELCTGis used to select eigenvalues to sort to the top left of the Schur form.
okay important bestie: a selected complex eigenvalue may no longer satisfySELCTG(ALPHA(j),BETA(j)) = .TRUE.after ordering, since ordering may change the value of complex eigenvalues (especially if the eigenvalue is ill-conditioned), in this caseINFOis set toN+3β seeINFObelow. so like, don't come for the routine when this happens, it warned you π
π« SENSE
SENSE is CHARACTER*1. it determines which reciprocal condition numbers are computed.
= 'N': none are computed;= 'E': computed for average of selected eigenvalues only;= 'V': computed for selected deflating subspaces only;= 'B': computed for both.
if SENSE = 'E', 'V', or 'B', SORT must equal 'S'. that's the rule, no wiggle room π
π« N
N is INTEGER. the order of the matrices A, B, VSL, and VSR. N >= 0.
π« A
A is COMPLEX*16 array, dimension (LDA, N).
- on entry, the first of the pair of matrices.
- on exit,
Ahas been overwritten by its generalized Schur formS.
π« LDA
LDA is INTEGER. the leading dimension of A. LDA >= max(1,N).
π« B
B is COMPLEX*16 array, dimension (LDB, N).
- on entry, the second of the pair of matrices.
- on exit,
Bhas been overwritten by its generalized Schur formT.
π« LDB
LDB is INTEGER. the leading dimension of B. LDB >= max(1,N).
π« SDIM
SDIM is INTEGER.
- if
SORT = 'N',SDIM = 0. - if
SORT = 'S',SDIM= number of eigenvalues (after sorting) for whichSELCTGis true.
π« ALPHA
ALPHA is COMPLEX*16 array, dimension (N).
π« BETA
BETA is COMPLEX*16 array, dimension (N).
on exit, ALPHA(j)/BETA(j), j=1,...,N, will be the generalized eigenvalues. ALPHA(j) and BETA(j),j=1,...,N are the diagonals of the complex Schur form (S,T). BETA(j) will be non-negative real π
note: the quotientsALPHA(j)/BETA(j)may easily over- or underflow, andBETA(j)may even be zero. thus, the user should avoid naively computing the ratioalpha/beta. however,ALPHAwill be always less than and usually comparable withnorm(A)in magnitude, andBETAalways less than and usually comparable withnorm(B). so like, do the math carefully, don't just divide and hope for the best π
π« VSL
VSL is COMPLEX*16 array, dimension (LDVSL,N).
if JOBVSL = 'V', VSL will contain the left Schur vectors. not referenced if JOBVSL = 'N'.
π« LDVSL
LDVSL is INTEGER. the leading dimension of the matrix VSL. LDVSL >= 1, and if JOBVSL = 'V', LDVSL >= N.
π« VSR
VSR is COMPLEX*16 array, dimension (LDVSR,N).
if JOBVSR = 'V', VSR will contain the right Schur vectors. not referenced if JOBVSR = 'N'.
π« LDVSR
LDVSR is INTEGER. the leading dimension of the matrix VSR. LDVSR >= 1, and if JOBVSR = 'V', LDVSR >= N.
π« RCONDE
RCONDE is DOUBLE PRECISION array, dimension ( 2 ).
if SENSE = 'E' or 'B', RCONDE(1) and RCONDE(2) contain the reciprocal condition numbers for the average of the selected eigenvalues. not referenced if SENSE = 'N' or 'V'.
π« RCONDV
RCONDV is DOUBLE PRECISION array, dimension ( 2 ).
if SENSE = 'V' or 'B', RCONDV(1) and RCONDV(2) contain the reciprocal condition number for the selected deflating subspaces. not referenced if SENSE = 'N' or 'E'.
π« WORK
WORK is COMPLEX*16 array, dimension (MAX(1,LWORK)).
on exit, if INFO = 0, WORK(1) returns the optimal LWORK.
π« LWORK
LWORK is INTEGER. the dimension of the array WORK.
- if
N = 0,LWORK >= 1, else ifSENSE = 'E','V', or'B',LWORK >= MAX(1,2*N,2*SDIM*(N-SDIM)), elseLWORK >= MAX(1,2*N). - note that
2*SDIM*(N-SDIM) <= N*N/2. - note also that an error is only returned if
LWORK < MAX(1,2*N), but ifSENSE = 'E'or'V'or'B'this may not be large enough.
if LWORK = -1, then a workspace query is assumed; the routine only calculates the bound on the optimal size of the WORK array and the minimum size of the IWORK array, returns these values as the first entries of the WORK and IWORK arrays, and no error message related to LWORK or LIWORK is issued by XERBLA β yes it's a whole little vibe check for your workspace, love that for you.
π« RWORK
RWORK is DOUBLE PRECISION array, dimension ( 8*N ). real workspace. that's it, that's the whole description, it holds the reals π
π« IWORK
IWORK is INTEGER array, dimension (MAX(1,LIWORK)).
on exit, if INFO = 0, IWORK(1) returns the minimum LIWORK.
π« LIWORK
LIWORK is INTEGER. the dimension of the array IWORK.
- if
SENSE = 'N'orN = 0,LIWORK >= 1, otherwiseLIWORK >= N+2.
if LIWORK = -1, then a workspace query is assumed; the routine only calculates the bound on the optimal size of the WORK array and the minimum size of the IWORK array, returns these values as the first entries of the WORK and IWORK arrays, and no error message related to LWORK or LIWORK is issued by XERBLA π¦ same deal as LWORK, we're just asking politely instead of allocating.
π« BWORK
BWORK is LOGICAL array, dimension (N). not referenced if SORT = 'N'.
π³ INFO
INFO is INTEGER and okay so this one is a whole saga β hold on to your seat bestie, it's giving "to be continued" π the rest of this page is coming at you in part 2, don't go anywhere π«Ά
okay so finishing up INFO, bestie β and yes, INFO is an INTEGER π
= 0: successful exit β¨< 0: ifINFO = -i, thei-th argument had an illegal value π¨= 1,...,N: the QZ iteration failed π(A,B)are not in Schur form, butALPHA(j)andBETA(j)should be correct forj=INFO+1,...,N.> N: okay so this is the extra-spicy zone π=N+1: other than QZ iteration failed inZHGEQZ=N+2: after reordering, roundoff changed values of some complex eigenvalues so that leading eigenvalues in the Generalized Schur form no longer satisfySELCTG=.TRUE.π This could also be caused due to scaling.=N+3: reordering failed inZTGSEN. π«
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 326 of file zggesx.f.
Author β¨ (the Doxygen one)
Generated automatically by Doxygen for LAPACK from the source code.
π Thatβs a wrap, bestie! Footer check: LAPACK Version 3.12.0, source/version/date line energy, and the path is /home/abui...RC/zggesx.f(3) π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms