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.inAArray of dimension (
lda,n). The symmetric matrix A. Ifuplo='U', the leadingn-by-nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. Ifuplo='L', the leadingn-by-nlower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.inldaThe leading dimension of the array
A.lda>=max(1,n).inAFArray of dimension (
ldaf,n). The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T, as computed byspotrf.inldafThe leading dimension of the array
AF.ldaf>=max(1,n).inBArray of dimension (
ldb,nrhs). The right hand side matrixB.inldbThe leading dimension of the array
B.ldb>=max(1,n).inoutXArray of dimension (
ldx,nrhs). On entry, the solution matrix X, as computed byspotrs. On exit, the improved solution matrix X.inldxThe leading dimension of the array
X.ldx>=max(1,n).outferrArray of dimension (
nrhs). The estimated forward error bound for each solution vector.outberrArray of dimension (
nrhs). The componentwise relative backward error of each solution vector.outworkArray of dimension
3*n.outiworkArray of dimension
n.outinfoinfo=0: successful exitinfo<0: ifinfo=-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.inAArray of dimension (
lda,n). The symmetric matrix A. Ifuplo='U', the leadingn-by-nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. Ifuplo='L', the leadingn-by-nlower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.inldaThe leading dimension of the array
A.lda>=max(1,n).inAFArray of dimension (
ldaf,n). The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T, as computed bydpotrf.inldafThe leading dimension of the array
AF.ldaf>=max(1,n).inBArray of dimension (
ldb,nrhs). The right hand side matrixB.inldbThe leading dimension of the array
B.ldb>=max(1,n).inoutXArray of dimension (
ldx,nrhs). On entry, the solution matrix X, as computed bydpotrs. On exit, the improved solution matrix X.inldxThe leading dimension of the array
X.ldx>=max(1,n).outferrArray of dimension (
nrhs). The estimated forward error bound for each solution vector.outberrArray of dimension (
nrhs). The componentwise relative backward error of each solution vector.outworkArray of dimension
3*n.outiworkArray of dimension
n.outinfoinfo=0: successful exitinfo<0: ifinfo=-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.inAArray of dimension (
lda,n). The Hermitian matrix A. Ifuplo='U', the leadingn-by-nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. Ifuplo='L', the leadingn-by-nlower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.inldaThe leading dimension of the array
A.lda>=max(1,n).inAFArray of dimension (
ldaf,n). The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, as computed bycpotrf.inldafThe leading dimension of the array
AF.ldaf>=max(1,n).inBArray of dimension (
ldb,nrhs). The right hand side matrixB.inldbThe leading dimension of the array
B.ldb>=max(1,n).inoutXArray of dimension (
ldx,nrhs). On entry, the solution matrix X, as computed bycpotrs. On exit, the improved solution matrix X.inldxThe leading dimension of the array
X.ldx>=max(1,n).outferrArray of dimension (
nrhs). The estimated forward error bound for each solution vector.outberrArray of dimension (
nrhs). The componentwise relative backward error of each solution vector.outworkComplex array of dimension
2*n.outrworkArray of dimension
n.outinfoinfo=0: successful exitinfo<0: ifinfo=-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.inAArray of dimension (
lda,n). The Hermitian matrix A. Ifuplo='U', the leadingn-by-nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. Ifuplo='L', the leadingn-by-nlower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.inldaThe leading dimension of the array
A.lda>=max(1,n).inAFArray of dimension (
ldaf,n). The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H, as computed byzpotrf.inldafThe leading dimension of the array
AF.ldaf>=max(1,n).inBArray of dimension (
ldb,nrhs). The right hand side matrixB.inldbThe leading dimension of the array
B.ldb>=max(1,n).inoutXArray of dimension (
ldx,nrhs). On entry, the solution matrix X, as computed byzpotrs. On exit, the improved solution matrix X.inldxThe leading dimension of the array
X.ldx>=max(1,n).outferrArray of dimension (
nrhs). The estimated forward error bound for each solution vector.outberrArray of dimension (
nrhs). The componentwise relative backward error of each solution vector.outworkComplex array of dimension
2*n.outrworkArray of dimension
n.outinfoinfo=0: successful exitinfo<0: ifinfo=-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
);