Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_lapack_zherfs (f07mv)

## Purpose

nag_lapack_zherfs (f07mv) returns error bounds for the solution of a complex Hermitian indefinite system of linear equations with multiple right-hand sides, AX = B$AX=B$. It improves the solution by iterative refinement, in order to reduce the backward error as much as possible.

## Syntax

[x, ferr, berr, info] = f07mv(uplo, a, af, ipiv, b, x, 'n', n, 'nrhs_p', nrhs_p)
[x, ferr, berr, info] = nag_lapack_zherfs(uplo, a, af, ipiv, b, x, 'n', n, 'nrhs_p', nrhs_p)

## Description

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

## References

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

## Parameters

### Compulsory Input Parameters

1:     uplo – string (length ≥ 1)
Specifies whether the upper or lower triangular part of A$A$ is stored and how A$A$ is to be factorized.
uplo = 'U'${\mathbf{uplo}}=\text{'U'}$
The upper triangular part of A$A$ is stored and A$A$ is factorized as PUDUHPT$PUD{U}^{\mathrm{H}}{P}^{\mathrm{T}}$, where U$U$ is upper triangular.
uplo = 'L'${\mathbf{uplo}}=\text{'L'}$
The lower triangular part of A$A$ is stored and A$A$ is factorized as PLDLHPT$PLD{L}^{\mathrm{H}}{P}^{\mathrm{T}}$, where L$L$ is lower triangular.
Constraint: uplo = 'U'${\mathbf{uplo}}=\text{'U'}$ or 'L'$\text{'L'}$.
2:     a(lda, : $:$) – complex array
The first dimension of the array a must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The second dimension of the array must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The n$n$ by n$n$ original Hermitian matrix A$A$ as supplied to nag_lapack_zhetrf (f07mr).
3:     af(ldaf, : $:$) – complex array
The first dimension of the array af must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The second dimension of the array must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
Details of the factorization of A$A$, as returned by nag_lapack_zhetrf (f07mr).
4:     ipiv( : $:$) – int64int32nag_int array
Note: the dimension of the array ipiv must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
Details of the interchanges and the block structure of D$D$, as returned by nag_lapack_zhetrf (f07mr).
5:     b(ldb, : $:$) – complex array
The first dimension of the array b must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The second dimension of the array must be at least max (1,nrhs)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nrhs}}\right)$
The n$n$ by r$r$ right-hand side matrix B$B$.
6:     x(ldx, : $:$) – complex array
The first dimension of the array x must be at least max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The second dimension of the array must be at least max (1,nrhs)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nrhs}}\right)$
The n$n$ by r$r$ solution matrix X$X$, as returned by nag_lapack_zhetrs (f07ms).

### Optional Input Parameters

1:     n – int64int32nag_int scalar
Default: The first dimension of the arrays a, af, b, x The second dimension of the arrays a, af, ipiv.
n$n$, the order of the matrix A$A$.
Constraint: n0${\mathbf{n}}\ge 0$.
2:     nrhs_p – int64int32nag_int scalar
Default: The second dimension of the arrays b, x. (An error is raised if these dimensions are not equal.)
r$r$, the number of right-hand sides.
Constraint: nrhs0${\mathbf{nrhs}}\ge 0$.

### Input Parameters Omitted from the MATLAB Interface

lda ldaf ldb ldx work rwork

### Output Parameters

1:     x(ldx, : $:$) – complex array
The first dimension of the array x will be max (1,n)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$
The second dimension of the array will be max (1,nrhs)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nrhs}}\right)$
ldxmax (1,n)$\mathit{ldx}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
The improved solution matrix X$X$.
2:     ferr(nrhs_p) – double array
ferr(j)${\mathbf{ferr}}\left(\mathit{j}\right)$ contains an estimated error bound for the j$\mathit{j}$th solution vector, that is, the j$\mathit{j}$th column of X$X$, for j = 1,2,,r$\mathit{j}=1,2,\dots ,r$.
3:     berr(nrhs_p) – double array
berr(j)${\mathbf{berr}}\left(\mathit{j}\right)$ contains the component-wise backward error bound β$\beta$ for the j$\mathit{j}$th solution vector, that is, the j$\mathit{j}$th column of X$X$, for j = 1,2,,r$\mathit{j}=1,2,\dots ,r$.
4:     info – int64int32nag_int scalar
info = 0${\mathbf{info}}=0$ unless the function detects an error (see Section [Error Indicators and Warnings]).

