F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF07QVF (ZSPRFS)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F07QVF (ZSPRFS) returns error bounds for the solution of a complex symmetric system of linear equations with multiple right-hand sides, $AX=B$, using packed storage. It improves the solution by iterative refinement, in order to reduce the backward error as much as possible.

## 2  Specification

 SUBROUTINE F07QVF ( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)
 INTEGER N, NRHS, IPIV(*), LDB, LDX, INFO REAL (KIND=nag_wp) FERR(NRHS), BERR(NRHS), RWORK(N) COMPLEX (KIND=nag_wp) AP(*), AFP(*), B(LDB,*), X(LDX,*), WORK(2*N) CHARACTER(1) UPLO
The routine may be called by its LAPACK name zsprfs.

## 3  Description

F07QVF (ZSPRFS) returns the backward errors and estimated bounds on the forward errors for the solution of a complex symmetric system of linear equations with multiple right-hand sides $AX=B$, using packed storage. The routine handles each right-hand side vector (stored as a column of the matrix $B$) independently, so we describe the function of F07QVF (ZSPRFS) in terms of a single right-hand side $b$ and solution $x$.
Given a computed solution $x$, the routine computes the component-wise backward error $\beta$. This is the size of the smallest relative perturbation in each element of $A$ and $b$ such that $x$ is the exact solution of a perturbed system
 $A+δAx=b+δb δaij≤βaij and δbi≤βbi .$
Then the routine estimates a bound for the component-wise forward error in the computed solution, defined by:
 $maxixi-x^i/maxixi$
where $\stackrel{^}{x}$ is the true solution.
For details of the method, see the F07 Chapter Introduction.

## 4  References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

## 5  Parameters

1:     UPLO – CHARACTER(1)Input
On entry: specifies whether the upper or lower triangular part of $A$ is stored and how $A$ is to be factorized.
${\mathbf{UPLO}}=\text{'U'}$
The upper triangular part of $A$ is stored and $A$ is factorized as $PUD{U}^{\mathrm{T}}{P}^{\mathrm{T}}$, where $U$ is upper triangular.
${\mathbf{UPLO}}=\text{'L'}$
The lower triangular part of $A$ is stored and $A$ is factorized as $PLD{L}^{\mathrm{T}}{P}^{\mathrm{T}}$, where $L$ is lower triangular.
Constraint: ${\mathbf{UPLO}}=\text{'U'}$ or $\text{'L'}$.
2:     N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     NRHS – INTEGERInput
On entry: $r$, the number of right-hand sides.
Constraint: ${\mathbf{NRHS}}\ge 0$.
4:     AP($*$) – COMPLEX (KIND=nag_wp) arrayInput
Note: the dimension of the array AP must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}×\left({\mathbf{N}}+1\right)/2\right)$.
On entry: the $n$ by $n$ original symmetric matrix $A$ as supplied to F07QRF (ZSPTRF).
5:     AFP($*$) – COMPLEX (KIND=nag_wp) arrayInput
Note: the dimension of the array AFP must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}×\left({\mathbf{N}}+1\right)/2\right)$.
On entry: the factorization of $A$ stored in packed form, as returned by F07QRF (ZSPTRF).
6:     IPIV($*$) – INTEGER arrayInput
Note: the dimension of the array IPIV must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: details of the interchanges and the block structure of $D$, as returned by F07QRF (ZSPTRF).
7:     B(LDB,$*$) – COMPLEX (KIND=nag_wp) arrayInput
Note: the second dimension of the array B must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{NRHS}}\right)$.
On entry: the $n$ by $r$ right-hand side matrix $B$.
8:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F07QVF (ZSPRFS) is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
9:     X(LDX,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array X must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{NRHS}}\right)$.
On entry: the $n$ by $r$ solution matrix $X$, as returned by F07QSF (ZSPTRS).
On exit: the improved solution matrix $X$.
10:   LDX – INTEGERInput
On entry: the first dimension of the array X as declared in the (sub)program from which F07QVF (ZSPRFS) is called.
Constraint: ${\mathbf{LDX}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
11:   FERR(NRHS) – REAL (KIND=nag_wp) arrayOutput
On exit: ${\mathbf{FERR}}\left(\mathit{j}\right)$ contains an estimated error bound for the $\mathit{j}$th solution vector, that is, the $\mathit{j}$th column of $X$, for $\mathit{j}=1,2,\dots ,r$.
12:   BERR(NRHS) – REAL (KIND=nag_wp) arrayOutput
On exit: ${\mathbf{BERR}}\left(\mathit{j}\right)$ contains the component-wise backward error bound $\beta$ for the $\mathit{j}$th solution vector, that is, the $\mathit{j}$th column of $X$, for $\mathit{j}=1,2,\dots ,r$.
13:   WORK($2×{\mathbf{N}}$) – COMPLEX (KIND=nag_wp) arrayWorkspace
14:   RWORK(N) – REAL (KIND=nag_wp) arrayWorkspace
15:   INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, the $i$th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.

## 7  Accuracy

The bounds returned in FERR are not rigorous, because they are estimated, not computed exactly; but in practice they almost always overestimate the actual error.

For each right-hand side, computation of the backward error involves a minimum of $16{n}^{2}$ real floating point operations. Each step of iterative refinement involves an additional $24{n}^{2}$ real operations. At most five steps of iterative refinement are performed, but usually only one or two steps are required.
Estimating the forward error involves solving a number of systems of linear equations of the form $Ax=b$; the number is usually $5$ and never more than $11$. Each solution involves approximately $8{n}^{2}$ real operations.
The real analogue of this routine is F07PHF (DSPRFS).

## 9  Example

This example solves the system of equations $AX=B$ using iterative refinement and to compute the forward and backward error bounds, where
 $A= -0.39-0.71i 5.14-0.64i -7.86-2.96i 3.80+0.92i 5.14-0.64i 8.86+1.81i -3.52+0.58i 5.32-1.59i -7.86-2.96i -3.52+0.58i -2.83-0.03i -1.54-2.86i 3.80+0.92i 5.32-1.59i -1.54-2.86i -0.56+0.12i$
and
 $B= -55.64+41.22i -19.09-35.97i -48.18+66.00i -12.08-27.02i -0.49-01.47i 6.95+20.49i -6.43+19.24i -4.59-35.53i .$
Here $A$ is symmetric, stored in packed form, and must first be factorized by F07QRF (ZSPTRF).

### 9.1  Program Text

Program Text (f07qvfe.f90)

### 9.2  Program Data

Program Data (f07qvfe.d)

### 9.3  Program Results

Program Results (f07qvfe.r)