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

C Header Interface

#include <nag.h>

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

The routine may be called by the names f07nrf, nagf_lapacklin_zsytrf or its LAPACK name zsytrf.

3 Description

f07nrf factorizes a complex symmetric matrix

A

, using the Bunch–Kaufman diagonal pivoting method.

A

is factorized as either

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

uplo ='U'

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

uplo ='L'

, where

P

is a permutation matrix,

U

(or

L

) is a unit upper (or lower) triangular matrix and

D

is a symmetric block diagonal matrix with

1 \times 1

and

2 \times 2

diagonal blocks;

U

(or

L

) has

2 \times 2

unit diagonal blocks corresponding to the

2 \times 2

blocks of

D

. Row and column interchanges are performed to ensure numerical stability while preserving symmetry.

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 $P U D U^{T} P^{T}$ , where $U$ is upper triangular.
$uplo ='L'$: The lower triangular part of $A$ is stored and $A$ is factorized as $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: the

n \times n

symmetric indefinite matrix

A

If $uplo ='U'$ , the upper triangular part of $A$ must be stored and the elements of the array below the diagonal are not referenced.
If $uplo ='L'$ , the lower triangular part of $A$ must be stored and the elements of the array above the diagonal are not referenced.

On exit: the upper or lower triangle of

A

is overwritten by details of the block diagonal matrix

D

and the multipliers used to obtain the factor

U

L

as specified by uplo.

4: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, n)

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

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

\max (1, n)

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

D

. More precisely,

if $ipiv (i) = k > 0$ , $d_{i i}$ is a $1 \times 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 \times 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 \times 2$ pivot block and the $(i + 1)$ th row and column of $A$ were interchanged with the $m$ th row and column.

6: $work (\max (1, lwork))$ – Complex (Kind=nag_wp) array Workspace

On exit: if

info = 0

work (1)

contains the minimum value of lwork required for optimum performance.

7: $lwork$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which f07nrf is called, unless

lwork = −1

, in which case a workspace query is assumed and the routine only calculates the optimal dimension of work (using the formula given below).

Suggested value: for optimum performance lwork should be at least

n \times nb

, where

nb

is the block size.

Constraint:

lwork \geq 1

lwork = −1

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.

$info > 0$: Element $⟨ value ⟩$ of the diagonal is exactly zero. The factorization has been completed, but the block diagonal matrix $D$ is exactly singular, and division by zero will occur if it is used to solve a system of equations.

7 Accuracy

uplo ='U'

, the computed factors

U

and

D

are the exact factors of a perturbed matrix

A + E

, where

| E | \leq c (n) ε P | U | | D | | U^{T} | P^{T},

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

uplo ='L'

, a similar statement holds for the computed factors

L

and

D

8 Parallelism and Performance

f07nrf 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 elements of

D

overwrite the corresponding elements of

A

; if

D

has

2 \times 2

blocks, only the upper or lower triangle is stored, as specified by uplo.

The unit diagonal elements of

U

L

and the

2 \times 2

unit diagonal blocks are not stored. The remaining elements of

U

L

are stored in the corresponding columns of the array a, but additional row interchanges must be applied to recover

U

L

explicitly (this is seldom necessary). If

ipiv (i) = i

, for

i = 1, 2, \dots, n

, then

U

L

is stored explicitly (except for its unit diagonal elements which are equal to

1

The total number of real floating-point operations is approximately

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

A call to f07nrf may be followed by calls to the routines:

f07nsf to solve $A X = B$ ;
f07nuf to estimate the condition number of $A$ ;
f07nwf to compute the inverse of $A$ .

The real analogue of this routine is f07mdf.

10 Example

This example computes the Bunch–Kaufman factorization 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}) .

f07nr: FL CL CPP AD

NAG FL Interfacef07nrf (zsytrf)

▸▿ 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
f07nrf (zsytrf)