SRC/slaqr3.f(3)
okay bestie, you're looking at SRC/slaqr3.f(3) from the Library Functions Manual β it's the glow-up guide for slaqr3. No cap, this is the aggressive-early-deflation era. π
π NAME π
SRC/slaqr3.f
β¨ SYNOPSIS β¨
π¦ Functions/Subroutines π¦
subroutine slaqr3 (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)β SLAQR3 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 slaqr3 πΈ
subroutine slaqr3 (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)
SLAQR3 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 π₯
Aggressive early deflation: SLAQR3 accepts as input an upper Hessenberg matrixHand performs an orthogonal similarity transformation designed to detect and deflate fully converged eigenvalues from a trailing principal submatrix. On outputHhas been over-written by a new Hessenberg matrix that is a perturbation of an orthogonal similarity transformation ofH. It is to be hoped that the final version ofHhas many zero subdiagonal entries.
π Parameters π
WANTTβWANTTisLOGICAL. If.TRUE., then the Hessenberg matrixHis fully updated so that the quasi-triangular Schur factor may be computed (in cooperation with the calling subroutine). If.FALSE., then only enough ofHis updated to preserve the eigenvalues.WANTZβWANTZisLOGICAL. If.TRUE., then the orthogonal matrixZis updated so that the orthogonal Schur factor may be computed (in cooperation with the calling subroutine). If.FALSE., thenZis not referenced.NβNisINTEGER. The order of the matrixHand (ifWANTZis.TRUE.) the order of the orthogonal matrixZ.KTOPβKTOPisINTEGER. It is assumed that eitherKTOP = 1orH(KTOP,KTOP-1)=0.KBOTandKTOPtogether determine an isolated block along the diagonal of the Hessenberg matrix.KBOTβKBOTisINTEGER. It is assumed without a check that eitherKBOT = NorH(KBOT+1,KBOT)=0.KBOTandKTOPtogether determine an isolated block along the diagonal of the Hessenberg matrix.NWβNWisINTEGER. Deflation window size.1 <= NW <= (KBOT-KTOP+1).HβHisREALarray, dimension(LDH,N). On input the initialN-by-Nsection ofHstores the Hessenberg matrix undergoing aggressive early deflation. On outputHhas been transformed by an orthogonal similarity transformation, perturbed, and returned to Hessenberg form that (it is to be hoped) has some zero subdiagonal entries.LDHβLDHisINTEGER. Leading dimension ofHjust as declared in the calling subroutine.N <= LDH.ILOZβILOZisINTEGER.IHIZβIHIZisINTEGER. Specify the rows ofZto which transformations must be applied ifWANTZis.TRUE..1 <= ILOZ <= IHIZ <= N.ZβZisREALarray, dimension(LDZ,N). IfWANTZis.TRUE., then on output, the orthogonal similarity transformation mentioned above has been accumulated intoZ(ILOZ:IHIZ,ILOZ:IHIZ)from the right. IfWANTZis.FALSE., thenZis unreferenced.LDZβLDZisINTEGER. The leading dimension ofZjust as declared in the calling subroutine.1 <= LDZ.NSβNSisINTEGER. The number of unconverged (ie approximate) eigenvalues returned inSRandSIthat may be used as shifts by the calling subroutine.NDβNDisINTEGER. The number of converged eigenvalues uncovered by this subroutine.SRβSRisREALarray, dimension(KBOT).SIβSIisREALarray, dimension(KBOT). On output, the real and imaginary parts of approximate eigenvalues that may be used for shifts are stored inSR(KBOT-ND-NS+1)throughSR(KBOT-ND)andSI(KBOT-ND-NS+1)throughSI(KBOT), respectively. The real and imaginary parts of converged eigenvalues are stored inSR(KBOT-ND+1)throughSR(KBOT)andSI(KBOT-ND+1)throughSI(KBOT), respectively.VβVisREALarray, dimension(LDV,NW). AnNW-by-NWwork array.LDVβLDVisINTEGER. The leading dimension ofVjust as declared in the calling subroutine.NW <= LDV.NHβNHisINTEGER. The number of columns ofT.NH >= NW.TβTisREALarray, dimension(LDT,NW).LDTβLDTisINTEGER. The leading dimension ofTjust as declared in the calling subroutine.NW <= LDT.NVβNVisINTEGER. The number of rows of work arrayWVavailable for workspace.NV >= NW.WVβWVisREALarray, dimension(LDWV,NW).LDWVβLDWVisINTEGER. The leading dimension ofWjust as declared in the calling subroutine.NW <= LDV.WORKβWORKisREALarray, dimension(LWORK). On exit,WORK(1)is set to an estimate of the optimal value ofLWORKfor the given values ofN,NW,KTOPandKBOT.LWORKβLWORKisINTEGER. The dimension of the work arrayWORK.LWORK = 2*NWsuffices, but greater efficiency may result from larger values ofLWORK.- If
LWORK = -1, then a workspace query is assumed;SLAQR3only estimates the optimal workspace size for the given values ofN,NW,KTOPandKBOT. The estimate is returned inWORK(1). No error message related toLWORKis issued byXERBLA. NeitherHnorZare accessed.
- If
π«Ά 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 272 of file slaqr3.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
okay that's the whole page, bestie π
The footer says LAPACK Version 3.12.0 and the page is SRC/slaqr3.f(3) β slay, stay orthogonal, and don't forget the workspace query π«Άβ¨
π¦ 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