SRC/dsysv.f(3)
π SRC/dsysv.f β from the Library Functions Manual β¨
okay bestie, buckle up π this one is a whole LAPACK situation and it's actually kind of iconic.
πΈ NAME πΈ
SRC/dsysv.f β and yes that's the entire name section, she's mysterious like that π
β¨ SYNOPSIS β¨
π«Ά Functions/Subroutines
subroutine dsysv (uplo, n, nrhs, a, lda, ipiv, b, ldb, work, lwork, info)β DSYSV computes the solution to system of linear equationsA * X = Bfor SY matrices π
π Function/Subroutine Documentation π
π¦ subroutine dsysv (character uplo, integer n, integer nrhs, double precision, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, double precision, dimension( ldb, * ) b, integer ldb, double precision, dimension( * ) work, integer lwork, integer info)
DSYSV computes the solution to system of linear equations A * X = B for SY matrices π
π₯ Purpose:
!>
!> DSYSV 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. The factored form of A is then
!> used to solve the system of equations A * X = B.
!>
literally the whole plot: factor A with diagonal pivoting, then use that factored form to solve the system. main character energy fr fr β¨
π 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
!> matrix A. N >= 0.
!>
π NRHS
!> NRHS is INTEGER
!> The number of right hand sides, i.e., the number of columns
!> of the matrix B. NRHS >= 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 INFO = 0, the block diagonal matrix D and the
!> multipliers used to obtain the factor U or L from the
!> factorization A = U*D*U**T or A = L*D*L**T as computed by
!> DSYTRF.
!>
ngl, she comes in as your symmetric matrix and leaves as the D-plus-multipliers situation. glow-up π
π LDA
!> LDA is INTEGER
!> The leading dimension of the array A. LDA >= max(1,N).
!>
π IPIV
!> IPIV is INTEGER array, dimension (N)
!> Details of the interchanges and the block structure of D, as
!> determined by DSYTRF. If IPIV(k) > 0, then rows and columns
!> k and IPIV(k) were interchanged, and D(k,k) is a 1-by-1
!> diagonal block. If UPLO = 'U' and IPIV(k) = IPIV(k-1) < 0,
!> then rows and columns k-1 and -IPIV(k) were interchanged and
!> D(k-1:k,k-1:k) is a 2-by-2 diagonal block. If UPLO = 'L' and
!> IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and
!> -IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2-by-2
!> diagonal block.
!>
this is the receipts of every swap that went down, courtesy of DSYTRF π₯
π B
!> B is DOUBLE PRECISION array, dimension (LDB,NRHS)
!> On entry, the N-by-NRHS right hand side matrix B.
!> On exit, if INFO = 0, the N-by-NRHS solution matrix X.
!>
she walks in as B and struts out as X. periodt. π
π LDB
!> LDB is INTEGER
!> The leading dimension of the array B. LDB >= max(1,N).
!>
π WORK
!> WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK))
!> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
!>
π LWORK
!> LWORK is INTEGER
!> The length of WORK. LWORK >= 1, and for best performance
!> LWORK >= max(1,N*NB), where NB is the optimal blocksize for
!> DSYTRF.
!> for LWORK < N, TRS will be done with Level BLAS 2
!> for LWORK >= N, TRS will be done with Level BLAS 3
!>
!> 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 by XERBLA.
!>
bestie listen π βLWORK = -1is the workspace-query era. she does NOT solve anything, she just sizes up theWORKarray, drops that value inWORK(1), andXERBLAstays completely silent about it. no error, no drama π«Ά
π INFO
!> INFO is INTEGER
!> = 0: successful exit
!> < 0: if INFO = -i, the i-th argument had an illegal value
!> > 0: if INFO = i, D(i,i) is exactly zero. The factorization
!> has been completed, but the block diagonal matrix D is
!> exactly singular, so the solution could not be computed.
!>
πINFO > 0is the bad-ending timeline:D(i,i)is exactly zero, the factorization finished butDis exactly singular, so no solution could be computed. not slay, but at least you know.
π§ Author π§
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 169 of file dsysv.f. π
β Author β
Generated automatically by Doxygen for LAPACK from the source code. (yes, the robot wrote this one, she just formatted it π)
LAPACK Β· Version 3.12.0 Β· SRC/dsysv.f(3)
that's the whole page bestie, go solve your symmetric systems, ily, bye πβ¨π¦πΈπ
π¦ 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