SRC/sptsvx.f(3)
Ok so this is SRC/sptsvx.f(3), and the manual it lives in is the Library Functions Manual. Yes bestie, we're doing Fortran linear algebra and we're gonna make it make sense. π
β¨
π NAME
SRC/sptsvx.f β that's the file, bestie. This page is about the sptsvx subroutine, and the manual name is Library Functions Manual (title: SRC/sptsvx.f(3)). π
β¨ SYNOPSIS
π§ Functions/Subroutines
subroutine sptsvx (fact, n, nrhs, d, e, df, ef, b, ldb, x, ldx, rcond,
ferr, berr, work, info)
SPTSVX computes the solution to system of linear equations A * X =
B for PT matrices
SPTSVX computes the solution to system of linear equations A * X = B for PT matrices. π«Ά
π«Ά Function/Subroutine Documentation
Here's the full signature, no details skipped, because we are not about that vague life:
subroutine sptsvx (character fact, integer n, integer nrhs, real, dimension(
* ) d, real, dimension( * ) e, real, dimension( * ) df, real, dimension(
* ) ef, real, dimension( ldb, * ) b, integer ldb, real, dimension( ldx,
* ) x, integer ldx, real rcond, real, dimension( * ) ferr, real,
dimension( * ) berr, real, dimension( * ) work, integer info)
SPTSVX computes the solution to system of linear equations A * X = B
for PT matrices
πΈ Purpose
SPTSVX uses the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices. π
Error bounds on the solution and a condition estimate are also provided. No cap.
π¦ Description
The following steps are performed:
- If
FACT = 'N', the matrix A is factored asA = L*D*L**T, where L is a unit lower bidiagonal matrix and D is diagonal. The factorization can also be regarded as having the formA = U**T*D*U. β¨ - If the leading principal minor of order i is not positive, then the routine returns with
INFO = i. Otherwise, the factored form of A is used to estimate the condition number of the matrix A. If the reciprocal of the condition number is less than machine precision,INFO = N+1is returned as a warning, but the routine still goes on to solve for X and compute error bounds as described below. π«Ά - The system of equations is solved for X using the factored form of A. Slay.
- Iterative refinement is applied to improve the computed solution matrix and calculate error bounds and backward error estimates for it. Obsessed with the thoroughness.
π Parameters
FACTβFACT is CHARACTER*1. Specifies whether or not the factored form of A has been supplied on entry.= 'F': On entry,DFandEFcontain the factored form of A.D,E,DF, andEFwill not be modified.= 'N': The matrix A will be copied toDFandEFand factored. πNβN is INTEGER. 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 matrices B and X.NRHS >= 0.DβD is REAL array, dimension (N). The n diagonal elements of the tridiagonal matrix A. πΈEβE is REAL array, dimension (N-1). The (n-1) subdiagonal elements of the tridiagonal matrix A.DFβDF is REAL array, dimension (N). IfFACT = 'F', thenDFis an input argument and on entry contains the n diagonal elements of the diagonal matrix D from theL*D*L**Tfactorization of A. IfFACT = 'N', thenDFis an output argument and on exit contains the n diagonal elements of the diagonal matrix D from theL*D*L**Tfactorization of A.EFβEF is REAL array, dimension (N-1). IfFACT = 'F', thenEFis an input argument and on entry contains the (n-1) subdiagonal elements of the unit bidiagonal factor L from theL*D*L**Tfactorization of A. IfFACT = 'N', thenEFis an output argument and on exit contains the (n-1) subdiagonal elements of the unit bidiagonal factor L from theL*D*L**Tfactorization of A. π¦BβB is REAL array, dimension (LDB,NRHS). The N-by-NRHS right hand side matrix B.LDBβLDB is INTEGER. The leading dimension of the array B.LDB >= max(1,N).XβX is REAL array, dimension (LDX,NRHS). IfINFO = 0orINFO = N+1, the N-by-NRHS solution matrix X. πLDXβLDX is INTEGER. The leading dimension of the array X.LDX >= max(1,N).RCONDβRCOND is REAL. The reciprocal condition number of the matrix A. IfRCONDis less than the machine precision (in particular, ifRCOND = 0), the matrix is singular to working precision. This condition is indicated by a return code ofINFO > 0. β οΈFERRβFERR is REAL array, dimension (NRHS). The forward error bound for each solution vectorX(j)(the j-th column of the solution matrix X). IfXTRUEis the true solution corresponding toX(j),FERR(j)is an estimated upper bound for the magnitude of the largest element in(X(j) - XTRUE)divided by the magnitude of the largest element inX(j). πBERRβBERR is REAL array, dimension (NRHS). The componentwise relative backward error of each solution vectorX(j)(i.e., the smallest relative change in any element of A or B that makesX(j)an exact solution).WORKβWORK is REAL array, dimension (2*N). πINFOβINFO is INTEGER.= 0: successful exit.< 0: ifINFO = -i, the i-th argument had an illegal value.> 0: ifINFO = i, and i is:<= N: the leading principal minor of order i of A is not positive, so the factorization could not be completed, and the solution has not been computed.RCOND = 0is returned.= N+1: U is nonsingular, butRCONDis less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value ofRCONDwould suggest. π₯
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 226 of file sptsvx.f. π―
β¨ Author
Generated automatically by Doxygen for LAPACK from the source code.
That's the whole vibe, bestie! π This page comes from SRC/sptsvx.f(3) and it's LAPACK Version 3.12.0. The footer doesn't give us a date, so no invented date β just the version and the source. πβ¨
π¦ 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