# NAG FL Interfacef07twf (ztrtri)

## 1Purpose

f07twf computes the inverse of a complex triangular matrix.

## 2Specification

Fortran Interface
 Subroutine f07twf ( uplo, diag, n, a, lda, info)
 Integer, Intent (In) :: n, lda Integer, Intent (Out) :: info Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*) Character (1), Intent (In) :: uplo, diag
#include <nag.h>
 void f07twf_ (const char *uplo, const char *diag, const Integer *n, Complex a[], const Integer *lda, Integer *info, const Charlen length_uplo, const Charlen length_diag)
The routine may be called by the names f07twf, nagf_lapacklin_ztrtri or its LAPACK name ztrtri.

## 3Description

f07twf forms the inverse of a complex triangular matrix $A$. Note that the inverse of an upper (lower) triangular matrix is also upper (lower) triangular.

## 4References

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

## 5Arguments

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}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4: $\mathbf{a}\left({\mathbf{lda}},*\right)$Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: the $n$ by $n$ triangular matrix $A$.
• If ${\mathbf{uplo}}=\text{'U'}$, $A$ is upper triangular and the elements of the array below the diagonal are not referenced.
• If ${\mathbf{uplo}}=\text{'L'}$, $A$ is lower triangular and the elements of the array above the diagonal are not referenced.
• If ${\mathbf{diag}}=\text{'U'}$, the diagonal elements of $A$ are assumed to be $1$, and are not referenced.
On exit: $A$ is overwritten by ${A}^{-1}$, using the same storage format as described above.
5: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f07twf is called.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
6: $\mathbf{info}$Integer Output
On exit: ${\mathbf{info}}=0$ unless the routine detects an error (see Section 6).

## 6Error 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.

## 7Accuracy

The computed inverse $X$ satisfies
 $XA-I≤cnεXA ,$
where $c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision.
Note that a similar bound for $\left|AX-I\right|$ cannot be guaranteed, although it is almost always satisfied.
The computed inverse satisfies the forward error bound
 $X-A-1≤cnεA-1AX .$
See Du Croz and Higham (1992).

## 8Parallelism and Performance

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

The total number of real floating-point operations is approximately $\frac{4}{3}{n}^{3}$.
The real analogue of this routine is f07tjf.

## 10Example

This example computes the inverse of the matrix $A$, where
 $A= 4.78+4.56i 0.00+0.00i 0.00+0.00i 0.00+0.00i 2.00-0.30i -4.11+1.25i 0.00+0.00i 0.00+0.00i 2.89-1.34i 2.36-4.25i 4.15+0.80i 0.00+0.00i -1.89+1.15i 0.04-3.69i -0.02+0.46i 0.33-0.26i .$

### 10.1Program Text

Program Text (f07twfe.f90)

### 10.2Program Data

Program Data (f07twfe.d)

### 10.3Program Results

Program Results (f07twfe.r)