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 to tridiagonal) and thus LHOUS2 is of size max(1, 4*N);
    • = 'V': the Householder representation is needed to either 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 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.
    • 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 unitary matrix 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-diagonal matrix AB, and the elements below the KD subdiagonal, with the array TAU, represent the unitary matrix Q1 as a product of elementary reflectors. See Further Details.
heads up: on exit your A gets rewritten, like fully repurposed. AB and TAU and Q1 all 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's N-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 of the first stage (see Further Details). β€” note the N-KD size, periodt.
  • HOUS2 β€” HOUS2 is COMPLEX array, dimension (MAX(1,LHOUS2)) β€” Stores the Householder representation of the stage2 band 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 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 array, dimension (MAX(1,LWORK)) β€” On exit, if INFO = 0, WORK(1) returns the optimal LWORK. so peep WORK(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 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 NTHREADS is the number of threads used when openMP 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 if INFO comes 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 to tridiagonal) and thus LHOUS2 is of size max(1, 4*N);
    • = 'V': the Householder representation is needed to either 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 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.
    • 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 over- written 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.
same deal as before: on exit, A is not your A anymore. AB and TAU and Q1 took 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 array HOUS2. 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, if INFO = 0, WORK(1) returns the optimal LWORK. Free intel. 🫢
  • LWORK β€” 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 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: if INFO = -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 thus LHOUS2 is of size max(1, 4*N). Keep it light, keep it simple. ⭐
    • = 'V': the Householder representation is needed to either generate Q1 Q2 or to apply Q1 Q2, then LHOUS2 is 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 array HOUS2. 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 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 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: if INFO = -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 thus LHOUS2 is of size max(1, 4*N);
    • = 'V': the Householder representation is needed to either generate Q1 Q2 or to apply Q1 Q2, then LHOUS2 is to be queried and computed. (NOT AVAILABLE IN THIS RELEASE).
  • 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*16 array, dimension (LDA,N). On entry, the Hermitian 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. 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 unitary matrix 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-diagonal matrix AB, and the elements below the KD subdiagonal, with the array TAU, represent the unitary matrix Q1 as a product of elementary reflectors. See Further Details.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • D β€” D is DOUBLE PRECISION array, dimension (N). The diagonal elements of the tridiagonal matrix T.
  • E β€” E is DOUBLE PRECISION array, dimension (N-1). The off-diagonal elements of the tridiagonal matrix T.
  • 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, 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, if INFO = 0, WORK(1) returns the optimal LWORK.
  • 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 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: if INFO = -i, the i-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