NAG Library Routine Document

F07UJF (DTPTRI)

1  Purpose

2  Specification

3  Description

4  References

5  Parameters

1:     $\mathrm{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:     $\mathrm{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:     $\mathrm{N}$ – INTEGERInput

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

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

4:     $\mathrm{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:     $\mathrm{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)