SRC/spprfs.f(3)
π SRC/spprfs.f(3) β Library Functions Manual π
okay so this is the manual page for SRC/spprfs.f(3), and the main character is the spprfs subroutine. It's giving LAPACK refinement energy: packed symmetric positive definite systems get their solution polished, and the error bounds come along for the ride. Buckle up bestie. π
β¨ NAME β¨
SRC/spprfs.f β that's the file, and the routine living in it is spprfs. Slay.
β¨ SYNOPSIS β¨
β¨ Functions/Subroutines β¨
subroutine spprfs (uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr, work, iwork, info)βSPPRFS.
subroutine spprfs (uplo, n, nrhs, ap, afp, b, ldb, x, ldx, ferr, berr,
work, iwork, info)
β¨ Function/Subroutine Documentation β¨
subroutine spprfs
subroutine spprfs (character uplo, integer n, integer nrhs, real, dimension(
* ) ap, real, dimension( * ) afp, 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)
SPPRFS
β¨ Purpose β¨
okay so what does SPPRFS actually do? It improves the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and it provides error bounds and backward error estimates for the solution. That's the whole assignment, no cap. π
β¨ Parameters β¨
UPLOβUPLO is CHARACTER*1.= 'U': Upper triangle of A is stored;= 'L': Lower triangle of A is stored. It's literally telling you which triangle ofAis packed in there. π¦NβN is INTEGER. The order of the matrixA.N >= 0.NRHSβNRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.APβAP is REAL array, dimension (N*(N+1)/2). This holds the upper or lower triangle of the symmetric matrixA, packed columnwise in a linear array. The j-th column ofAis stored in the arrayAPas follows: ifUPLO = 'U',AP(i + (j-1)*j/2) = A(i,j)for1<=i<=j; ifUPLO = 'L',AP(i + (j-1)*(2n-j)/2) = A(i,j)forj<=i<=n.AFPβAFP is REAL array, dimension (N*(N+1)/2). This is the triangular factorUorLfrom the Cholesky factorizationA = U**T*UorA = L*L**T, as computed bySPPTRF/CPPTRF, packed columnwise in a linear array in the same format asA(seeAP).BβB is REAL array, dimension (LDB,NRHS). The right hand side matrixB.LDBβLDB is INTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβX is REAL array, dimension (LDX,NRHS). On entry, the solution matrixX, as computed bySPPTRS. On exit, the improved solution matrixX.LDXβLDX is INTEGER. The leading dimension of the arrayX.LDX >= max(1,N).FERRβFERR is REAL array, dimension (NRHS). The estimated forward error bound for each solution vectorX(j)(the j-th column of the solution matrixX). IfXTRUEis the true solution corresponding toX(j), thenFERR(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 it is almost always a slight overestimate of the true error. Not me being dramatic, that's literally the spec. π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 ofAorBthat makesX(j)an exact solution).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 β¨
ITMAXβ the maximum number of steps of iterative refinement. That's the internal dial, iykyk. π₯
β¨ Author β¨
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 169 of file spprfs.f.
β¨ Author β¨
Generated automatically by Doxygen for LAPACK from the source code. Yes, bestie, that's the second Author block β Doxygen really said "and I took that personally." π
LAPACK Version 3.12.0 Β· SRC/spprfs.f(3) β that's the footer energy, 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