SRC/zlaqr5.f(3)
β¨ NAME β¨
SRC/zlaqr5.f β bestie, you're in the LAPACK Library Functions Manual and this is the page for zlaqr5, the subroutine with single small-bulge multi-shift QR sweep main character energy. π
π¦ SYNOPSIS π¦
Functions/Subroutines
subroutine zlaqr5 (wantt, wantz, kacc22, n, ktop, kbot, nshfts, s, h,
ldh, iloz, ihiz, z, ldz, v, ldv, u, ldu, nv, wv, ldwv, nh, wh, ldwh)
ZLAQR5 performs a single small-bulge multi-shift QR sweep. β¨
π Function/Subroutine Documentation π
subroutine zlaqr5 (logical wantt, logical wantz, integer kacc22, integer n,
integer ktop, integer kbot, integer nshfts, complex*16, dimension( * )
s, complex*16, dimension( ldh, * ) h, integer ldh, integer iloz, integer
ihiz, complex*16, dimension( ldz, * ) z, integer ldz, complex*16,
dimension( ldv, * ) v, integer ldv, complex*16, dimension( ldu, * ) u,
integer ldu, integer nv, complex*16, dimension( ldwv, * ) wv, integer
ldwv, integer nh, complex*16, dimension( ldwh, * ) wh, integer ldwh)
ZLAQR5 performs a single small-bulge multi-shift QR sweep. π«Ά
Purpose
ZLAQR5, called byZLAQR0, performs a single small-bulge multi-shift QR sweep. π¦
Parameters
WANTTβWANTTisLOGICAL.WANTT = .true.if the triangular Schur factor is being computed.WANTTis set to.false.otherwise.WANTZβWANTZisLOGICAL.WANTZ = .true.if the unitary Schur factor is being computed.WANTZis set to.false.otherwise.KACC22βKACC22isINTEGERwith value0,1, or2. Specifies the computation mode of far-from-diagonal orthogonal updates.= 0:ZLAQR5does not accumulate reflections and does not use matrix-matrix multiply to update far-from-diagonal matrix entries.= 1:ZLAQR5accumulates reflections and uses matrix-matrix multiply to update the far-from-diagonal matrix entries.= 2: Same asKACC22 = 1. This option used to enable exploiting the 2-by-2 structure during matrix multiplications, but this is no longer supported.
NβNisINTEGER.Nis the order of the Hessenberg matrixHupon which this subroutine operates.KTOPβKTOPisINTEGER.KBOTβKBOTisINTEGER. These are the first and last rows and columns of an isolated diagonal block upon which the QR sweep is to be applied. It is assumed without a check that eitherKTOP = 1orH(KTOP,KTOP-1) = 0and eitherKBOT = NorH(KBOT+1,KBOT) = 0.NSHFTSβNSHFTSisINTEGER.NSHFTSgives the number of simultaneous shifts.NSHFTSmust be positive and even.SβSisCOMPLEX*16array, dimension(NSHFTS).Scontains the shifts of origin that define the multi-shift QR sweep. On outputSmay be reordered.HβHisCOMPLEX*16array, dimension(LDH,N). On inputHcontains a Hessenberg matrix. On output a multi-shift QR sweep with shiftsSR(J)+i*SI(J)is applied to the isolated diagonal block in rows and columnsKTOPthroughKBOT.LDHβLDHisINTEGER.LDHis the leading dimension ofHjust as declared in the calling procedure.LDH >= MAX(1,N).ILOZβILOZisINTEGER.IHIZβIHIZisINTEGER. Specify the rows ofZto which transformations must be applied ifWANTZis.TRUE..1 <= ILOZ <= IHIZ <= N.ZβZisCOMPLEX*16array, dimension(LDZ,IHIZ). IfWANTZ = .TRUE., then the QR Sweep unitary similarity transformation is accumulated intoZ(ILOZ:IHIZ,ILOZ:IHIZ)from the right. IfWANTZ = .FALSE., thenZis unreferenced.LDZβLDZisINTEGER. The original saysLDAis the leading dimension ofZjust as declared in the calling procedure.LDZ >= N.VβVisCOMPLEX*16array, dimension(LDV,NSHFTS/2).LDVβLDVisINTEGER.LDVis the leading dimension ofVas declared in the calling procedure.LDV >= 3.UβUisCOMPLEX*16array, dimension(LDU,2*NSHFTS).LDUβLDUisINTEGER.LDUis the leading dimension ofUjust as declared in the in the calling subroutine.LDU >= 2*NSHFTS.NVβNVisINTEGER.NVis the number of rows inWVagailable for workspace.NV >= 1.WVβWVisCOMPLEX*16array, dimension(LDWV,2*NSHFTS).LDWVβLDWVisINTEGER.LDWVis the leading dimension ofWVas declared in the in the calling subroutine.LDWV >= NV.NHβNHisINTEGER.NHis the number of columns in arrayWHavailable for workspace.NH >= 1.WHβWHisCOMPLEX*16array, dimension(LDWH,NH).LDWHβLDWHisINTEGER. Leading dimension ofWHjust as declared in the calling procedure.LDWH >= 2*NSHFTS.
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
- Lars Karlsson, Daniel Kressner, and Bruno Lang
- Thijs Steel, Department of Computer science, KU Leuven, Belgium
π References: π
- K. Braman, R. Byers and R. Mathias, The Multi-Shift QR Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 Performance, SIAM Journal of Matrix Analysis, volume 23, pages 929--947, 2002.
- Lars Karlsson, Daniel Kressner, and Bruno Lang, Optimally packed chains of bulges in multishift QR algorithms. ACM Trans. Math. Softw. 40, 2, Article 12 (February 2014).
π Definition at line 254 of file zlaqr5.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
Okay bestie, footer time: this iconic little page is LAPACK Version 3.12.0, for SRC/zlaqr5.f(3). Slay, bye! πβ¨
π¦ 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