Developer Reference

  • 2020.2
  • 07/15/2020
  • Public Content
Contents

?sprfs

Refines the solution of a system of linear equations with a packed symmetric coefficient matrix and estimates the solution error.

Syntax

call ssprfs
(
uplo
,
n
,
nrhs
,
ap
,
afp
,
ipiv
,
b
,
ldb
,
x
,
ldx
,
ferr
,
berr
,
work
,
iwork
,
info
)
call dsprfs
(
uplo
,
n
,
nrhs
,
ap
,
afp
,
ipiv
,
b
,
ldb
,
x
,
ldx
,
ferr
,
berr
,
work
,
iwork
,
info
)
call csprfs
(
uplo
,
n
,
nrhs
,
ap
,
afp
,
ipiv
,
b
,
ldb
,
x
,
ldx
,
ferr
,
berr
,
work
,
rwork
,
info
)
call zsprfs
(
uplo
,
n
,
nrhs
,
ap
,
afp
,
ipiv
,
b
,
ldb
,
x
,
ldx
,
ferr
,
berr
,
work
,
rwork
,
info
)
call sprfs
(
ap
,
afp
,
ipiv
,
b
,
x
[
,
uplo
]
[
,
ferr
]
[
,
berr
]
[
,
info
]
)
Include Files
  • mkl.fi
    ,
    lapack.f90
Description
The routine performs an iterative refinement of the solution to a system of linear equations
A*X
=
B
with a packed symmetric matrix
A
, with multiple right-hand sides. For each computed solution vector
x
, the routine computes the component-wise backward error
β
. This error is the smallest relative perturbation in elements of
A
and
b
such that
x
is the exact solution of the perturbed system:
|
δ
a
i
j
|
β
|
a
i
j
|, |
δ
b
i
|
β
|
b
i
|