SRC/cherfsx.f(3)

📦

version 3.12.1 · 7 versions

3.12.1 · arch rolling (latest)
3.9.0 · centos-stream 9
3.10.0 · ubuntu jammy
3.12.0 · ubuntu noble
3.12.0 · ubuntu noble
3.12.0 · centos-stream 10, fedora 43, fedora 44
3.11.0 · debian bookworm

💖 SRC/cherfsx.f 💖

Okay bestie, we're in the Library Functions Manual and the page is SRC/cherfsx.f(3) — yes, it's giving Fortran file energy, and we're gonna read it together. 🫶

💖 NAME 💖

SRC/cherfsx.f — that's the whole name, and honestly? Iconic minimalism. 💅

✨ SYNOPSIS ✨

🎀 Functions/Subroutines 🎀

   subroutine cherfsx (uplo, equed, n, nrhs, a, lda, af, ldaf, ipiv, s, b,
       ldb, x, ldx, rcond, berr, n_err_bnds, err_bnds_norm, err_bnds_comp,
       nparams, params, work, rwork, info)
       CHERFSX

🌸 Function/Subroutine Documentation 🌸

   subroutine cherfsx (character uplo, character equed, integer n, integer
       nrhs, complex, dimension( lda, * ) a, integer lda, complex, dimension(
       ldaf, * ) af, integer ldaf, integer, dimension( * ) ipiv, real,
       dimension( * ) s, complex, dimension( ldb, * ) b, integer ldb, complex,
       dimension( ldx, * ) x, integer ldx, real rcond, real, dimension( * )
       berr, integer n_err_bnds, real, dimension( nrhs, * ) err_bnds_norm,
       real, dimension( nrhs, * ) err_bnds_comp, integer nparams, real,
       dimension( * ) params, complex, dimension( * ) work, real, dimension( *
       ) rwork, integer info)
       CHERFSX

🧚 Purpose 🧚

Okay so CHERFSX is the glow-up routine for a computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite. It improves that computed solution, and it also hands you error bounds and backward error estimates for the solution. Slay.

On top of the normwise error bound, the code provides the maximum componentwise error bound if possible. See the comments for ERR_BNDS_NORM and ERR_BNDS_COMP for the deets on those error bounds. 👑

The original system of linear equations may have been equilibrated before calling this routine — that's what arguments EQUED and S below are describing. In that case, the solution and error bounds returned are for the original unequilibrated system. Bestie, don't forget that part. 🫶

Some optional parameters are bundled in the PARAMS array. These settings determine how refinement is performed, but often the defaults are acceptable. If the defaults are acceptable, users can pass NPARAMS = 0, which prevents the source code from accessing the PARAMS argument. No cap, that's the whole vibe. ✨

💅 Parameters 💅

🦋 `UPLO` 🦋

UPLO is CHARACTER*1

= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.

🦋 `EQUED` 🦋

EQUED is CHARACTER*1

Specifies the form of equilibration that was done to A before calling this routine. This is needed to compute the solution and error bounds correctly. Important lil detail, bestie.

= 'N': No equilibration
= 'Y': Both row and column equilibration, i.e., A has been replaced by diag(S) * A * diag(S). The right hand side B has been changed accordingly.

🦋 `N` 🦋

N is INTEGER

The order of the matrix A. N >= 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.

🦋 `A` 🦋

A is COMPLEX array, dimension (LDA,N)

The Hermitian matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading N-by-N lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. Triangle rules, periodt.

🦋 `LDA` 🦋

LDA is INTEGER

The leading dimension of the array A. LDA >= max(1,N).

🦋 `AF` 🦋

AF is COMPLEX array, dimension (LDAF,N)

The factored form of the matrix A. AF contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A = U*D*U**H or A = L*D*L**H as computed by CHETRF. Math but make it fashion. ✨

🦋 `LDAF` 🦋

LDAF is INTEGER

The leading dimension of the array AF. LDAF >= max(1,N).

🦋 `IPIV` 🦋

IPIV is INTEGER array, dimension (N)

Details of the interchanges and the block structure of D as determined by CHETRF.

🍓 `S` 🍓

S is REAL array, dimension (N)

