Integer, Intent (In)	::	n, nrhs, lda, ldaf, ldb, ldx
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Out)	::	ferr(nrhs), berr(nrhs), rwork(n)
Complex (Kind=nag_wp), Intent (In)	::	a(lda,), af(ldaf,), b(ldb,*)
Complex (Kind=nag_wp), Intent (Inout)	::	x(ldx,*)
Complex (Kind=nag_wp), Intent (Out)	::	work(2*n)
Character (1), Intent (In)	::	uplo

C Header Interface

#include <nag.h>

void

f07fvf_ (const char *uplo, const Integer *n, const Integer *nrhs, const Complex a[], const Integer *lda, const Complex af[], const Integer *ldaf, const Complex b[], const Integer *ldb, Complex x[], const Integer *ldx, double ferr[], double berr[], Complex work[], double rwork[], Integer *info, const Charlen length_uplo)

The routine may be called by the names f07fvf, nagf_lapacklin_zporfs or its LAPACK name zporfs.

3 Description

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

A X = B

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

B

) independently, so we describe the function of f07fvf 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

β

. 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 routine 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.

4 References

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

5 Arguments

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.

$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: $n$ – Integer Input

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

3: $nrhs$ – Integer Input

On entry:

r

, the number of right-hand sides.

Constraint:

nrhs \geq 0

4: $a (lda *)$ – Complex (Kind=nag_wp) array Input

Note: the second dimension of the array a must be at least

\max (1, n)

On entry: the

n

n

original Hermitian positive definite matrix

A

as supplied to f07frf.

5: $lda$ – Integer Input

On entry: the first dimension of the array a as declared in the (sub)program from which f07fvf is called.

Constraint:

lda \geq \max (1, n)

6: $af (ldaf *)$ – Complex (Kind=nag_wp) array Input

Note: the second dimension of the array af must be at least

\max (1, n)

On entry: the Cholesky factor of

A

, as returned by f07frf.

7: $ldaf$ – Integer Input

On entry: the first dimension of the array af as declared in the (sub)program from which f07fvf is called.

Constraint:

ldaf \geq \max (1, n)

8: $b (ldb *)$ – Complex (Kind=nag_wp) array Input

Note: the second dimension of the array b must be at least

\max (1, nrhs)

On entry: the

n

r

right-hand side matrix

B

9: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which f07fvf is called.

Constraint:

ldb \geq \max (1, n)

10: $x (ldx *)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array x must be at least

\max (1, nrhs)

On entry: the

n

r

solution matrix

X

, as returned by f07fsf.

On exit: the improved solution matrix

X

11: $ldx$ – Integer Input

On entry: the first dimension of the array x as declared in the (sub)program from which f07fvf is called.

Constraint:

ldx \geq \max (1, n)

12: $ferr (nrhs)$ – Real (Kind=nag_wp) array Output

On exit:

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

13: $berr (nrhs)$ – Real (Kind=nag_wp) array Output

On exit:

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

14: $work (2 \times n)$ – Complex (Kind=nag_wp) array Workspace

15: $rwork (n)$ – Real (Kind=nag_wp) array Workspace

16: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 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.

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.

8 Parallelism and Performance

f07fvf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f07fvf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

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

A x = 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 f07fhf.

10 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} 3.23 + 0.00 i & 1.51 - 1.92 i & 1.90 + 0.84 i & 0.42 + 2.50 i \\ 1.51 + 1.92 i & 3.58 + 0.00 i & - 0.23 + 1.11 i & - 1.18 + 1.37 i \\ 1.90 - 0.84 i & - 0.23 - 1.11 i & 4.09 + 0.00 i & 2.33 - 0.14 i \\ 0.42 - 2.50 i & - 1.18 - 1.37 i & 2.33 + 0.14 i & 4.29 + 0.00 i \end{array})

and

B = (\begin{array}{r} 3.93 - 6.14 i & 1.48 + 6.58 i \\ 6.17 + 9.42 i & 4.65 - 4.75 i \\ - 7.17 - 21.83 i & - 4.91 + 2.29 i \\ 1.99 - 14.38 i & 7.64 - 10.79 i \end{array}) .

Here

A

is Hermitian positive definite and must first be factorized by f07frf.

Interfaces: FL CL AD

NAG FL Interface Introduction

F07 (Lapacklin) Chapter Contents

F07 (Lapacklin) Chapter Introduction

f07fv: FL CL AD

NAG FL Interfacef07fvf (zporfs)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f07fvf (zporfs)