Integer, Intent (In)	::	n, nrhs, ldb, ldx
Integer, Intent (Inout)	::	ipiv(n)
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Out)	::	rcond, ferr(nrhs), berr(nrhs), rwork(n)
Complex (Kind=nag_wp), Intent (In)	::	ap(), b(ldb,)
Complex (Kind=nag_wp), Intent (Inout)	::	afp(), x(ldx,)
Complex (Kind=nag_wp), Intent (Out)	::	work(2*n)
Character (1), Intent (In)	::	fact, uplo

C Header Interface

#include <nag.h>

void

f07ppf_ (const char *fact, const char *uplo, const Integer *n, const Integer *nrhs, const Complex ap[], Complex afp[], Integer ipiv[], const Complex b[], const Integer *ldb, Complex x[], const Integer *ldx, double *rcond, double ferr[], double berr[], Complex work[], double rwork[], Integer *info, const Charlen length_fact, const Charlen length_uplo)

The routine may be called by the names f07ppf, nagf_lapacklin_zhpsvx or its LAPACK name zhpsvx.

3 Description

f07ppf performs the following steps:

1.If $fact ='N'$ , the diagonal pivoting method is used to factor $A$ as $A = U D U^{H}$ if $uplo ='U'$ or $A = L D L^{H}$ if $uplo ='L'$ , where $U$ (or $L$ ) is a product of permutation and unit upper (lower) triangular matrices and $D$ is Hermitian and block diagonal with $1$ by $1$ and $2$ by $2$ diagonal blocks.
2.If some $d_{i i} = 0$ , so that $D$ is exactly singular, then the routine returns with $info = i$ . Otherwise, the factored form of $A$ is used to estimate the condition number of the matrix $A$ . If the reciprocal of the condition number is less than machine precision, $info = n + 1$ is returned as a warning, but the routine still goes on to solve for $X$ and compute error bounds as described below.
3.The system of equations is solved for $X$ using the factored form of $A$ .
4.Iterative refinement is applied to improve the computed solution matrix and to calculate error bounds and backward error estimates for it.

4 References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia https://www.netlib.org/lapack/lug

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

Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

5 Arguments

1: $fact$ – Character(1) Input

On entry: specifies whether or not the factorized form of the matrix

A

has been supplied.

$fact ='F'$: afp and ipiv contain the factorized form of the matrix $A$ . afp and ipiv will not be modified.
$fact ='N'$: The matrix $A$ will be copied to afp and factorized.

Constraint:

fact ='F'

'N'

2: $uplo$ – Character(1) Input

On entry: if

uplo ='U'

, the upper triangle of

A

is stored.

uplo ='L'

, the lower triangle of

A

is stored.

Constraint:

uplo ='U'

'L'

3: $n$ – Integer Input

On entry:

n

, the number of linear equations, i.e., the order of the matrix

A

Constraint:

n \geq 0

4: $nrhs$ – Integer Input

On entry:

r

, the number of right-hand sides, i.e., the number of columns of the matrix

B

Constraint:

nrhs \geq 0

5: $ap (*)$ – Complex (Kind=nag_wp) array Input

Note: the dimension of the array ap must be at least

\max (1, n \times (n + 1) / 2)

On entry: the

n

n

Hermitian matrix

A

, packed by columns.

More precisely,

if $uplo ='U'$ , the upper triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + j (j - 1) / 2)$ for $i \leq j$ ;
if $uplo ='L'$ , the lower triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + (2 n - j) (j - 1) / 2)$ for $i \geq j$ .

6: $afp (*)$ – Complex (Kind=nag_wp) array Input/Output

Note: the dimension of the array afp must be at least

\max (1, n \times (n + 1) / 2)

On entry: if

fact ='F'

, afp contains the block diagonal matrix

D

and the multipliers used to obtain the factor

U

L

from the factorization

A = U D U^{H}

A = L D L^{H}

as computed by f07prf, stored as a packed triangular matrix in the same storage format as

A

On exit: if

fact ='N'

, afp contains the block diagonal matrix

D

and the multipliers used to obtain the factor

U

L

from the factorization

A = U D U^{H}

A = L D L^{H}

as computed by f07prf, stored as a packed triangular matrix in the same storage format as

A

7: $ipiv (n)$ – Integer array Input/Output

On entry: if

fact ='F'

, ipiv contains details of the interchanges and the block structure of

D

, as determined by f07prf.

if $ipiv (i) = k > 0$ , $d_{i i}$ is a $1$ by $1$ pivot block and the $i$ th row and column of $A$ were interchanged with the $k$ th row and column;
if $uplo ='U'$ and $ipiv (i - 1) = ipiv (i) = - l < 0$ , $(\begin{matrix} d_{i - 1, i - 1} & {\bar{d}}_{i, i - 1} \\ {\bar{d}}_{i, i - 1} & d_{i i} \end{matrix})$ is a $2$ by $2$ pivot block and the $(i - 1)$ th row and column of $A$ were interchanged with the $l$ th row and column;
if $uplo ='L'$ and $ipiv (i) = ipiv (i + 1) = - m < 0$ , $(\begin{matrix} d_{i i} & d_{i + 1, i} \\ d_{i + 1, i} & d_{i + 1, i + 1} \end{matrix})$ is a $2$ by $2$ pivot block and the $(i + 1)$ th row and column of $A$ were interchanged with the $m$ th row and column.

