CGET07(3)

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

πŸ’… CGET07(3) β€” Library Functions Manual edition πŸ’–

Bestie, welcome to the group chat for CGET07 β€” she lives in the Library Functions Manual, and she is here to test error bounds. Obsessed. ✨

✨ NAME ✨

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/LIN/cget07.f

πŸ¦‹ SYNOPSIS πŸ¦‹

🧚 Functions/Subroutines

subroutine CGET07 (trans, n, nrhs, a, lda, b, ldb, x, ldx, xact, ldxact, ferr, chkferr, berr, reslts)

CGET07 β€” yeah, that’s the whole vibe. 🫢

🌸 Function/Subroutine Documentation 🌸

subroutine CGET07 (character trans, 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,
    logical chkferr, real, dimension( * ) berr, real, dimension( * ) reslts)

CGET07 β€” yes, her name again, main character energy. πŸ‘‘

🎯 Purpose

Okay so CGET07 tests the error bounds from iterative refinement for the computed solution to a system of equations op(A)*X = B, where A is a general n by n matrix and op(A) = A or A**T, depending on TRANS. No cap. πŸ¦‹

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. Watch out, bestie β€” that’s the warning vibe. πŸ’€

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

🧸 Parameters

πŸ” TRANS

TRANS is CHARACTER*1

Specifies the form of the system of equations.

= 'N':  A * X = B     (No transpose)
= 'T':  A**T * X = B  (Transpose)
= 'C':  A**H * X = B  (Conjugate transpose = Transpose)

πŸ”’ N

N is INTEGER

The number of rows of the matrices X and XACT. N >= 0.

πŸ”’ NRHS

NRHS is INTEGER

The number of columns of the matrices X and XACT. NRHS >= 0.

🧊 A

A is COMPLEX array, dimension (LDA,N)

The original n by n matrix A.

πŸ“ LDA

LDA is INTEGER

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

🧊 B

B is COMPLEX array, dimension (LDB,NRHS)

The right hand side vectors for the system of linear equations.

πŸ“ LDB

LDB is INTEGER

The leading dimension of the array B. LDB >= max(1,N).

🧊 X

X is COMPLEX array, dimension (LDX,NRHS)

The computed solution vectors. Each vector is stored as a column of the matrix X.

πŸ“ LDX

LDX is INTEGER

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

🧊 XACT

XACT is COMPLEX array, dimension (LDX,NRHS)

The exact solution vectors. Each vector is stored as a column of the matrix XACT.

πŸ“ LDXACT

LDXACT is INTEGER

The leading dimension of the array XACT. LDXACT >= max(1,N).

πŸ§ͺ FERR

FERR is 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.

βœ… CHKFERR

CHKFERR is LOGICAL

Set to .TRUE. to check FERR, .FALSE. not to check FERR. When the test system is ill-conditioned, the solution in XACT may be incorrect.

πŸ§ͺ BERR

BERR is 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

RESLTS is 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 164 of file cget07.f.

🫢 Author

Generated automatically by Doxygen for LAPACK from the source code.


πŸ’– Cute sign-off: this page is from LAPACK Version 3.12.0, and the source path is /home/abui...IN/cget07.f(3). The footer didn’t give me a separate date, so I’m not inventing one β€” periodt. 🫢

πŸ“¦ where this page comes from