TESTING/LIN/cpot05.f(3)

πŸ“¦
version 3.12.1 Β· 3 versions
, in arch rolling

πŸ’– CPOT05 β€” TESTING/LIN/cpot05.f πŸ’–

okay so this is the TESTING/LIN/cpot05.f(3) page from the Library Functions Manual, bestie. It's all about the cpot05 subroutine. no cap, she's an icon.

🌸 NAME 🌸

TESTING/LIN/cpot05.f

πŸ¦‹ SYNOPSIS πŸ¦‹

🧚 Functions/Subroutines 🧚

subroutine cpot05 (uplo, n, nrhs, a, lda, b, ldb, x, ldx, xact, ldxact,
    ferr, berr, reslts)
    CPOT05

✨ Function/Subroutine Documentation ✨

πŸ’… The signature, verbatim πŸ’…

subroutine cpot05 (character uplo, integer n, integer nrhs, complex,
    dimension( lda, * ) a, integer lda, complex, dimension( ldb, * ) b,
    integer ldb, complex, dimension( ldx, * ) x, integer ldx, complex,
    dimension( ldxact, * ) xact, integer ldxact, real, dimension( * ) ferr,
    real, dimension( * ) berr, real, dimension( * ) reslts)
    CPOT05

πŸ’– Purpose πŸ’–

okay so CPOT05 tests the error bounds from iterative refinement for the computed solution to a system of equations A*X = B, where A is a Hermitian n by n matrix. literally her whole job.

The two result slots, exactly:

RESLTS(1) = test of the error bound
          = norm(X - XACT) / ( norm(X) * FERR )

A large value is returned if this ratio is not less than one.

RESLTS(2) = residual from the iterative refinement routine
          = the maximum of BERR / ( (n+1)*EPS + (*) ), where
            (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i )

πŸŽ€ Parameters πŸŽ€

here's every parameter, no skipping, periodt:

  • UPLO β€” CHARACTER*1. Specifies whether the upper or lower triangular part of the Hermitian matrix A is stored. 'U': upper triangular. 'L': lower triangular.
  • N β€” INTEGER. The number of rows of the matrices X, B, and XACT, and the order of the matrix A. N >= 0.
  • NRHS β€” INTEGER. The number of columns of the matrices X, B, and XACT. NRHS >= 0.
  • A β€” 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.
  • LDA β€” INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • B β€” COMPLEX array, dimension (LDB,NRHS). The right hand side vectors for the system of linear equations.
  • LDB β€” INTEGER. The leading dimension of the array B. LDB >= max(1,N).
  • X β€” COMPLEX array, dimension (LDX,NRHS). The computed solution vectors. Each vector is stored as a column of the matrix X.
  • LDX β€” INTEGER. The leading dimension of the array X. LDX >= max(1,N).
  • XACT β€” COMPLEX array, dimension (LDX,NRHS). The exact solution vectors. Each vector is stored as a column of the matrix XACT.
  • LDXACT β€” INTEGER. The leading dimension of the array XACT. LDXACT >= max(1,N).
  • FERR β€” REAL array, dimension (NRHS). The estimated forward error bounds for each solution vector X. If XTRUE is the true solution, FERR bounds the magnitude of the largest entry in (X - XTRUE) divided by the magnitude of the largest entry in X.
  • BERR β€” REAL array, dimension (NRHS). The componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry of A or B that makes X an exact solution).
  • RESLTS β€” REAL array, dimension (2). The maximum over the NRHS solution vectors of the ratios: RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) RESLTS(2) = BERR / ( (n+1)*EPS + (*) )

🌟 Author 🌟

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

Definition at line 163 of file cpot05.f.

πŸ‘‘ Author πŸ‘‘

Generated automatically by Doxygen for LAPACK from the source code.


okay that's the whole page, bestie. This footer says LAPACK Version 3.12.0 and the page is TESTING/LIN/cpot05.f(3). mwah πŸ’‹βœ¨

πŸ“¦ where this page comes from