nag_lapack_zpbrfs (f07hv) returns error bounds for the solution of a complex Hermitian positive definite band system of linear equations with multiple right-hand sides,

A X = B

. It improves the solution by iterative refinement, in order to reduce the backward error as much as possible.

Syntax

[x, ferr, berr, info] = f07hv(uplo, kd, ab, afb, b, x, 'n', n, 'nrhs_p', nrhs_p)

[x, ferr, berr, info] = nag_lapack_zpbrfs(uplo, kd, ab, afb, b, x, 'n', n, 'nrhs_p', nrhs_p)

Description

nag_lapack_zpbrfs (f07hv) returns the backward errors and estimated bounds on the forward errors for the solution of a complex Hermitian positive definite band system of linear equations with multiple right-hand sides

A X = B

. The function handles each right-hand side vector (stored as a column of the matrix

B

) independently, so we describe the function of nag_lapack_zpbrfs (f07hv) in terms of a single right-hand side

b

and solution

x

Given a computed solution

x

, the function computes the component-wise backward error

β

. 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

\begin{matrix} (A + δ A) x = b + δ b \\ |δ a_{i j}| \leq β |a_{i j}| and |δ b_{i}| \leq β |b_{i}| . \end{matrix}

Then the function estimates a bound for the component-wise forward error in the computed solution, defined by:

\max_{i} |x_{i} - {\hat{x}}_{i}| / \max_{i} |x_{i}|

where

\hat{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

is stored and how

A

is to be factorized.

$uplo ='U'$: The upper triangular part of $A$ is stored and $A$ is factorized as $U^{H} U$ , where $U$ is upper triangular.
$uplo ='L'$: The lower triangular part of $A$ is stored and $A$ is factorized as $L L^{H}$ , where $L$ is lower triangular.

Constraint:

uplo ='U'

'L'

2: $kd$ – int64int32nag_int scalar

k_{d}

, the number of superdiagonals or subdiagonals of the matrix

A

Constraint:

kd \geq 0

3: $ab (ldab :)$ – complex array

The first dimension of the array ab must be at least

kd + 1

The second dimension of the array ab must be at least

\max (1, n)

The

n

n

original Hermitian positive definite band matrix

A

as supplied to nag_lapack_zpbtrf (f07hr).

4: $afb (ldafb :)$ – complex array

The first dimension of the array afb must be at least

kd + 1

The second dimension of the array afb must be at least

\max (1, n)

The Cholesky factor of

A

, as returned by nag_lapack_zpbtrf (f07hr).

5: $b (ldb :)$ – complex array

The first dimension of the array b must be at least

\max (1, n)

The second dimension of the array b must be at least

\max (1, nrhs_p)

The

n

r

right-hand side matrix

B

6: $x (ldx :)$ – complex array

The first dimension of the array x must be at least

\max (1, n)

The second dimension of the array x must be at least

\max (1, nrhs_p)

The

n

r

solution matrix

X

, as returned by nag_lapack_zpbtrs (f07hs).

Optional Input Parameters

1: $n$ – int64int32nag_int scalar: Default: the second dimension of the array ab.
$n$ , the order of the matrix $A$ .

Constraint: $n \geq 0$ .
2: $nrhs_p$ – int64int32nag_int scalar: Default: the second dimension of the arrays b, x.
$r$ , the number of right-hand sides.

Constraint: $nrhs_p \geq 0$ .

Output Parameters

1: $x (ldx :)$ – complex array: The first dimension of the array x will be $\max (1, n)$ .
The second dimension of the array x will be $\max (1, nrhs_p)$ .

The improved solution matrix $X$ .
2: $ferr (nrhs_p)$ – double array: $ferr (j)$ contains an estimated error bound for the $j$ th solution vector, that is, the $j$ th column of $X$ , for $j = 1, 2, \dots, r$ .
3: $berr (nrhs_p)$ – double array: $berr (j)$ contains the component-wise backward error bound $β$ for the $j$ th solution vector, that is, the $j$ th column of $X$ , for $j = 1, 2, \dots, r$ .
4: $info$ – int64int32nag_int scalar: $info = 0$ unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

$info < 0$: If $info = - i$ , argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

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.

Further Comments

For each right-hand side, computation of the backward error involves a minimum of

32 n k

real floating-point operations. Each step of iterative refinement involves an additional

48 n k

real operations. This assumes

n ≫ k

. 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

A x = b

; the number is usually

5

and never more than

11

. Each solution involves approximately

16 n k

real operations.

The real analogue of this function is nag_lapack_dpbrfs (f07hh).

Example

This example solves the system of equations

A X = B

using iterative refinement and to compute the forward and backward error bounds, where

A = (\begin{array}{r} 9.39 + 0.00 i & 1.08 - 1.73 i & 0.00 + 0.00 i & 0.00 + 0.00 i \\ 1.08 + 1.73 i & 1.69 + 0.00 i & - 0.04 + 0.29 i & 0.00 + 0.00 i \\ 0.00 + 0.00 i & - 0.04 - 0.29 i & 2.65 + 0.00 i & - 0.33 + 2.24 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & - 0.33 - 2.24 i & 2.17 + 0.00 i \end{array})

and

B = (\begin{array}{r} - 12.42 + 68.42 i & 54.30 - 56.56 i \\ - 9.93 + 0.88 i & 18.32 + 4.76 i \\ - 27.30 - 0.01 i & - 4.40 + 9.97 i \\ 5.31 + 23.63 i & 9.43 + 1.41 i \end{array}) .

Here

A

is Hermitian positive definite, and is treated as a band matrix, which must first be factorized by nag_lapack_zpbtrf (f07hr).

Open in the MATLAB editor: f07hv_example

function f07hv_example


fprintf('f07hv example results\n\n');

% A in Hermitian banded format
uplo = 'L';
kd = int64(1);
n  = int64(4);
ab = [ 9.39 + 0i,     1.69 + 0i,      2.65 + 0i,      2.17 + 0i;
       1.08 + 1.73i, -0.04 - 0.29i,  -0.33 - 2.24i    0    + 0i];

% RHS
b = [-12.42 + 68.42i,  54.30 - 56.56i;
      -9.93 +  0.88i,  18.32 +  4.76i;
     -27.30 -  0.01i,  -4.40 +  9.97i;
       5.31 + 23.63i,   9.43 +  1.41i];

% Factorize
[abf, info] = f07hr( ...
                     uplo, kd, ab);

% Solve
[x, info] = f07hs( ...
                   uplo, kd, abf, b);

% Iterative refinement
[x, ferr, berr, info] = f07hv( ...
                               uplo, kd, ab, abf, b, x);
disp('Solution(s)');
disp(x);
fprintf('Forward  error bounds = %10.1e  %10.1e\n',ferr); 
fprintf('Backward error bounds = %10.1e  %10.1e\n',berr);

f07hv example results

Solution(s)
  -1.0000 + 8.0000i   5.0000 - 6.0000i
   2.0000 - 3.0000i   2.0000 + 3.0000i
  -4.0000 - 5.0000i  -8.0000 + 4.0000i
   7.0000 + 6.0000i  -1.0000 - 7.0000i

Forward  error bounds =    3.7e-14     3.1e-14
Backward error bounds =    1.0e-16     6.7e-17

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox