SRC/dpbrfs.f(3)
β¨ NAME β¨
SRC/dpbrfs.f β okay so bestie, this is the SRC/dpbrfs.f(3) page from the Library Functions Manual, and it's literally all about dpbrfs. π
πΈ SYNOPSIS πΈ
π§ Functions/Subroutines π§
subroutine dpbrfs (uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x,
ldx, ferr, berr, work, iwork, info)
DPBRFS
π Function/Subroutine Documentation π
π subroutine dpbrfs π
subroutine dpbrfs (character uplo, integer n, integer kd, integer nrhs,
double precision, dimension( ldab, * ) ab, integer ldab, double
precision, dimension( ldafb, * ) afb, integer ldafb, double precision,
dimension( ldb, * ) b, integer ldb, double precision, dimension( ldx, *
) x, integer ldx, double precision, dimension( * ) ferr, double
precision, dimension( * ) berr, double precision, dimension( * ) work,
integer, dimension( * ) iwork, integer info)
DPBRFS
DPBRFS is the main character of this page, no cap. β¨
π― Purpose
DPBRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and it provides error bounds and backward error estimates for the solution. it's giving "solution glow-up with receipts." π
π¦ Parameters
UPLOβCHARACTER*1= 'U': Upper triangle of A is stored;= 'L': Lower triangle of A is stored.
NβINTEGER. The order of the matrix A.N >= 0.KDβINTEGER. The number of superdiagonals of the matrix A ifUPLO = 'U', or the number of subdiagonals ifUPLO = 'L'.KD >= 0.NRHSβINTEGER. The number of right hand sides, i.e., the number of columns of the matrices B and X.NRHS >= 0.ABβDOUBLE PRECISIONarray, dimension(LDAB,N). The upper or lower triangle of the symmetric band matrix A, stored in the firstKD+1rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: ifUPLO = 'U',AB(kd+1+i-j,j) = A(i,j)formax(1,j-kd)<=i<=j; ifUPLO = 'L',AB(1+i-j,j) = A(i,j)forj<=i<=min(n,j+kd).LDABβINTEGER. The leading dimension of the array AB.LDAB >= KD+1.AFBβDOUBLE PRECISIONarray, dimension(LDAFB,N). The triangular factor U or L from the Cholesky factorizationA = U**T*UorA = L*L**Tof the band matrix A as computed byDPBTRF, in the same storage format as A (seeAB).LDAFBβINTEGER. The leading dimension of the array AFB.LDAFB >= KD+1.BβDOUBLE PRECISIONarray, dimension(LDB,NRHS). The right hand side matrix B.LDBβINTEGER. The leading dimension of the array B.LDB >= max(1,N).XβDOUBLE PRECISIONarray, dimension(LDX,NRHS). On entry, the solution matrix X, as computed byDPBTRS. On exit, the improved solution matrix X.LDXβINTEGER. The leading dimension of the array X.LDX >= max(1,N).FERRβDOUBLE PRECISIONarray, dimension(NRHS). The estimated 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). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error.BERRβDOUBLE PRECISIONarray, 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βDOUBLE PRECISIONarray, dimension(3*N).IWORKβINTEGERarray, dimension(N).INFOβINTEGER.= 0: successful exit< 0: ifINFO = -i, the i-th argument had an illegal value
π οΈ Internal Parameters
ITMAX is the maximum number of steps of iterative refinement. that's the little engine behind the glow-up. π₯
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 187 of file dpbrfs.f.
π«Ά Author π«Ά
Generated automatically by Doxygen for LAPACK from the source code.
that's the whole page, bestie β brought to you by LAPACK Version 3.12.0 and the SRC/dpbrfs.f(3) life. πβ¨
π¦ 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