void	f07wkf_ ( const char transr, const char uplo, const char diag, const Integer n, double ar[], Integer *info, const Charlen length_transr, const Charlen length_uplo, const Charlen length_diag)

The routine may be called by its LAPACK name dtftri.

3

Description

f07wkf (dtftri) forms the inverse of a real triangular matrix

A

, stored using RFP format. The RFP storage format is described in Section 3.3.3 in the F07 Chapter Introduction. Note that the inverse of an upper (lower) triangular matrix is also upper (lower) triangular.

4

References

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

Gustavson F G, Waśniewski J, Dongarra J J and Langou J (2010) Rectangular full packed format for Cholesky's algorithm: factorization, solution, and inversion ACM Trans. Math. Software 37, 2

5

Arguments

1: $transr$ – Character(1)Input

On entry: specifies whether the RFP representation of

A

is normal or transposed.

$transr ='N'$: The matrix $A$ is stored in normal RFP format.
$transr ='T'$: The matrix $A$ is stored in transposed RFP format.

Constraint:

transr ='N'

'T'

2: $uplo$ – Character(1)Input

On entry: specifies whether

A

is upper or lower triangular.

$uplo ='U'$: $A$ is upper triangular.
$uplo ='L'$: $A$ is lower triangular.

Constraint:

uplo ='U'

'L'

3: $diag$ – Character(1)Input

On entry: indicates whether

A

is a nonunit or unit triangular matrix.

$diag ='N'$: $A$ is a nonunit triangular matrix.
$diag ='U'$: $A$ is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be $1$ .

Constraint:

diag ='N'

'U'

4: $n$ – IntegerInput

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

5: $ar (n \times (n + 1) / 2)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the upper or lower triangular part (as specified by uplo) of the

n

n

symmetric matrix

A

, in either normal or transposed RFP format (as specified by transr). The storage format is described in detail in Section 3.3.3 in the F07 Chapter Introduction.

On exit:

A

is overwritten by

A^{- 1}

, in the same storage format as

A

6: $info$ – IntegerOutput

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$: Diagonal element $〈value〉$ of $A$ is exactly zero. $A$ is singular its inverse cannot be computed.

7

Accuracy

The computed inverse

X

satisfies

|X A - I| \leq c (n) ε |X| |A|,

where

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

Note that a similar bound for

|A X - I|

cannot be guaranteed, although it is almost always satisfied.

The computed inverse satisfies the forward error bound

|X - A^{- 1}| \leq c (n) ε |A^{- 1}| |A| |X| .

See Du Croz and Higham (1992).

8

Parallelism and Performance

f07wkf (dtftri) 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 floating-point operations is approximately

\frac{1}{3} n^{3}

The complex analogue of this routine is f07wxf (ztftri).

10

Example

This example computes the inverse of the matrix

A

, where

A = (\begin{matrix} 4.30 & 0.00 & 0.00 & 0.00 \\ - 3.96 & - 4.87 & 0.00 & 0.00 \\ 0.40 & 0.31 & - 8.02 & 0.00 \\ - 0.27 & 0.07 & - 5.95 & 0.12 \end{matrix})

and is stored using RFP format.

NAG Library Routine Document

f07wkf (dtftri)

▸▿ 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

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