Integer, Intent (In)	::	n, lda, ipiv(*)
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,*)
Complex (Kind=nag_wp), Intent (Out)	::	work(2*n)
Character (1), Intent (In)	::	uplo

C Header Interface

#include <nag.h>

void	f07nwf_ (const char uplo, const Integer n, Complex a[], const Integer lda, const Integer ipiv[], Complex work[], Integer info, const Charlen length_uplo)

The routine may be called by the names f07nwf, nagf_lapacklin_zsytri or its LAPACK name zsytri.

3 Description

f07nwf is used to compute the inverse of a complex symmetric matrix

A

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

A

uplo ='U'

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

and

A^{- 1}

is computed by solving

U^{T} P^{T} X P U = D^{- 1}

for

X

uplo ='L'

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

and

A^{- 1}

is computed by solving

L^{T} P^{T} X P L = D^{- 1}

for

X

4 References

Du Croz J J and Higham N J (1992) Stability of methods for matrix inversion IMA J. Numer. Anal. 12 1–19

5 Arguments

1: $uplo$ – Character(1) Input

On entry: specifies how

A

has been factorized.

$uplo ='U'$: $A = P U D U^{T} P^{T}$ , where $U$ is upper triangular.
$uplo ='L'$: $A = P L D L^{T} 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: $a (lda *)$ – Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

On entry: details of the factorization of

A

, as returned by f07nrf.

On exit: the factorization is overwritten by the

n

n

symmetric matrix

A^{- 1}

uplo ='U'

, the upper triangle of

A^{- 1}

is stored in the upper triangular part of the array.

uplo ='L'

, the lower triangle of

A^{- 1}

is stored in the lower triangular part of the array.

4: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, n)

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

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

7: $info$ – Integer Output

On exit:

info = 0

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

6 Error Indicators and Warnings

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

$info = - 999$: Dynamic memory allocation failed.

See Section 9 in the Introduction to the NAG Library FL Interface for further information.
An explanatory message is output, and execution of the program is terminated.

$info > 0$: Element $〈value〉$ of the diagonal is exactly zero. $D$ is singular and the inverse of $A$ cannot be computed.

7 Accuracy

The computed inverse

X

satisfies a bound of the form

if $uplo ='U'$ , $|D U^{T} P^{T} X P U - I| \leq c (n) ε (|D| |U^{T}| P^{T} |X| P |U| + |D| |D^{- 1}|)$ ;
if $uplo ='L'$ , $|D L^{T} P^{T} X P L - I| \leq c (n) ε (|D| |L^{T}| P^{T} |X| P |L| + |D| |D^{- 1}|)$ ,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

8 Parallelism and Performance

f07nwf 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

\frac{8}{3} n^{3}

The real analogue of this routine is f07mjf.

10 Example

This example computes the inverse of the matrix

A

, where

A = (\begin{array}{r} - 0.39 - 0.71 i & 5.14 - 0.64 i & - 7.86 - 2.96 i & 3.80 + 0.92 i \\ 5.14 - 0.64 i & 8.86 + 1.81 i & - 3.52 + 0.58 i & 5.32 - 1.59 i \\ - 7.86 - 2.96 i & - 3.52 + 0.58 i & - 2.83 - 0.03 i & - 1.54 - 2.86 i \\ 3.80 + 0.92 i & 5.32 - 1.59 i & - 1.54 - 2.86 i & - 0.56 + 0.12 i \end{array}) .

Here

A

is symmetric and must first be factorized by f07nrf.

Interfaces: FL CL AD

NAG FL Interface Introduction

F07 (Lapacklin) Chapter Contents

F07 (Lapacklin) Chapter Introduction

f07nw: FL CL AD

NAG FL Interfacef07nwf (zsytri)

▸▿ 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
f07nwf (zsytri)