On exit: if

fact ='N'

, ipiv contains details of the interchanges and the block structure of

D

, as determined by f07prf, as described above.

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 f07ppf is called.

Constraint:

ldb \geq \max (1, n)

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

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

\max (1, nrhs)

On exit: if

info = 0

n + 1

, the

n

r

solution matrix

X

11: $ldx$ – Integer Input

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

Constraint:

ldx \geq \max (1, n)

12: $rcond$ – Real (Kind=nag_wp) Output

On exit: the estimate of the reciprocal condition number of the matrix

A

. If

rcond = 0.0

, the matrix may be exactly singular. This condition is indicated by

info > 0 and info \leq n

. Otherwise, if rcond is less than the machine precision, the matrix is singular to working precision. This condition is indicated by

info = n + 1

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

On exit: if

info = 0

n + 1

, an estimate of the forward error bound for each computed solution vector, such that

{‖{\hat{x}}_{j} - x_{j}‖}_{\infty} / {‖x_{j}‖}_{\infty} \leq ferr (j)

where

{\hat{x}}_{j}

is the

j

th column of the computed solution returned in the array x and

x_{j}

is the corresponding column of the exact solution

X

. The estimate is as reliable as the estimate for rcond, and is almost always a slight overestimate of the true error.

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

On exit: if

info = 0

n + 1

, an estimate of the component-wise relative backward error of each computed solution vector

{\hat{x}}_{j}

(i.e., the smallest relative change in any element of

A

B

that makes

{\hat{x}}_{j}

an exact solution).

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

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

17: $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.

$info > 0 and info \leq n$: Element $〈value〉$ of the diagonal is exactly zero. The factorization has been completed, but the factor $D$ is exactly singular, so the solution and error bounds could not be computed. $rcond = 0.0$ is returned.

$info = n + 1$: $D$ is nonsingular, but rcond is less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value of rcond would suggest.

7 Accuracy

For each right-hand side vector

b

, the computed solution

\hat{x}

is the exact solution of a perturbed system of equations

(A + E) \hat{x} = b

, where

{‖E‖}_{1} = O (ε) {‖A‖}_{1},

where

ε

is the machine precision. See Chapter 11 of Higham (2002) for further details.

\hat{x}

is the true solution, then the computed solution

x

satisfies a forward error bound of the form

\frac{{‖x - \hat{x}‖}_{\infty}}{{‖\hat{x}‖}_{\infty}} \leq w_{c} cond (A, \hat{x}, b)

where

cond (A, \hat{x}, b) = {‖|A^{- 1}| (|A| |\hat{x}| + |b|)‖}_{\infty} / {‖\hat{x}‖}_{\infty} \leq cond (A) = {‖|A^{- 1}| |A|‖}_{\infty} \leq κ_{\infty} (A)

. If

\hat{x}

is the

j

th column of

X

, then

w_{c}

is returned in

berr (j)

and a bound on

{‖x - \hat{x}‖}_{\infty} / {‖\hat{x}‖}_{\infty}

is returned in

ferr (j)

. See Section 4.4 of Anderson et al. (1999) for further details.

8 Parallelism and Performance

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

f07ppf 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

The factorization of

A

requires approximately

\frac{4}{3} n^{3}

floating-point operations.

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

16 n^{2}

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

24 n^{2}

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 equations of the form

A x = b

; the number is usually

4

5

and never more than

11

. Each solution involves approximately

8 n^{2}

operations.

The real analogue of this routine is f07pbf. The complex symmetric analogue of this routine is f07qpf.

10 Example

This example solves the equations

A X = B,

where

A

is the Hermitian matrix

A = (\begin{array}{r} - 1.84 & 0.11 - 0.11 i & - 1.78 - 1.18 i & 3.91 - 1.50 i \\ 0.11 + 0.11 i & - 4.63 & - 1.84 + 0.03 i & 2.21 + 0.21 i \\ - 1.78 + 1.18 i & - 1.84 - 0.03 i & - 8.87 & 1.58 - 0.90 i \\ 3.91 + 1.50 i & 2.21 - 0.21 i & 1.58 + 0.90 i & - 1.36 \end{array})

and

B = (\begin{array}{r} 2.98 - 10.18 i & 28.68 - 39.89 i \\ - 9.58 + 3.88 i & - 24.79 - 8.40 i \\ - 0.77 - 16.05 i & 4.23 - 70.02 i \\ 7.79 + 5.48 i & - 35.39 + 18.01 i \end{array}) .

Error estimates for the solutions, and an estimate of the reciprocal of the condition number of the matrix

A

are also output.

Interfaces: FL CL AD

NAG FL Interface Introduction

F07 (Lapacklin) Chapter Contents

F07 (Lapacklin) Chapter Introduction

f07pp: FL CL AD

NAG FL Interfacef07ppf (zhpsvx)

▸▿ 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
f07ppf (zhpsvx)