The scale factors for A. If EQUED = 'Y', A is multiplied on the left and right by diag(S). S is an input argument if FACT = 'F'; otherwise, S is an output argument. If FACT = 'F' and EQUED = 'Y', each element of S must be positive. If S is output, each element of S is a power of the radix. If S is input, each element of S should be a power of the radix to ensure a reliable solution and error estimates. Scaling by powers of the radix does not cause rounding errors unless the result underflows or overflows. Rounding errors during scaling lead to refining with a matrix that is not equivalent to the input matrix, producing error estimates that may not be reliable. Read that twice, bestie — reliability is the whole point. 😭

🦋 `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 CHETRS. On exit, the improved solution matrix X. Glow-up complete. 💅

🦋 `LDX` 🦋

LDX is INTEGER

The leading dimension of the array X. LDX >= max(1,N).

🦋 `RCOND` 🦋

RCOND is REAL

Reciprocal scaled condition number. This is an estimate of the reciprocal Skeel condition number of the matrix A after equilibration (if done). If this is less than the machine precision (in particular, if it is zero), the matrix is singular to working precision. Note that the error may still be small even if this number is very small and the matrix appears ill-conditioned. Not me warning you nicely, but yes — tiny RCOND needs a vibe check. 🫶

🦋 `BERR` 🦋

BERR is REAL array, dimension (NRHS)

Componentwise relative backward error. This is 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).

🦋 `N_ERR_BNDS` 🦋

N_ERR_BNDS is INTEGER

Number of error bounds to return for each right hand side and each type (normwise or componentwise). See ERR_BNDS_NORM and ERR_BNDS_COMP below.

🌈 `ERR_BNDS_NORM` 🌈

ERR_BNDS_NORM is REAL array, dimension (NRHS, N_ERR_BNDS)

For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the normwise relative error, which is defined as follows:

Normwise relative error in the ith solution vector:

        max_j (abs(XTRUE(j,i) - X(j,i)))
       ------------------------------
             max_j abs(X(j,i))

The array is indexed by the type of error information as described below. There currently are up to three pieces of information returned.

The first index in ERR_BNDS_NORM(i,:) corresponds to the ith right-hand side.

The second index in ERR_BNDS_NORM(:,err) contains the following three fields:

err = 1 boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch('Epsilon').
err = 2 error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch('Epsilon'). This error bound should only be trusted if the previous boolean is true.
err = 3 Reciprocal condition number: Estimated normwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch('Epsilon') to determine if the error estimate is [the source has a blank here — no cap, bestie 😭]. These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*A, where S scales each row by a power of the radix so all absolute row sums of Z are approximately 1.

See Lapack Working Note 165 for further details and extra cautions. LW Note 165 said read the fine print, and honestly same. ✨

🦋 `ERR_BNDS_COMP` 🦋

Okay so picking up right where we left off, no heading reset, just vibes: next up is ERR_BNDS_COMP 💅

ERR_BNDS_COMP is a REAL array, dimension (NRHS, N_ERR_BNDS).

For each right-hand side, this array contains information about various error bounds and condition numbers corresponding to the componentwise relative error, which is defined as follows:

                   abs(XTRUE(j,i) - X(j,i))
            max_j ----------------------
                        abs(X(j,i))

Componentwise relative error in the ith solution vector is that little formula right there, bestie. The array is indexed by the right-hand side i (on which the componentwise relative error depends), and the type of error information as described below. There currently are up to three pieces of information returned for each right-hand side. If componentwise accuracy is not requested (PARAMS(3) = 0.0), then ERR_BNDS_COMP is not accessed. If N_ERR_BNDS < 3, then at most the first (:,N_ERR_BNDS) entries are returned.

The first index in ERR_BNDS_COMP(i,:) corresponds to the ith right-hand side.

The second index in ERR_BNDS_COMP(:,err) contains the following three fields:

err = 1 — boolean. Trust the answer if the reciprocal condition number is less than the threshold sqrt(n) * slamch('Epsilon').
err = 2 — error bound: The estimated forward error, almost certainly within a factor of 10 of the true error so long as the next entry is greater than the threshold sqrt(n) * slamch('Epsilon'). This error bound should only be trusted if the previous boolean is true.
err = 3 — Reciprocal condition number: Estimated componentwise reciprocal condition number. Compared with the threshold sqrt(n) * slamch('Epsilon') to determine if the error estimate is . These reciprocal condition numbers are 1 / (norm(Z^{-1},inf) * norm(Z,inf)) for some appropriately scaled matrix Z. Let Z = S*(A*diag(x)), where x is the solution for the current right-hand side and S scales each row of A*diag(x) by a power of the radix so all absolute row sums of Z are approximately 1.

The source literally says “to determine if the error estimate is .” and yes, that sentence is serving unfinished-thought energy 💀 I am not adding words that aren’t there, no cap.

See Lapack Working Note 165 for further details and extra cautions.

NPARAMS is INTEGER. Specifies the number of parameters set in PARAMS. If <= 0, the PARAMS array is never referenced and default values are used.
PARAMS is a REAL array, dimension NPARAMS. Specifies algorithm parameters. If an entry is < 0.0, then that entry will be filled with default value used for that parameter. Only positions up to NPARAMS are accessed; defaults are used for higher-numbered parameters.
- PARAMS(LA_LINRX_ITREF_I = 1) — Whether to perform iterative refinement or not.
  - Default: 1.0
  - = 0.0: No refinement is performed, and no error bounds are computed.
  - = 1.0: Use the double-precision refinement algorithm, possibly with doubled-single computations if the compilation environment does not support DOUBLE PRECISION.
  - (other values are reserved for future use)
- PARAMS(LA_LINRX_ITHRESH_I = 2) — Maximum number of residual computations allowed for refinement.
  - Default: 10
  - Aggressive: Set to 100 to permit convergence using approximate factorizations or factorizations other than LU. If the factorization uses a technique other than Gaussian elimination, the guarantees in err_bnds_norm and err_bnds_comp may no longer be trustworthy.
- PARAMS(LA_LINRX_CWISE_I = 3) — Flag determining if the code will attempt to find a solution with small componentwise relative error in the double-precision algorithm. Positive is true, 0.0 is false.
  - Default: 1.0 (attempt componentwise convergence)
WORK is a COMPLEX array, dimension (2*N).
RWORK is a REAL array, dimension (2*N).
INFO is INTEGER.
- = 0: Successful exit. The solution to every right-hand side is guaranteed.
- < 0: If INFO = -i, the i-th argument had an illegal value.
- > 0 and <= N: U(INFO,INFO) is exactly zero. The factorization has been completed, but the factor U is exactly singular, so the solution and error bounds could not be computed. RCOND = 0 is returned.
- = N+J: The solution corresponding to the Jth right-hand side is not guaranteed. The solutions corresponding to other right-hand sides K with K > J may not be guaranteed as well, but only the first such right-hand side is reported. If a small componentwise error is not requested (PARAMS(3) = 0.0) then the Jth right-hand side is the first with a normwise error bound that is not guaranteed (the smallest J such that ERR_BNDS_NORM(J,1) = 0.0). By default (PARAMS(3) = 1.0) the Jth right-hand side is the first with either a normwise or componentwise error bound that is not guaranteed (the smallest J such that either ERR_BNDS_NORM(J,1) = 0.0 or ERR_BNDS_COMP(J,1) = 0.0). See the definition of ERR_BNDS_NORM(:,1) and ERR_BNDS_COMP(:,1). To get information about all of the right-hand sides check ERR_BNDS_NORM or ERR_BNDS_COMP.

🌟 Author 🌟

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

Definition at line 397 of file cherfsx.f.

🎀 Author 🎀

Generated automatically by Doxygen for LAPACK from the source code.

Okay bestie, footer moment: this iconic little page is from LAPACK Version 3.12.0, source file SRC/cherfsx.f(3). The date isn’t shown in this footer snippet, but the Doxygen stamp is doing its thing and the vibe is timeless — periodt. 💖✨

📦 where this page comes from

arch rolling: lapack-doc 3.12.1-2 · custom
💖 girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on 2026-11-04: a language model's rewrite of the original, under its terms

SRC/cherfsx.f(3)

💖 SRC/cherfsx.f 💖

💖 NAME 💖

✨ SYNOPSIS ✨

🎀 Functions/Subroutines 🎀

🌸 Function/Subroutine Documentation 🌸

🧚 Purpose 🧚

💅 Parameters 💅

🦋 UPLO 🦋

🦋 EQUED 🦋

🦋 N 🦋

🦋 NRHS 🦋

🦋 A 🦋

🦋 LDA 🦋

🦋 AF 🦋

🦋 LDAF 🦋

🦋 IPIV 🦋

🍓 S 🍓

🦋 B 🦋

🦋 LDB 🦋

🦋 X 🦋

🦋 LDX 🦋

🦋 RCOND 🦋

🦋 BERR 🦋

🦋 N_ERR_BNDS 🦋

🌈 ERR_BNDS_NORM 🌈

🦋 ERR_BNDS_COMP 🦋