SRC/ssysv_rook.f(3)
πΈ NAME πΈ
okay bestie, this is SRC/ssysv_rook.f(3) from the Library Functions Manual β manual name folded in right here near the top, slay π
. It's the page for SRC/ssysv_rook.f, the ssysv_rook subroutine that solves A * X = B for SY matrices. β¨
β¨ SYNOPSIS β¨
π«Ά Functions/Subroutines π«Ά
ssysv_rookβ full signature, no cap:
subroutine ssysv_rook (uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork,
info)
SSYSV_ROOK computes the solution to system of linear equations A * X = B for SY matrices. π¦
π§ Function/Subroutine Documentation π§
π subroutine ssysv_rook π
subroutine ssysv_rook (character uplo, integer n, integer nrhs, real,
dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, real,
dimension( ldb, * ) b, integer ldb, real, dimension( * ) work, integer
lwork, integer info)
SSYSV_ROOK computes the solution to system of linear equations A * X = B for SY matrices.
π Purpose π
okay so SSYSV_ROOK computes the solution to a real system of linear equations
A * X = B,
where A is an N-by-N symmetric matrix and X and B are N-by-NRHS matrices. π
The diagonal pivoting method is used to factor A as
A = U * D * U**T, if UPLO = 'U', or
A = L * D * L**T, if UPLO = 'L',
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. β¨
SSYTRF_ROOK is called to compute the factorization of a real symmetric matrix A using the bounded Bunch-Kaufman () diagonal pivoting method.
The factored form of A is then used to solve the system of equations A * X = B by calling SSYTRS_ROOK. π«Ά
π Parameters π
UPLOβUPLO is CHARACTER*1= 'U': Upper triangle of A is stored;= 'L': Lower triangle of A is stored.
NβN is INTEGER. The number of linear equations, i.e., the order of the matrixA.N >= 0.NRHSβNRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0.AβA is REAL array, dimension (LDA,N). On entry, the symmetric 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, if
INFO = 0, the block diagonal matrixDand the multipliers used to obtain the factorUorLfrom the factorizationA = U*D*U**TorA = L*D*L**Tas computed bySSYTRF_ROOK.
- On exit, if
LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,N).IPIVβIPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure ofD, as determined bySSYTRF_ROOK.- If
UPLO = 'U':- If
IPIV(k) > 0, then rows and columnskandIPIV(k)were interchanged andD(k,k)is a1-by-1diagonal block. - If
IPIV(k) < 0andIPIV(k-1) < 0, then rows and columnskand-IPIV(k)were interchanged and rows and columnsk-1and-IPIV(k-1)were interchanged,D(k-1:k,k-1:k)is a2-by-2diagonal block.
- If
- If
UPLO = 'L':- If
IPIV(k) > 0, then rows and columnskandIPIV(k)were interchanged andD(k,k)is a1-by-1diagonal block. - If
IPIV(k) < 0andIPIV(k+1) < 0, then rows and columnskand-IPIV(k)were interchanged and rows and columnsk+1and-IPIV(k+1)were interchanged,D(k:k+1,k:k+1)is a2-by-2diagonal block.
- If
- If
BβB is REAL array, dimension (LDB,NRHS). On entry, theN-by-NRHSright hand side matrixB. On exit, ifINFO = 0, theN-by-NRHSsolution matrixX.LDBβLDB is INTEGER. The leading dimension of the arrayB.LDB >= max(1,N).WORKβWORK is REAL array, dimension (MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβLWORK is INTEGER. The length ofWORK.LWORK >= 1, and for best performanceLWORK >= max(1,N*NB), whereNBis the optimal blocksize forSSYTRF_ROOK.TRS will be done with Level 2 BLAS- 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.
INFOβINFO is INTEGER= 0: successful exit< 0: ifINFO = -i, thei-th argument had an illegal value> 0: ifINFO = i,D(i,i)is exactly zero. The factorization has been completed, but the block diagonal matrixDis exactly singular, so the solution could not be computed.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
πΈ Contributors: πΈ
- April 2012, Igor Kozachenko, Computer Science Division, University of California, Berkeley
- September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester
π Definition at line π
Definition at line 202 of file ssysv_rook.f.
π«Ά Author π«Ά
Generated automatically by Doxygen for LAPACK from the source code.
okay that's the whole page, bestie β the footer signs off with LAPACK, Version 3.12.0, and SRC/ssysv_rook.f(3). πβ¨π
π¦ 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