porfs#
Functions
-
void sporfs(const char *uplo, const INT n, const INT nrhs, const f32 *restrict A, const INT lda, const f32 *restrict AF, const INT ldaf, const f32 *restrict B, const INT ldb, f32 *restrict X, const INT ldx, f32 *restrict ferr, f32 *restrict berr, f32 *restrict work, INT *restrict iwork, INT *info)#
SPORFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, and provides error bounds and backward error estimates for the solution.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inAThe symmetric matrix A. Array of dimension (lda, n).
inldaThe leading dimension of A. lda >= max(1, n).
inAFThe triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T. Array of dimension (ldaf, n).
inldafThe leading dimension of AF. ldaf >= max(1, n).
inBThe right hand side matrix B. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1, n).
inoutXOn entry, the solution matrix X. On exit, the improved solution matrix X. Array of dimension (ldx, nrhs).
inldxThe leading dimension of X. ldx >= max(1, n).
outferrThe estimated forward error bound for each solution vector. Array of dimension (nrhs).
outberrThe componentwise relative backward error. Array of dimension (nrhs).
outworkWorkspace array of dimension (3*n).
outiworkInteger workspace array of dimension (n).
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
void sporfs(
const char* uplo,
const INT n,
const INT nrhs,
const f32* restrict A,
const INT lda,
const f32* restrict AF,
const INT ldaf,
const f32* restrict B,
const INT ldb,
f32* restrict X,
const INT ldx,
f32* restrict ferr,
f32* restrict berr,
f32* restrict work,
INT* restrict iwork,
INT* info
);
Functions
-
void dporfs(const char *uplo, const INT n, const INT nrhs, const f64 *restrict A, const INT lda, const f64 *restrict AF, const INT ldaf, const f64 *restrict B, const INT ldb, f64 *restrict X, const INT ldx, f64 *restrict ferr, f64 *restrict berr, f64 *restrict work, INT *restrict iwork, INT *info)#
DPORFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, and provides error bounds and backward error estimates for the solution.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inAThe symmetric matrix A. Array of dimension (lda, n).
inldaThe leading dimension of A. lda >= max(1, n).
inAFThe triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T. Array of dimension (ldaf, n).
inldafThe leading dimension of AF. ldaf >= max(1, n).
inBThe right hand side matrix B. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1, n).
inoutXOn entry, the solution matrix X. On exit, the improved solution matrix X. Array of dimension (ldx, nrhs).
inldxThe leading dimension of X. ldx >= max(1, n).
outferrThe estimated forward error bound for each solution vector. Array of dimension (nrhs).
outberrThe componentwise relative backward error. Array of dimension (nrhs).
outworkWorkspace array of dimension (3*n).
outiworkInteger workspace array of dimension (n).
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
void dporfs(
const char* uplo,
const INT n,
const INT nrhs,
const f64* restrict A,
const INT lda,
const f64* restrict AF,
const INT ldaf,
const f64* restrict B,
const INT ldb,
f64* restrict X,
const INT ldx,
f64* restrict ferr,
f64* restrict berr,
f64* restrict work,
INT* restrict iwork,
INT* info
);
Functions
-
void cporfs(const char *uplo, const INT n, const INT nrhs, const c64 *restrict A, const INT lda, const c64 *restrict AF, const INT ldaf, const c64 *restrict B, const INT ldb, c64 *restrict X, const INT ldx, f32 *restrict ferr, f32 *restrict berr, c64 *restrict work, f32 *restrict rwork, INT *info)#
CPORFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite, and provides error bounds and backward error estimates for the solution.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inAThe Hermitian matrix A. Array of dimension (lda, n).
inldaThe leading dimension of A. lda >= max(1, n).
inAFThe triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H. Array of dimension (ldaf, n).
inldafThe leading dimension of AF. ldaf >= max(1, n).
inBThe right hand side matrix B. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1, n).
inoutXOn entry, the solution matrix X. On exit, the improved solution matrix X. Array of dimension (ldx, nrhs).
inldxThe leading dimension of X. ldx >= max(1, n).
outferrThe estimated forward error bound for each solution vector. Array of dimension (nrhs).
outberrThe componentwise relative backward error. Array of dimension (nrhs).
outworkComplex workspace array of dimension (2*n).
outrworkSingle precision workspace array of dimension (n).
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
void cporfs(
const char* uplo,
const INT n,
const INT nrhs,
const c64* restrict A,
const INT lda,
const c64* restrict AF,
const INT ldaf,
const c64* restrict B,
const INT ldb,
c64* restrict X,
const INT ldx,
f32* restrict ferr,
f32* restrict berr,
c64* restrict work,
f32* restrict rwork,
INT* info
);
Functions
-
void zporfs(const char *uplo, const INT n, const INT nrhs, const c128 *restrict A, const INT lda, const c128 *restrict AF, const INT ldaf, const c128 *restrict B, const INT ldb, c128 *restrict X, const INT ldx, f64 *restrict ferr, f64 *restrict berr, c128 *restrict work, f64 *restrict rwork, INT *info)#
ZPORFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite, and provides error bounds and backward error estimates for the solution.
Parameters
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrix A. n >= 0.
innrhsThe number of right hand sides. nrhs >= 0.
inAThe Hermitian matrix A. Array of dimension (lda, n).
inldaThe leading dimension of A. lda >= max(1, n).
inAFThe triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H. Array of dimension (ldaf, n).
inldafThe leading dimension of AF. ldaf >= max(1, n).
inBThe right hand side matrix B. Array of dimension (ldb, nrhs).
inldbThe leading dimension of B. ldb >= max(1, n).
inoutXOn entry, the solution matrix X. On exit, the improved solution matrix X. Array of dimension (ldx, nrhs).
inldxThe leading dimension of X. ldx >= max(1, n).
outferrThe estimated forward error bound for each solution vector. Array of dimension (nrhs).
outberrThe componentwise relative backward error. Array of dimension (nrhs).
outworkComplex workspace array of dimension (2*n).
outrworkDouble precision workspace array of dimension (n).
outinfo= 0: successful exit
< 0: if info = -k, the k-th argument had an illegal value
void zporfs(
const char* uplo,
const INT n,
const INT nrhs,
const c128* restrict A,
const INT lda,
const c128* restrict AF,
const INT ldaf,
const c128* restrict B,
const INT ldb,
c128* restrict X,
const INT ldx,
f64* restrict ferr,
f64* restrict berr,
c128* restrict work,
f64* restrict rwork,
INT* info
);