NAG Library Routine Document

f07ujf (dtptri)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:     $\mathbf{uplo}$ – Character(1)Input

On entry: specifies whether $A$ is upper or lower triangular.

$\mathbf{uplo}=\text{'U'}$

$A$ is upper triangular.

$\mathbf{uplo}=\text{'L'}$

$A$ is lower triangular.

Constraint: $\mathbf{uplo}=\text{'U'}$ or $\text{'L'}$.

2:     $\mathbf{diag}$ – Character(1)Input

On entry: indicates whether $A$ is a nonunit or unit triangular matrix.

$\mathbf{diag}=\text{'N'}$

$A$ is a nonunit triangular matrix.

$\mathbf{diag}=\text{'U'}$

$A$ is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be $1$.

Constraint: $\mathbf{diag}=\text{'N'}$ or $\text{'U'}$.

3:     $\mathbf{n}$ – IntegerInput

On entry: $n$, the order of the matrix $A$.

Constraint: $\mathbf{n}\ge 0$.

4:     $\mathbf{ap}\left(*\right)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the dimension of the array ap must be at least $\max \left(1,\mathbf{n}\times \left(\mathbf{n}+1\right)/2\right)$.

On entry: the $n$ by $n$ triangular matrix $A$, packed by columns.

More precisely,

• if $\mathbf{uplo}=\text{'U'}$, the upper triangle of $A$ must be stored with element $A_{ij}$ in $\mathbf{ap}\left(i+j\left(j-1\right)/2\right)$ for $i\le j$;
• if $\mathbf{uplo}=\text{'L'}$, the lower triangle of $A$ must be stored with element $A_{ij}$ in $\mathbf{ap}\left(i+\left(2n-j\right)\left(j-1\right)/2\right)$ for $i\ge j$.

If $\mathbf{diag}=\text{'U'}$, the diagonal elements of $A$ are assumed to be $1$, and are not referenced; the same storage scheme is used whether $\mathbf{diag}=\text{'N'}$ or ‘U’.

On exit: $A$ is overwritten by $A^{-1}$, using the same storage format as described above.

5:     $\mathbf{info}$ – IntegerOutput

On exit: $\mathbf{info}=0$ unless the routine detects an error (see Section 6).

6

Error Indicators and Warnings

$\mathbf{info}<0$

If $\mathbf{info}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$\mathbf{info}>0$

Element $〈\mathit{\text{value}}〉$ of the diagonal is exactly zero. $A$ is singular its inverse cannot be computed.

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

Program Text (f07ujfe.f90)

10.2

Program Data

Program Data (f07ujfe.d)

10.3

Program Results

Program Results (f07ujfe.r)