Integer, Intent (In)	::	n, nrhs, ipiv(*), ldb
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (In)	::	ap(*)
Complex (Kind=nag_wp), Intent (Inout)	::	b(ldb,*)
Character (1), Intent (In)	::	uplo

C Header Interface

#include <nag.h>

void	f07psf_ (const char uplo, const Integer n, const Integer nrhs, const Complex ap[], const Integer ipiv[], Complex b[], const Integer ldb, Integer *info, const Charlen length_uplo)

The routine may be called by the names f07psf, nagf_lapacklin_zhptrs or its LAPACK name zhptrs.

3 Description

f07psf is used to solve a complex Hermitian indefinite system of linear equations

A X = B

, the routine must be preceded by a call to f07prf which computes the Bunch–Kaufman factorization of

A

, using packed storage.

uplo ='U'

A = P U D U^{H} P^{T}

, where

P

is a permutation matrix,

U

is an upper triangular matrix and

D

is an Hermitian block diagonal matrix with

1

1

and

2

2

blocks; the solution

X

is computed by solving

P U D Y = B

and then

U^{H} P^{T} X = Y

uplo ='L'

A = P L D L^{H} P^{T}

, where

L

is a lower triangular matrix; the solution

X

is computed by solving

P L D Y = B

and then

L^{H} P^{T} X = Y

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 how

A

has been factorized.

$uplo ='U'$: $A = P U D U^{H} P^{T}$ , where $U$ is upper triangular.
$uplo ='L'$: $A = P L D L^{H} P^{T}$ , 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: $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 factorization of

A

stored in packed form, as returned by f07prf.

5: $ipiv (*)$ – Integer array Input

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

\max (1, n)

On entry: details of the interchanges and the block structure of

D

, as returned by f07prf.

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

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

On exit: the

n

r

solution matrix

X

7: $ldb$ – Integer Input

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

Constraint:

ldb \geq \max (1, n)

8: $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

For each right-hand side vector

b

, the computed solution

x

is the exact solution of a perturbed system of equations

(A + E) x = b

, where

if $uplo ='U'$ , $|E| \leq c (n) ε P |U| |D| |U^{H}| P^{T}$ ;
if $uplo ='L'$ , $|E| \leq c (n) ε P |L| |D| |L^{H}| P^{T}$ ,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

\hat{x}

is the true solution, then the computed solution

x

satisfies a forward error bound of the form

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

where

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

Note that

cond (A, x)

can be much smaller than

cond (A)

Forward and backward error bounds can be computed by calling f07pvf, and an estimate for

κ_{\infty} (A)

(

= κ_{1} (A)

) can be obtained by calling f07puf.

8 Parallelism and Performance

f07psf 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 total number of real floating-point operations is approximately

8 n^{2} r

This routine may be followed by a call to f07pvf to refine the solution and return an error estimate.

The real analogue of this routine is f07pef.

10 Example

This example solves the system of equations

A X = B

, where

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

and

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

Here

A

is Hermitian indefinite, stored in packed form, and must first be factorized by f07prf.

Interfaces: FL CL AD

NAG FL Interface Introduction

F07 (Lapacklin) Chapter Contents

F07 (Lapacklin) Chapter Introduction

f07ps: FL CL AD

NAG FL Interfacef07psf (zhptrs)

▸▿ 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
f07psf (zhptrs)