SRC/spbrfs.f(3)
πΈ NAME πΈ
okay bestie, welcome to SRC/spbrfs.f β this is the page from the Library Functions Manual for SRC/spbrfs.f(3), and it is lowkey iconic. It's giving LAPACK precision-accuracy energy, and we're gonna read it together. π
β¨ SYNOPSIS β¨
π«Ά Functions/Subroutines π«Ά
subroutine spbrfs (uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x,
ldx, ferr, berr, work, iwork, info)
SPBRFS
π Function/Subroutine Documentation π
subroutine spbrfs (character uplo, integer n, integer kd, integer nrhs,
real, dimension( ldab, * ) ab, integer ldab, real, dimension( ldafb, * )
afb, integer ldafb, real, dimension( ldb, * ) b, integer ldb, real,
dimension( ldx, * ) x, integer ldx, real, dimension( * ) ferr, real,
dimension( * ) berr, real, dimension( * ) work, integer, dimension( * )
iwork, integer info)
SPBRFS
π Purpose π
So SPBRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution. That's the whole mission, bestie. β¨
π§ 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 order of the matrix A.
N >= 0.
- The order of the matrix A.
KDβKD is INTEGER- The number of superdiagonals of the matrix A if
UPLO = 'U', or the number of subdiagonals ifUPLO = 'L'.KD >= 0.
- The number of superdiagonals of the matrix A if
NRHSβNRHS is INTEGER- The number of right hand sides, i.e., the number of columns of the matrices B and X.
NRHS >= 0.
- The number of right hand sides, i.e., the number of columns of the matrices B and X.
ABβAB is REAL array, dimension (LDAB,N)- 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 array AB as follows:
- The upper or lower triangle of the symmetric band matrix A, stored in the first
if UPLO = 'U', AB(kd+1+i-j,j) = A(i,j) for max(1,j-kd)<=i<=j;
if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=min(n,j+kd).
LDABβLDAB is INTEGER- The leading dimension of the array AB.
LDAB >= KD+1.
- The leading dimension of the array AB.
AFBβAFB is REAL array, dimension (LDAFB,N)- The triangular factor U or L from the Cholesky factorization
A = U**T*UorA = L*L**Tof the band matrix A as computed bySPBTRF, in the same storage format as A (seeAB).
- The triangular factor U or L from the Cholesky factorization
LDAFBβLDAFB is INTEGER- The leading dimension of the array AFB.
LDAFB >= KD+1.
- The leading dimension of the array AFB.
BβB is REAL array, dimension (LDB,NRHS)- The right hand side matrix B.
LDBβLDB is INTEGER- The leading dimension of the array B.
LDB >= max(1,N).
- The leading dimension of the array B.
XβX is REAL array, dimension (LDX,NRHS)- On entry, the solution matrix X, as computed by
SPBTRS. - On exit, the improved solution matrix X.
- On entry, the solution matrix X, as computed by
LDXβLDX is INTEGER- The leading dimension of the array X.
LDX >= max(1,N).
- The leading dimension of the array X.
FERRβFERR is REAL array, dimension (NRHS)- The estimated forward error bound for each solution vector
X(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). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error. ngl, that's a whole paragraph, but it ate. π
- The estimated forward error bound for each solution vector
BERRβBERR is REAL array, dimension (NRHS)- The componentwise relative backward error of each solution vector
X(j)(i.e., the smallest relative change in any element of A or B that makesX(j)an exact solution).
- The componentwise relative backward error of each solution vector
WORKβWORK is REAL array, dimension (3*N)IWORKβIWORK is INTEGER array, dimension (N)INFOβINFO is INTEGER= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value
π§ Internal Parameters π§
ITMAXis the maximum number of steps of iterative refinement. periodt.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line 187 of file spbrfs.f. π
yup, that's the exact line, bestie β Definition at line 187 of file spbrfs.f.
π Author π
This page was generated automatically by Doxygen for LAPACK from the source code. slay. π
π That's the whole page, bestie β brought to you by LAPACK Version 3.12.0 and SRC/spbrfs.f(3), mwah π
π¦ 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