SSYTRF(3)
π NAME π
ok so bestie, this whole page is literally about one file, and its name is a whole entire path, no cap:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/ssytrf.f
that's it. that's the name. she's long, she's dramatic, she's giving "full government name" energy π
and yes, this is the ssytrf.f manpage from the LAPACK library, version 3.12.0 β we'll get to that at the end π
β¨ SYNOPSIS β¨
π¦ Functions/Subroutines π¦
subroutine SSYTRF (uplo, n, a, lda, ipiv, work, lwork, info)β SSYTRF β¨ (she's the moment, she's the icon, she's the whole reason we're here)
πΈ Function/Subroutine Documentation πΈ
ok so here's the actual, full, unredacted signature β read it slowly, it's a lot but we got this π«Ά
subroutine SSYTRF (character uplo, integer n, real, dimension( lda, * ) a,
integer lda, integer, dimension( * ) ipiv, real, dimension( * ) work,
integer lwork, integer info)
π SSYTRF π
π Purpose π
bestie. listen. SSYTRF computes the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method. the form of the factorization is:
A = U**T*D*U or A = L*D*L**T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. literally so iconic π
this is the blocked version of the algorithm, calling Level 3 BLAS. highkey the upgraded, faster, main-character version of the vibe π₯
π Parameters π
- UPLO β
UPLO is CHARACTER*1= 'U': the upper triangle of A is stored πΈ= 'L': the lower triangle of A is stored π¦
- N β
N is INTEGER- the order of the matrix A.
N >= 0. periodt.
- the order of the matrix A.
- A β
A is 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. IfUPLO = '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. (iykyk β only half the matrix matters, the other half is just vibes π) - On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L (see below for further details π).
- On entry, the symmetric matrix A. If
- LDA β
LDA is INTEGER- the leading dimension of the array A.
LDA >= max(1,N). no pressure, but also do not mess this one up π
- the leading dimension of the array A.
- IPIV β
IPIV is INTEGER array, dimension (N)- details of the interchanges and the block structure of D. so:
- If
IPIV(k) > 0, then rows and columns k andIPIV(k)were interchanged andD(k,k)is a 1-by-1 diagonal block. - If
UPLO = 'U'andIPIV(k) = IPIV(k-1) < 0, then rows and columnsk-1and-IPIV(k)were interchanged andD(k-1:k,k-1:k)is a 2-by-2 diagonal block. - If
UPLO = 'L'andIPIV(k) = IPIV(k+1) < 0, then rows and columnsk+1and-IPIV(k)were interchanged andD(k:k+1,k:k+1)is a 2-by-2 diagonal block.
- WORK β
WORK is REAL array, dimension (MAX(1,LWORK))- On exit, if
INFO = 0,WORK(1)returns the optimalLWORK. she's telling you what she wants, listen to her π
- On exit, if
- LWORK β
LWORK is INTEGER- the length of WORK.
LWORK >=1. For best performanceLWORK >= N*NB, where NB is the block size returned byILAENV. - If
LWORK = -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 byXERBLA. (a little peek behind the curtain, no commit required β¨)
- the length of WORK.
- INFO β
INFO is INTEGER= 0: successful exit π< 0: ifINFO = -i, the i-th argument had an illegal value π> 0: ifINFO = i,D(i,i)is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations. π¨ so like, she finished the job but the result is lowkey cursed β do NOT go solving systems with it or you'll get the math equivalent of a 404.
π§ Author π§
these absolute legends:
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
β Further Details β
ok this is the part where she gets into the lore. stay with me π«Ά
If UPLO = 'U', then A = U**T*D*U, where
U = P(n)*U(n)* ... *P(k)U(k)* ...,
i.e., U is a product of terms P(k)*U(k), where k decreases from n to 1 in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as defined by IPIV(k), and U(k) is a unit upper triangular matrix, such that if the diagonal block D(k) is of order s (s = 1 or 2), then
( I v 0 ) k-s
U(k) = ( 0 I 0 ) s
( 0 0 I ) n-k
k-s s n-k
If s = 1, D(k) overwrites A(k,k), and v overwrites A(1:k-1,k). If s = 2, the upper triangle of D(k) overwrites A(k-1,k-1), A(k-1,k), and A(k,k), and v overwrites A(1:k-2,k-1:k). π she reuses the memory, she's efficient, she's frugal, she's THAT girl.
If UPLO = 'L', then A = L*D*L**T, where
L = P(1)*L(1)* ... *P(k)*L(k)* ...,
i.e., L is a product of terms P(k)*L(k), where k increases from 1 to n in steps of 1 or 2, and D is a block diagonal matrix with 1-by-1 and 2-by-2 diagonal blocks D(k). P(k) is a permutation matrix as defined by IPIV(k), and L(k) is a unit lower triangular matrix, such that if the diagonal block D(k) is of order s (s = 1 or 2), then
( I 0 0 ) k-1
L(k) = ( 0 I 0 ) s
( 0 v I ) n-k-s+1
k-1 s n-k-s+1
If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). π same energy, opposite triangle, she contains multitudes.
π Definition at line 181 of file ssytrf.f. π
(yes, line 181, go look, she's right there π)
π Author π
Generated automatically by Doxygen for LAPACK from the source code. (not a human, not a vibe curator, just Doxygen doing her little thing π€β¨)
and that's the whole page bestie!! π this was LAPACK, Version 3.12.0, and the header up top pointed at that ssytrf.f path β so like, source + version + date all accounted for, we did it, we ate, no crumbs left ππ«Ά mwah π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms