SRC/dsytrd_sy2sb.f(3)
π SRC/dsytrd_sy2sb.f(3) π
okay so bestie, this is the Library Functions Manual page for SRC/dsytrd_sy2sb.f(3) β the source file is literally SRC/dsytrd_sy2sb.f, and we are about to make it make sense. no cap, every flag, formula, and citation is staying right here. π
πΈ NAME πΈ
SRC/dsytrd_sy2sb.f β the source file this whole glow-up manual page is named after.
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine dsytrd_sy2sb (uplo, n, kd, a, lda, ab, ldab, tau, work,
lwork, info)
DSYTRD_SY2SB
π Function/Subroutine Documentation π
π¦ subroutine dsytrd_sy2sb π¦
subroutine dsytrd_sy2sb (character uplo, integer n, integer kd, double
precision, dimension( lda, * ) a, integer lda, double precision,
dimension( ldab, * ) ab, integer ldab, double precision, dimension( * )
tau, double precision, dimension( * ) work, integer lwork, integer info)
π DSYTRD_SY2SB π
π― Purpose π―
DSYTRD_SY2SB reduces a real symmetric matrix A to real symmetric band-diagonal form AB by an orthogonal similarity transformation: Q**T * A * Q = AB. That's the whole main-character move, periodt. β¨
π Parameters π
UPLOβCHARACTER*1; it tells us which triangle of A is stored.UPLO = 'U': upper triangle of A is stored.UPLO = 'L': lower triangle of A is stored.
NβINTEGER; the order of the matrix A.N >= 0.KDβINTEGER; the number of superdiagonals of the reduced matrix ifUPLO = 'U', or the number of subdiagonals ifUPLO = 'L'.KD >= 0. The reduced matrix is stored in the arrayAB.AβDOUBLE PRECISIONarray, dimension(LDA,N).- On entry, the symmetric matrix A. If
UPLO = 'U', the leadingN-by-Nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. IfUPLO = 'L', the leadingN-by-Nlower 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 diagonal and first superdiagonal of A are overwritten by the corresponding elements of the tridiagonal matrix T, and the elements above the first superdiagonal, with the arrayTAU, represent the orthogonal matrix Q as a product of elementary reflectors; ifUPLO = 'L', the diagonal and first subdiagonal of A are overwritten by the corresponding elements of the tridiagonal matrix T, and the elements below the first subdiagonal, with the arrayTAU, represent the orthogonal matrix Q as a product of elementary reflectors. See Further Details. π«Ά
- On entry, the symmetric matrix A. If
LDAβINTEGER; the leading dimension of the array A.LDA >= max(1,N).ABβDOUBLE PRECISIONarray, dimension(LDAB,N).- On exit, the upper or lower triangle of the symmetric band matrix A, stored in the first
KD+1rows of the array. The j-th column of A is stored in the j-th column of the arrayABas follows: - if
UPLO = 'U',AB(kd+1+i-j,j) = A(i,j)formax(1,j-kd)<=i<=j; - if
UPLO = 'L',AB(1+i-j,j) = A(i,j)forj<=i<=min(n,j+kd).
- On exit, the upper or lower triangle of the symmetric band matrix A, stored in the first
LDABβINTEGER; the leading dimension of the arrayAB.LDAB >= KD+1.TAUβDOUBLE PRECISIONarray, dimension(N-KD); the scalar factors of the elementary reflectors (see Further Details).WORKβDOUBLE PRECISIONarray, dimension(MAX(1,LWORK)). On exit, ifINFO = 0, or ifLWORK = -1,WORK(1)returns the size ofLWORK.LWORKβINTEGER; the dimension of the arrayWORKwhich should be calculated by a workspace query.- If
N <= KD+1,LWORK >= 1, elseLWORK = MAX(1, LWORK_QUERY). - If
LWORK = -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_QUERY = N*KD + N*max(KD,FACTOPTNB) + 2*KD*KDwhereFACTOPTNBis the blocking used by the QR or LQ algorithm, usuallyFACTOPTNB=128is a good choice otherwise puttingLWORK=-1will provide the size ofWORK.
- If
INFOβINTEGER.= 0: successful exit.< 0: ifINFO = -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
If UPLO = 'U', the matrix Q is represented as a product of elementary reflectors:
Q = H(k)**T . . . H(2)**T H(1)**T, where k = n-kd.
Each H(i) has the form:
H(i) = I - tau * v * v**T
where tau is a real scalar, and v is a real vector with v(1:i+kd-1) = 0 and v(i+kd) = 1; conjg(v(i+kd+1:n)) is stored on exit in A(i,i+kd+1:n), and tau in TAU(i).
If UPLO = 'L', the matrix Q is represented as a product of elementary reflectors:
Q = H(1) H(2) . . . H(k), where k = n-kd.
Each H(i) has the form:
H(i) = I - tau * v * v**T
where tau is a real scalar, and v is a real vector with v(kd+1:i) = 0 and v(i+kd+1) = 1; v(i+kd+2:n) is stored on exit in A(i+kd+2:n,i), and tau in TAU(i).
The contents of A on exit are illustrated by the following examples with n = 5:
if UPLO = 'U': if UPLO = 'L':
( ab ab/v1 v1 v1 v1 ) ( ab )
( ab ab/v2 v2 v2 ) ( ab/v1 ab )
( ab ab/v3 v3 ) ( v1 ab/v2 ab )
( ab ab/v4 ) ( v1 v2 ab/v3 ab )
( ab ) ( v1 v2 v3 ab/v4 ab )
where d and e denote diagonal and off-diagonal elements of T, and vi denotes an element of the vector defining H(i).
Definition at line 243 of file dsytrd_sy2sb.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
mwah π β this footer is brought to you by LAPACK, Version 3.12.0, source file SRC/dsytrd_sy2sb.f(3). that's the vibe, bestie, and we are so done. π
β¨
π¦ 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