SRC/cpbrfs.f(3)

πŸŽ€ SRC/cpbrfs.f(3) β€” Library Functions Manual πŸ’…

okay bestie, this is the manual page for SRC/cpbrfs.f, and it's literally the CPBRFS routine doing its banded Hermitian positive definite thing. no cap, it's giving linear-algebra main character energy. πŸ¦‹


🌸 NAME 🌸

SRC/cpbrfs.f β€” that's the name, periodt. πŸ’–


✨ SYNOPSIS ✨

πŸ’– Functions/Subroutines

subroutine cpbrfs (uplo, n, kd, nrhs, ab, ldab, afb, ldafb, b, ldb, x,
    ldx, ferr, berr, work, rwork, info)
    CPBRFS

πŸ¦‹ Function/Subroutine Documentation πŸ¦‹

subroutine cpbrfs (character uplo, integer n, integer kd, integer nrhs,
    complex, dimension( ldab, * ) ab, integer ldab, complex, dimension(
    ldafb, * ) afb, integer ldafb, complex, dimension( ldb, * ) b, integer
    ldb, complex, dimension( ldx, * ) x, integer ldx, real, dimension( * )
    ferr, real, dimension( * ) berr, complex, dimension( * ) work, real,
    dimension( * ) rwork, integer info)
    CPBRFS

πŸ’– Purpose:

okay so CPBRFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution. slay. πŸ’…

πŸ”₯ 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. ✨
  • KD β€” KD is INTEGER. The number of superdiagonals of the matrix A if UPLO = 'U', or the number of subdiagonals if UPLO = 'L'. KD >= 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. πŸ’–
  • AB β€” AB is COMPLEX array, dimension (LDAB,N). The upper or lower triangle of the Hermitian 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 β€” LDAB is INTEGER. The leading dimension of the array AB. LDAB >= KD+1. 🫢
  • AFB β€” AFB is COMPLEX array, dimension (LDAFB,N). The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H of the band matrix A as computed by CPBTRF, in the same storage format as A (see AB). πŸ’œ
  • LDAFB β€” LDAFB is INTEGER. The leading dimension of the array AFB. LDAFB >= KD+1. πŸ’«
  • B β€” B is COMPLEX 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). 🌈
  • X β€” X is COMPLEX array, dimension (LDX,NRHS). On entry, the solution matrix X, as computed by CPBTRS. On exit, the improved solution matrix X. ✨
  • LDX β€” LDX is INTEGER. The leading dimension of the array X. LDX >= max(1,N). πŸŽ€
  • 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). 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 β€” 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 makes X(j) an exact solution). πŸ’€
  • WORK β€” WORK is COMPLEX array, dimension (2*N). πŸ”₯
  • RWORK β€” RWORK is REAL array, dimension (N). 🌸
  • INFO β€” INFO is INTEGER. = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value. πŸ‘‘

🧚 Internal Parameters:

  • ITMAX β€” ITMAX is the maximum number of steps of iterative refinement. 🫢

πŸ‘‘ Author

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

Definition at line 187 of file cpbrfs.f. πŸ“Œ


🌈 Author

Generated automatically by Doxygen for LAPACK from the source code. πŸ€–

🫢 and that's the whole page, bestie β€” brought to you by LAPACK, Version 3.12.0, page SRC/cpbrfs.f(3). bye πŸ’–
πŸ“¦ where this page comes from