SRC/zhetrd_2stage.f(3)
π SRC/zhetrd_2stage.f β a whole entire LAPACK moment
okay bestie, so this is a page from the LAPACK library manual (the Library Functions Manual one, yes ma'am), and today's main character is a Fortran file called SRC/zhetrd_2stage.f. buckle up, because she does a LOT. π
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine zhetrd_2stage (vect, uplo, n, a, lda, d, e, tau, hous2, lhous2, work, lwork, info)β the icon herself,ZHETRD_2STAGE
π¦ Function/Subroutine Documentation π¦
subroutine zhetrd_2stage (character vect, character uplo, integer n, complex*16, dimension( lda, * ) a, integer lda, double precision, dimension( * ) d, double precision, dimension( * ) e, complex*16, dimension( * ) tau, complex*16, dimension( * ) hous2, integer lhous2, complex*16, dimension( * ) work, integer lwork, integer info)
ZHETRD_2STAGE
πΈ Purpose πΈ
ok so the whole vibe: ZHETRD_2STAGE reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation, and the transformation is literally:
Q1**H Q2**H* A * Q2 * Q1 = T.
no cap, that's the whole glow-up. π₯
π Parameters π
VECTβVECT is CHARACTER*1= 'N': no need for the Householder representation, in particular for the second stage (Band to tridiagonal), and thusLHOUS2is of sizemax(1, 4*N);= 'V': the Householder representation is needed to either generateQ1 Q2or to applyQ1 Q2, thenLHOUS2is to be queried and computed. (NOT AVAILABLE IN THIS RELEASE).
π«Ά yes bestie, the 'V' option is literally shouting "NOT AVAILABLE IN THIS RELEASE" β respect the all-caps, she means it.
UPLOβUPLO is CHARACTER*1= 'U': upper triangle ofAis stored;= 'L': lower triangle ofAis stored.
NβN is INTEGER- the order of the matrix
A.N >= 0.
- the order of the matrix
AβA is COMPLEX*16 array, dimension (LDA,N)- On entry, the Hermitian matrix
A. IfUPLO = 'U', the leadingN-by-Nupper triangular part ofAcontains the upper triangular part of the matrixA, and the strictly lower triangular part ofAis not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part ofAcontains the lower triangular part of the matrixA, and the strictly upper triangular part ofAis not referenced. - On exit, if
UPLO = 'U', the band superdiagonal ofAare overwritten by the corresponding elements of the internal band-diagonal matrixAB, and the elements above theKDsuperdiagonal, with the arrayTAU, represent the unitary matrixQ1as a product of elementary reflectors; ifUPLO = 'L', the diagonal and band subdiagonal ofAare over-written by the corresponding elements of the internal band-diagonal matrixAB, and the elements below theKDsubdiagonal, with the arrayTAU, represent the unitary matrixQ1as a product of elementary reflectors. See Further Details.
- On entry, the Hermitian matrix
π she gets completely rewritten on exit. the matrix you knew is gone, that's just how it is.
LDAβLDA is INTEGER- the leading dimension of the array
A.LDA >= max(1,N).
- the leading dimension of the array
DβD is DOUBLE PRECISION array, dimension (N)- the diagonal elements of the tridiagonal matrix
T. π
- the diagonal elements of the tridiagonal matrix
EβE is DOUBLE PRECISION array, dimension (N-1)- the off-diagonal elements of the tridiagonal matrix
T.
- the off-diagonal elements of the tridiagonal matrix
TAUβTAU is COMPLEX*16 array, dimension (N-KD)- the scalar factors of the elementary reflectors of the first stage (see Further Details).
HOUS2βHOUS2 is COMPLEX*16 array, dimension (MAX(1,LHOUS2))- stores the Householder representation of the stage2 band to tridiagonal. π
LHOUS2βLHOUS2 is INTEGER- the dimension of the array
HOUS2.LHOUS2 >= 1. - If
LWORK = -1, orLHOUS2 = -1, then a query is assumed; the routine only calculates the optimal size of theHOUS2array, returns this value as the first entry of theHOUS2array, and no error message related toLHOUS2is issued byXERBLA. - If
VECT='N',LHOUS2 = max(1, 4*n); ifVECT='V', option not yet available.
- the dimension of the array
WORKβWORK is COMPLEX*16 array, dimension (MAX(1,LWORK))- On exit, if
INFO = 0,WORK(1)returns the optimalLWORK. β¨
- On exit, if
LWORKβLWORK is INTEGER- the dimension of the array
WORK. IfN = 0,LWORK >= 1, elseLWORK = MAX(1, dimension). - If
LWORK = -1, orLHOUS2 = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA.LWORK = MAX(1, dimension)where
- the dimension of the array
dimension = max(stage1,stage2) + (KD+1)*N
= N*KD + N*max(KD+1,FACTOPTNB)
+ max(2*KD*KD, KD*NTHREADS)
+ (KD+1)*N
- where
KDis the blocking size of the reduction,FACTOPTNBis the blocking used by the QR or LQ algorithm, usuallyFACTOPTNB=128is a good choice,NTHREADSis the number of threads used when openMP compilation is enabled, otherwise=1.
π that formula is giving final boss energy but she's just telling you how much workspace to hand over. respect the math.
INFOβINFO is INTEGER= 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 π
- Implemented by Azzam Haidar.
- All details are available on technical report, SC11, SC13 papers.
- Azzam Haidar, Hatem Ltaief, and Jack Dongarra. Parallel reduction to condensed forms for symmetric eigenvalue problems using aggregated fine-grained and memory-aware kernels. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC '11), New York, NY, USA, Article 8 , 11 pages.
http://doi.acm.org/10.1145/2063384.2063394 - A. Haidar, J. Kurzak, P. Luszczek, 2013. An improved parallel singular value algorithm and its implementation for multicore hardware, In Proceedings of 2013 International Conference for High Performance Computing, Networking, Storage and Analysis (SC '13). Denver, Colorado, USA, 2013. Article 90, 12 pages.
http://doi.acm.org/10.1145/2503210.2503292 - A. Haidar, R. Solca, S. Tomov, T. Schulthess and J. Dongarra. A novel hybrid CPU-GPU generalized eigensolver for electronic structure calculations based on fine-grained memory aware tasks. International Journal of High Performance Computing Applications. Volume 28 Issue 2, Pages 196-209, May 2014.
http://hpc.sagepub.com/content/28/2/196
π Definition π
Definition at line 227 of file zhetrd_2stage.f.
π«Ά Author (the doxygen one) π«Ά
Generated automatically by Doxygen for LAPACK from the source code.
okay that's the whole page bestie!! π this absolute queen lives in LAPACK, Version 3.12.0, and she was documented on SRC/zhetrd_2stage.f(3) β go forth and reduce some Hermitian matrices, ily, 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