hetrd_2stage(3)
π¦ hetrd_2stage(3) π¦
okay bestie, so this is hetrd_2stage from the Library Functions Manual, and it's literally the glow-up page for the {he,sy}trd_2stage crew: reduction to tridiagonal, 2-stage. it's a long one so we're doing it in parts β buckle up π
β¨ NAME β¨
hetrd_2stage β {he,sy}trd_2stage: reduction to tridiagonal, 2-stage
πΈ SYNOPSIS πΈ
π Functions π
subroutine chetrd_2stage (vect, uplo, n, a, lda, d, e, tau, hous2,
lhous2, work, lwork, info)
CHETRD_2STAGE
subroutine dsytrd_2stage (vect, uplo, n, a, lda, d, e, tau, hous2,
lhous2, work, lwork, info)
DSYTRD_2STAGE
subroutine ssytrd_2stage (vect, uplo, n, a, lda, d, e, tau, hous2,
lhous2, work, lwork, info)
SSYTRD_2STAGE
subroutine zhetrd_2stage (vect, uplo, n, a, lda, d, e, tau, hous2,
lhous2, work, lwork, info)
ZHETRD_2STAGE
four icons, one vibe check π«Ά
π Detailed Description π
like, that's the whole overview β every deets lives down in the Function Documentation. keep scrolling, we got you.
π Function Documentation π
π subroutine chetrd_2stage π
subroutine chetrd_2stage (character vect, character uplo, integer n,
complex, dimension( lda, * ) a, integer lda, real, dimension( * ) d,
real, dimension( * ) e, complex, dimension( * ) tau, complex, dimension(
* ) hous2, integer lhous2, complex, dimension( * ) work, integer lwork,
integer info)
CHETRD_2STAGE β main character energy, no cap π
π§ Purpose:
!>
!> CHETRD_2STAGE reduces a complex Hermitian matrix A to real symmetric
!> tridiagonal form T by a unitary similarity transformation:
!> Q1**H Q2**H* A * Q2 * Q1 = T.
!>
so it takes your complex Hermitian A and turns it into a real symmetric tridiagonal T β iconic behavior, honestly. the transformation is a unitary similarity one, and the whole thing goes Q1**H Q2**H* A * Q2 * Q1 = T π
π Parameters
VECTβVECT is CHARACTER*1= 'N':No need for the Housholder representation,in particular for the second stage (Band totridiagonal) and thus LHOUS2 is of size max(1, 4*N);= 'V':the Householder representation is needed toeither generate Q1 Q2 or to apply Q1 Q2,then LHOUS2 is to be queried and computed.(NOT AVAILABLE IN THIS RELEASE).
ok so the 'V' option? it's literally not available in this release, bestie. don't come for me, I'm just the messenger π
UPLOβUPLO is CHARACTER*1= 'U':Upper triangle of A is stored;= 'L':Lower triangle of A is stored.
NβN is INTEGERβThe order of the matrix A. N >= 0.β¨AβA is COMPLEX array, dimension (LDA,N)On entry, the Hermitian matrix A. If UPLO = 'U', the leadingN-by-N upper triangular part of A contains the uppertriangular part of the matrix A, and the strictly lowertriangular part of A is not referenced. If UPLO = 'L', theleading N-by-N lower triangular part of A contains the lowertriangular part of the matrix A, and the strictly uppertriangular part of A is not referenced.On exit, if UPLO = 'U', the band superdiagonalof A are overwritten by the corresponding elements of theinternal band-diagonal matrix AB, and the elements abovethe KD superdiagonal, with the array TAU, represent the unitarymatrix Q1 as a product of elementary reflectors; if UPLO= 'L', the diagonal and band subdiagonal of A are over-written by the corresponding elements of the internal band-diagonalmatrix AB, and the elements below the KD subdiagonal, withthe array TAU, represent the unitary matrix Q1 as a productof elementary reflectors. See Further Details.
heads up: on exit yourAgets rewritten, like fully repurposed.ABandTAUandQ1all move in. so don't act surprised when your original matrix is gone πSee Further Details.
LDAβLDA is INTEGERβThe leading dimension of the array A. LDA >= max(1,N).DβD is REAL array, dimension (N)βThe diagonal elements of the tridiagonal matrix T.the main diagonal bestie, the moment β¨EβE is REAL array, dimension (N-1)βThe off-diagonal elements of the tridiagonal matrix T.yes it'sN-1, that's not a typo, that's just how off-diagonals roll π¦TAUβTAU is COMPLEX array, dimension (N-KD)βThe scalar factors of the elementary reflectors ofthe first stage (see Further Details).β note theN-KDsize, periodt.HOUS2βHOUS2 is COMPLEX array, dimension (MAX(1,LHOUS2))βStores the Householder representation of the stage2band to tridiagonal.stage 2's whole personality lives in here πLHOUS2βLHOUS2 is INTEGERβThe dimension of the array HOUS2.LHOUS2 >= 1.If LWORK = -1, or LHOUS2=-1,then a query is assumed; the routineonly calculates the optimal size of the HOUS2 array, returnsthis value as the first entry of the HOUS2 array, and no errormessage related to LHOUS2 is issued by XERBLA.If VECT='N', LHOUS2 = max(1, 4*n);if VECT='V', option not yet available.
WORKβWORK is COMPLEX array, dimension (MAX(1,LWORK))βOn exit, if INFO = 0, WORK(1) returns the optimal LWORK.so peepWORK(1)on the way out, it's telling you the tea πLWORKβLWORK is INTEGERβThe dimension of the array WORK.If N = 0, LWORK >= 1, else LWORK = MAX(1, dimension).If LWORK = -1, or LHOUS2 = -1,then a workspace query is assumed; the routineonly calculates the optimal size of the WORK array, returnsthis value as the first entry of the WORK array, and no errormessage related to LWORK is issued by XERBLA.LWORK = MAX(1, dimension) where
dimension = max(stage1,stage2) + (KD+1)*N
= N*KD + N*max(KD+1,FACTOPTNB)
+ max(2*KD*KD, KD*NTHREADS)
+ (KD+1)*N
where KD is the blocking size of the reduction,FACTOPTNB is the blocking used by the QR or LQalgorithm, usually FACTOPTNB=128 is a good choiceNTHREADS is the number of threads used whenopenMP compilation is enabled, otherwise =1.
ok that formula is giving very much "trust me bestie" but it's all there fr βKD,FACTOPTNB,NTHREADS, the whole squad π
INFOβINFO is INTEGER= 0:successful exitπ< 0:if INFO = -i, the i-th argument had an illegal value
so ifINFOcomes back negative, the i-th argument was messy and got called out.i-th argument, not vibe, keep up π
πΈ 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 at line 227 of file chetrd_2stage.f. π
π subroutine dsytrd_2stage π
subroutine dsytrd_2stage (character vect, character uplo, integer n, double
precision, dimension( lda, * ) a, integer lda, double precision,
dimension( * ) d, double precision, dimension( * ) e, double precision,
dimension( * ) tau, double precision, dimension( * ) hous2, integer
lhous2, double precision, dimension( * ) work, integer lwork, integer
info)
DSYTRD_2STAGE β the double precision sibling, equally iconic π₯
π§ Purpose:
!>
!> DSYTRD_2STAGE reduces a real symmetric matrix A to real symmetric
!> tridiagonal form T by a orthogonal similarity transformation:
!> Q1**T Q2**T* A * Q2 * Q1 = T.
!>
real symmetric A in, real symmetric tridiagonal T out, orthogonal similarity all the way: Q1**T Q2**T* A * Q2 * Q1 = T π«
π Parameters
VECTβVECT is CHARACTER*1= 'N':No need for the Housholder representation,in particular for the second stage (Band totridiagonal) and thus LHOUS2 is of size max(1, 4*N);= 'V':the Householder representation is needed toeither generate Q1 Q2 or to apply Q1 Q2,then LHOUS2 is to be queried and computed.(NOT AVAILABLE IN THIS RELEASE).
again β'V'is(NOT AVAILABLE IN THIS RELEASE).don't say I didn't warn you π
UPLOβUPLO is CHARACTER*1= 'U':Upper triangle of A is stored;= 'L':Lower triangle of A is stored.
NβN is INTEGERβThe order of the matrix A. N >= 0.AβA is DOUBLE PRECISION array, dimension (LDA,N)On entry, the symmetric matrix A. If UPLO = 'U', the leadingN-by-N upper triangular part of A contains the uppertriangular part of the matrix A, and the strictly lowertriangular part of A is not referenced. If UPLO = 'L', theleading N-by-N lower triangular part of A contains the lowertriangular part of the matrix A, and the strictly uppertriangular part of A is not referenced.On exit, if UPLO = 'U', the band superdiagonalof A are overwritten by the corresponding elements of theinternal band-diagonal matrix AB, and the elements abovethe KD superdiagonal, with the array TAU, represent the orthogonalmatrix Q1 as a product of elementary reflectors; if UPLO= 'L', the diagonal and band subdiagonal of A are over-written by the corresponding elements of the internal band-diagonalmatrix AB, and the elements below the KD subdiagonal, withthe array TAU, represent the orthogonal matrix Q1 as a productof elementary reflectors. See Further Details.
same deal as before: on exit,Ais not yourAanymore.ABandTAUandQ1took over.See Further Details.π«Ά
LDAβLDA is INTEGERβThe leading dimension of the array A. LDA >= max(1,N).Dβ (the next part picks up right here β¨)Dβ DOUBLE PRECISION array, dimension(N). The diagonal elements of the tridiagonal matrix T. That's the main-character diagonal right there. β¨Eβ DOUBLE PRECISION array, dimension(N-1). The off-diagonal elements of the tridiagonal matrix T. The sidekicks, the bits just off the main axis, we love them. π«TAUβ DOUBLE PRECISION array, dimension(N-KD). The scalar factors of the elementary reflectors of the first stage β peep the Further Details for the full lore. πHOUS2β DOUBLE PRECISION array, dimension(MAX(1,LHOUS2)). Stores the Householder representation of the stage2 band-to-tridiagonal. It's the storage closet for Q2's reflectors, basically. π§LHOUS2β INTEGER. The dimension of the arrayHOUS2.LHOUS2 >= 1. Ngl, careful with this one:
If LWORK = -1, or LHOUS2 = -1, then a query is assumed β the routine only calculates the optimal size of the HOUS2 array, returns this value as the first entry of the HOUS2 array, and no error message related to LHOUS2 is issued by XERBLA. So like, it won't yell at you, but that's because you asked for a query, not because you're safe. π
If VECT='N', LHOUS2 = max(1, 4*n); if VECT='V', option not yet available. π
WORKβ DOUBLE PRECISION array, dimension(MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK. Free intel. π«ΆLWORKβ INTEGER. The dimension of the arrayWORK. IfN = 0,LWORK >= 1, elseLWORK = MAX(1, dimension).
If LWORK = -1, or LHOUS2 = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA. Same deal as above β query mode, no scolding. π¦
LWORK = MAX(1, dimension) where
dimension = max(stage1,stage2) + (KD+1)*N
= N*KD + N*max(KD+1,FACTOPTNB)
+ max(2*KD*KD, KD*NTHREADS)
+ (KD+1)*N
where KD is the blocking size of the reduction, FACTOPTNB is the blocking used by the QR or LQ algorithm β usually FACTOPTNB=128 is a good choice β and NTHREADS is the number of threads used when openMP compilation is enabled, otherwise =1. So yes, the formula is giving final boss of buffer sizing energy, but every term is right there. π₯
INFOβ INTEGER.= 0: successful exit. Slay. π< 0: ifINFO = -i, the i-th argument had an illegal value. Not slay. π
π Author (yes, all of them, they all showed up)
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Further Details
Implemented by Azzam Haidar. Legend behavior, honestly.
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 at line 227 of file dsytrd_2stage.f.
πΈ subroutine ssytrd_2stage πΈ
subroutine ssytrd_2stage (character vect, character uplo, integer n, real,
dimension( lda, * ) a, integer lda, real, dimension( * ) d, real,
dimension( * ) e, real, dimension( * ) tau, real, dimension( * ) hous2,
integer lhous2, real, dimension( * ) work, integer lwork, integer info)
SSYTRD_2STAGE β ok bestie, this is the same routine but in single precision REAL instead of DOUBLE PRECISION. Everything you just read? Same soul, different word size. π
β¨ Purpose β¨
SSYTRD_2STAGE reduces a real symmetric matrix A to real symmetric tridiagonal form T by a orthogonal similarity transformation:
Q1**T Q2**T* A * Q2 * Q1 = T.
Two stages, two Q's, one very iconic tridiagonal T at the end. π¦
π Parameters π
VECTβ CHARACTER*1.= 'N': No need for the Housholder representation, in particular for the second stage (Band to tridiagonal) and thusLHOUS2is of sizemax(1, 4*N). Keep it light, keep it simple. β= 'V': the Householder representation is needed to either generateQ1 Q2or to applyQ1 Q2, thenLHOUS2is to be queried and computed. (NOT AVAILABLE IN THIS RELEASE). Yeah. Not yet. Don't come for it. π
UPLOβ CHARACTER*1.= 'U': Upper triangle of A is stored. β¬οΈ= 'L': Lower triangle of A is stored. β¬οΈ
Nβ INTEGER. The order of the matrix A.N >= 0. Zero is valid, zero is fine, zero is a whole mood. πAβ REAL array, dimension(LDA,N).
On entry, the symmetric matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading N-by-N lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. So like, only one half is canon, the other half is ignored. π
On exit, if UPLO = 'U', the band superdiagonal of A are overwritten by the corresponding elements of the internal band-diagonal matrix AB, and the elements above the KD superdiagonal, with the array TAU, represent the orthogonal matrix Q1 as a product of elementary reflectors; if UPLO = 'L', the diagonal and band subdiagonal of A are overwritten by the corresponding elements of the internal band-diagonal matrix AB, and the elements below the KD subdiagonal, with the array TAU, represent the orthogonal matrix Q1 as a product of elementary reflectors. See Further Details.
Heads up: your input matrix does not survive this. It gets overwritten with AB bits and Q1's reflectors. That's the whole point, but don't say nobody warned you. π
LDAβ INTEGER. The leading dimension of the array A.LDA >= max(1,N). Non-negotiable. πDβ REAL array, dimension(N). The diagonal elements of the tridiagonal matrix T. πEβ REAL array, dimension(N-1). The off-diagonal elements of the tridiagonal matrix T. β¨TAUβ REAL array, dimension(N-KD). The scalar factors of the elementary reflectors of the first stage (see Further Details). πHOUS2β REAL array, dimension(MAX(1,LHOUS2)). Stores the Householder representation of the stage2 band to tridiagonal. π§LHOUS2β INTEGER. The dimension of the arrayHOUS2.LHOUS2 >= 1.
If LWORK = -1, or LHOUS2 = -1, then a query is assumed; the routine only calculates the optimal size of the HOUS2 array, returns this value as the first entry of the HOUS2 array, and no error message related to LHOUS2 is issued by XERBLA. Query mode = XERBLA stays quiet. Do not mistake that for approval. π«Ά
If VECT='N', LHOUS2 = max(1, 4*n); if VECT='V', option not yet available. π
WORKβ REAL array, dimension(LWORK). The scratch space. Give it what it asks for. πLWORKβ INTEGER. The dimension of the arrayWORK. IfN = 0,LWORK >= 1, elseLWORK = MAX(1, dimension).
If LWORK = -1, or LHOUS2 = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA. Same energy as before β ask, don't guess. π
LWORK = MAX(1, dimension) where
dimension = max(stage1,stage2) + (KD+1)*N
= N*KD + N*max(KD+1,FACTOPTNB)
+ max(2*KD*KD, KD*NTHREADS)
+ (KD+1)*N
where KD is the blocking size of the reduction, FACTOPTNB is the blocking used by the QR or LQ algorithm β usually FACTOPTNB=128 is a good choice β and NTHREADS is the number of threads used when openMP compilation is enabled, otherwise =1. Yes it's the same formula. Yes it still slaps. π₯
INFOβ INTEGER.= 0: successful exit. We love a clean exit. π< 0: ifINFO = -i, the i-th argument had an illegal value. Go count your arguments, bestie. π
π Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Further Details
(hang tight β this is where the page hands the mic to the next chunk, the whole scholarly bibliography flex continues over there π)
Implemented by Azzam Haidar β periodt. All the deets are available on the technical report, SC11, SC13 papers, and the receipts are literally right here:
- 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 at line 226 of file ssytrd_2stage.f.
Okay bestie, next up is the zhetrd_2stage subroutine β say hi to the icon π
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)
This one is called ZHETRD_2STAGE, and she is serving β¨
π Purpose π
ZHETRD_2STAGE reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation: Q1**H Q2**H* A * Q2 * Q1 = T.
π Parameters π
VECTβVECT is CHARACTER*1= 'N': No need for the Housholder 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).
UPLOβUPLO is CHARACTER*1= 'U': Upper triangle ofAis stored;= 'L': Lower triangle ofAis stored.
NβN is INTEGER. The order of the matrixA.N >= 0.AβA is COMPLEX*16 array, dimension (LDA,N). On entry, the Hermitian matrixA. 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, ifUPLO = '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.LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,N).DβD is DOUBLE PRECISION array, dimension (N). The diagonal elements of the tridiagonal matrixT.EβE is DOUBLE PRECISION array, dimension (N-1). The off-diagonal elements of the tridiagonal matrixT.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 arrayHOUS2.LHOUS2 >= 1.
If LWORK = -1, or LHOUS2 = -1, then a query is assumed; the routine only calculates the optimal size of the HOUS2 array, returns this value as the first entry of the HOUS2 array, and no error message related to LHOUS2 is issued by XERBLA. If VECT='N', LHOUS2 = max(1, 4*n); if VECT='V', option not yet available.
WORKβWORK is COMPLEX*16 array, dimension (MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβLWORK is INTEGER. The dimension of the arrayWORK. IfN = 0,LWORK >= 1, elseLWORK = MAX(1, dimension).
If LWORK = -1, or LHOUS2 = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA. LWORK = MAX(1, dimension) where
dimension = max(stage1,stage2) + (KD+1)*N
= N*KD + N*max(KD+1,FACTOPTNB)
+ max(2*KD*KD, KD*NTHREADS)
+ (KD+1)*N
where KD is the blocking size of the reduction, FACTOPTNB is the blocking used by the QR or LQ algorithm, usually FACTOPTNB=128 is a good choice, and NTHREADS is the number of threads used when openMP compilation is enabled, otherwise =1.
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 at line 227 of file zhetrd_2stage.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
Okay that's the whole page, bestie β this cutie is LAPACK Version 3.12.0 and the hetrd_2stage(3) tag is holding it down. No cap, periodt. π
β¨
π¦ 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