SRC/slaqr2.f(3)
π NAME π
SRC/slaqr2.f β the Library Functions Manual page for this Fortran source file, bestie. Thatβs the whole NAME section, no cap. π
π SYNOPSIS π
Functions/Subroutines
subroutine slaqr2 (wantt, wantz, n, ktop, kbot, nw, h, ldh, iloz, ihiz,
z, ldz, ns, nd, sr, si, v, ldv, nh, t, ldt, nv, wv, ldwv, work,
lwork)
SLAQR2 performs the orthogonal similarity transformation of a Hessenberg matrix to detect and deflate fully converged eigenvalues from a trailing principal submatrix (aggressive early deflation). π«
π¦ Function/Subroutine Documentation π¦
subroutine slaqr2 (logical wantt, logical wantz, integer n, integer ktop,
integer kbot, integer nw, real, dimension( ldh, * ) h, integer ldh,
integer iloz, integer ihiz, real, dimension( ldz, * ) z, integer ldz,
integer ns, integer nd, real, dimension( * ) sr, real, dimension( * )
si, real, dimension( ldv, * ) v, integer ldv, integer nh, real,
dimension( ldt, * ) t, integer ldt, integer nv, real, dimension( ldwv, *
) wv, integer ldwv, real, dimension( * ) work, integer lwork)
SLAQR2 performs the orthogonal similarity transformation of a Hessenberg matrix to detect and deflate fully converged eigenvalues from a trailing principal submatrix (aggressive early deflation). β¨
πΈ Purpose πΈ
Okay so SLAQR2 is identical to SLAQR3 except that it avoids recursion by calling SLAHQR instead of SLAQR4. Thatβs the tea. β
Aggressive early deflation, bestie: this subroutine accepts as input an upper Hessenberg matrix H and performs an orthogonal similarity transformation designed to detect and deflate fully converged eigenvalues from a trailing principal submatrix. On output H has been overwritten by a new Hessenberg matrix that is a perturbation of an orthogonal similarity transformation of H. It is to be hoped that the final version of H has many zero subdiagonal entries. Fingers crossed, etc. π«Ά
π Parameters π
WANTT
WANTT is LOGICAL β If .TRUE., then the Hessenberg matrix H is fully updated so that the quasi-triangular Schur factor may be computed (in cooperation with the calling subroutine). If .FALSE., then only enough of H is updated to preserve the eigenvalues.
WANTZ
WANTZ is LOGICAL β If .TRUE., then the orthogonal matrix Z is updated β the source says βso so thatβ, and honestly same β so that the orthogonal Schur factor may be computed (in cooperation with the calling subroutine). If .FALSE., then Z is not referenced.
N
N is INTEGER β The order of the matrix H and (if WANTZ is .TRUE.) the order of the orthogonal matrix Z.
KTOP
KTOP is INTEGER β It is assumed that either KTOP = 1 or H(KTOP,KTOP-1)=0. KBOT and KTOP together determine an isolated block along the diagonal of the Hessenberg matrix.
KBOT
KBOT is INTEGER β It is assumed without a check that either KBOT = N or H(KBOT+1,KBOT)=0. KBOT and KTOP together determine an isolated block along the diagonal of the Hessenberg matrix.
NW
NW is INTEGER β Deflation window size. 1 <= NW <= (KBOT-KTOP+1).
H
H is REAL array, dimension (LDH,N) β On input the initial N-by-N section of H stores the Hessenberg matrix undergoing aggressive early deflation. On output H has been transformed by an orthogonal similarity transformation, perturbed, and β direct quote from the source, grammar and all β βthe returned to Hessenberg formβ that (it is to be hoped) has some zero subdiagonal entries.
LDH
LDH is INTEGER β Leading dimension of H just as declared in the calling subroutine. N <= LDH.
ILOZ
ILOZ is INTEGER β Thatβs it, bestie. The source gives no extra description, just the type. π«‘
IHIZ
IHIZ is INTEGER β Specify the rows of Z to which transformations must be applied if WANTZ is .TRUE.. (yes, two dots in the original, iconic). 1 <= ILOZ <= IHIZ <= N.
Z
Z is REAL array, dimension (LDZ,N) β If WANTZ is .TRUE., then on output, the orthogonal similarity transformation mentioned above has been accumulated into Z(ILOZ:IHIZ,ILOZ:IHIZ) from the right. If WANTZ is .FALSE., then Z is unreferenced.
LDZ
LDZ is INTEGER β The leading dimension of Z just as declared in the calling subroutine. 1 <= LDZ.
NS
NS is INTEGER β The number of unconverged (ie approximate) eigenvalues returned in SR and SI that may be used as shifts by the calling subroutine.
ND
ND is INTEGER β The number of converged eigenvalues uncovered by this subroutine.
SR
SR is REAL array, dimension (KBOT) β Thatβs the whole description in the source; the output locations live under SI because the original puts them there.
SI
SI is REAL array, dimension (KBOT) β On output, the real and imaginary parts of approximate eigenvalues that may be used for shifts are stored in SR(KBOT-ND-NS+1) through SR(KBOT-ND) and SI(KBOT-ND-NS+1) through SI(KBOT-ND), respectively. The real and imaginary parts of converged eigenvalues are stored in SR(KBOT-ND+1) through SR(KBOT) and SI(KBOT-ND+1) through SI(KBOT), respectively.
V
V is REAL array, dimension (LDV,NW) β An NW-by-NW work array.
LDV
LDV is INTEGER β The leading dimension of V just as declared in the calling subroutine. NW <= LDV.
NH
NH is INTEGER β The number of columns of T. NH >= NW.
T
T is REAL array, dimension (LDT,NW) β Yep, thatβs the whole line. Work array energy, no extra lore.
LDT
LDT is INTEGER β The leading dimension of T just as declared in the calling subroutine. NW <= LDT.
NV
NV is INTEGER β The number of rows of work array WV available for workspace. NV >= NW.
WV
WV is REAL array, dimension (LDWV,NW) β Thatβs the line, bestie.
LDWV
LDWV is INTEGER β The leading dimension of W just as declared in the calling subroutine. NW <= LDV. (Yes, the original says LDV here, not LDWV; Iβm just reporting the page exactly. π)
WORK
WORK is REAL array, dimension (LWORK) β On exit, WORK(1) is set to an estimate of the optimal value of LWORK for the given values of N, NW, KTOP and KBOT.
LWORK
LWORK is INTEGER β The dimension of the work array WORK. LWORK = 2*NW suffices, but greater efficiency may result from larger values of LWORK.
If LWORK = -1, then a workspace query is assumed; SLAQR2 only estimates the optimal workspace size for the given values of N, NW, KTOP and KBOT. The estimate is returned in WORK(1). No error message related to LWORK is issued by XERBLA. Neither H nor Z are accessed. π¨
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Contributors: π
Karen Braman and Ralph Byers, Department of Mathematics, University of Kansas, USA
π Definition π
Definition at line 275 of file slaqr2.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
okay bestie, thatβs the page π cute sign-off time: the footer says LAPACK Version 3.12.0 and SRC/slaqr2.f(3). Thereβs no date printed on the page, so Iβm not inventing one β slay responsibly. πβ¨
π¦ 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