## Error Indicators and Warnings

info = i${\mathbf{info}}=-i$
If info = i${\mathbf{info}}=-i$, parameter i$i$ had an illegal value on entry. The parameters are numbered as follows:
1: uplo, 2: n, 3: nrhs_p, 4: a, 5: lda, 6: af, 7: ldaf, 8: ipiv, 9: b, 10: ldb, 11: x, 12: ldx, 13: ferr, 14: berr, 15: work, 16: rwork, 17: info.
It is possible that info refers to a parameter that is omitted from the MATLAB interface. This usually indicates that an error in one of the other input parameters has caused an incorrect value to be inferred.

## 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 16n2$16{n}^{2}$ real floating point operations. Each step of iterative refinement involves an additional 24n2$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$Ax=b$; the number is usually 5$5$ and never more than 11$11$. Each solution involves approximately 8n2$8{n}^{2}$ real operations.
The real analogue of this function is nag_lapack_dsyrfs (f07mh).

## Example

```function nag_lapack_zherfs_example
uplo = 'L';
a = [complex(-1.36),  0 + 0i,  0 + 0i,  0 + 0i;
1.58 - 0.9i,  -8.87 + 0i,  0 + 0i,  0 + 0i;
2.21 + 0.21i,  -1.84 + 0.03i,  -4.63 + 0i,  0 + 0i;
3.91 - 1.5i,  -1.78 - 1.18i,  0.11 - 0.11i,  -1.84 + 0i];
b = [ 7.79 + 5.48i,  -35.39 + 18.01i;
-0.77 - 16.05i,  4.23 - 70.02i;
-9.58 + 3.88i,  -24.79 - 8.4i;
2.98 - 10.18i,  28.68 - 39.89i];
% factorise a in the array af
[af, ipiv, info] = nag_lapack_zhetrf(uplo, a);

% compute solution in the array x
[x, info] = nag_lapack_zhetrs(uplo, a, ipiv, b);

% improve solution, and compute backwards errors and estimated bounds
% on the forward errors
[xOut, ferr, berr, info] = nag_lapack_zherfs(uplo, a, af, ipiv, b, x)
```
```

xOut =

1.0000 - 1.0000i   3.0000 - 4.0000i
-1.0000 + 2.0000i  -1.0000 + 5.0000i
3.0000 - 2.0000i   7.0000 - 2.0000i
2.0000 + 1.0000i  -8.0000 + 6.0000i

ferr =

1.0e-14 *

0.2385
0.2958

berr =

1.0e-16 *

0.2250
0.3453

info =

0

```
```function f07mv_example
uplo = 'L';
a = [complex(-1.36),  0 + 0i,  0 + 0i,  0 + 0i;
1.58 - 0.9i,  -8.87 + 0i,  0 + 0i,  0 + 0i;
2.21 + 0.21i,  -1.84 + 0.03i,  -4.63 + 0i,  0 + 0i;
3.91 - 1.5i,  -1.78 - 1.18i,  0.11 - 0.11i,  -1.84 + 0i];
b = [ 7.79 + 5.48i,  -35.39 + 18.01i;
-0.77 - 16.05i,  4.23 - 70.02i;
-9.58 + 3.88i,  -24.79 - 8.4i;
2.98 - 10.18i,  28.68 - 39.89i];
% factorise a in the array af
[af, ipiv, info] = f07mr(uplo, a);

% compute solution in the array x
[x, info] = f07ms(uplo, a, ipiv, b);

% improve solution, and compute backwards errors and estimated bounds
% on the forward errors
[xOut, ferr, berr, info] = f07mv(uplo, a, af, ipiv, b, x)
```
```

xOut =

1.0000 - 1.0000i   3.0000 - 4.0000i
-1.0000 + 2.0000i  -1.0000 + 5.0000i
3.0000 - 2.0000i   7.0000 - 2.0000i
2.0000 + 1.0000i  -8.0000 + 6.0000i

ferr =

1.0e-14 *

0.2385
0.2958

berr =

1.0e-16 *

0.2250
0.3453

info =

0

```