SPBRFS(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

🌸 NAME 🌸

Okay bestie, this is SPBRFS(3) from the Library Functions Manual β€” the page path is /home/abui...RC/spbrfs.f(3), and the source file is /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/spbrfs.f. ✨


πŸ¦‹ SYNOPSIS πŸ¦‹

Functions/Subroutines β€” here’s the whole group-chat invite, no cap:

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 ✨

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 πŸ’–

SPBRFS 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 β€œclean up the solution and tell me how confident we are.” πŸ’…

🫢 Parameters 🫢

  • UPLO β€” CHARACTER*1. Tells us which triangle of A is stored: = 'U': upper triangle of A is stored; = 'L': lower triangle of A is stored. Pick your side, bestie.
  • N β€” INTEGER. The order of the matrix A. N >= 0.
  • KD β€” INTEGER. The number of superdiagonals of the matrix A if UPLO = 'U', or the number of subdiagonals if UPLO = '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 β€” REAL array, dimension (LDAB,N). The upper or lower triangle of the symmetric band matrix A, stored in the first KD+1 rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: 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 β€” INTEGER. The leading dimension of the array AB. LDAB >= KD+1.
  • AFB β€” REAL array, dimension (LDAFB,N). The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T of the band matrix A as computed by SPBTRF, in the same storage format as A (see AB).
  • LDAFB β€” INTEGER. The leading dimension of the array AFB. LDAFB >= KD+1.
  • B β€” REAL array, dimension (LDB,NRHS). The right hand side matrix B.
  • LDB β€” INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • X β€” REAL array, dimension (LDX,NRHS). On entry, the solution matrix X, as computed by SPBTRS. On exit, the improved solution matrix X. Glow-up arc, literally.
  • LDX β€” INTEGER. The leading dimension of the array X. LDX >= max(1,N).
  • FERR β€” REAL array, dimension (NRHS). The estimated forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true solution corresponding to X(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 in X(j). The estimate is as reliable as the estimate for RCOND, and is almost always a slight overestimate of the true error.
  • BERR β€” 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 makes X(j) an exact solution).
  • WORK β€” REAL array, dimension (3*N).
  • IWORK β€” INTEGER array, dimension (N).
  • INFO β€” INTEGER. = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value. so if it’s negative, someone did not read the assignment. πŸ’€

🧚 Internal Parameters 🧚

  • ITMAX β€” is the maximum number of steps of iterative refinement. Obsessed with her little refinement loop.

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 187 of file spbrfs.f.


πŸ‘‘ Author πŸ‘‘

Generated automatically by Doxygen for LAPACK from the source code.


okay that’s the whole page, bestie 🫢✨ β€” LAPACK Version 3.12.0, footer path /home/abui...RC/spbrfs.f(3). byeee πŸ’…πŸŽ€

πŸ“¦ where this page comes from