# NAG FL Interfacef07mwf (zhetri)

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

f07mwf computes the inverse of a complex Hermitian indefinite matrix $A$, where $A$ has been factorized by f07mrf.

## 2Specification

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

## 3Description

f07mwf is used to compute the inverse of a complex Hermitian indefinite matrix $A$, the routine must be preceded by a call to f07mrf, which computes the Bunch–Kaufman factorization of $A$.
If ${\mathbf{uplo}}=\text{'U'}$, $A=PUD{U}^{\mathrm{H}}{P}^{\mathrm{T}}$ and ${A}^{-1}$ is computed by solving ${U}^{\mathrm{H}}{P}^{\mathrm{T}}XPU={D}^{-1}$ for $X$.
If ${\mathbf{uplo}}=\text{'L'}$, $A=PLD{L}^{\mathrm{H}}{P}^{\mathrm{T}}$ and ${A}^{-1}$ is computed by solving ${L}^{\mathrm{H}}{P}^{\mathrm{T}}XPL={D}^{-1}$ for $X$.

## 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 how $A$ has been factorized.
${\mathbf{uplo}}=\text{'U'}$
$A=PUD{U}^{\mathrm{H}}{P}^{\mathrm{T}}$, where $U$ is upper triangular.
${\mathbf{uplo}}=\text{'L'}$
$A=PLD{L}^{\mathrm{H}}{P}^{\mathrm{T}}$, where $L$ is lower triangular.
Constraint: ${\mathbf{uplo}}=\text{'U'}$ or $\text{'L'}$.
2: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
3: $\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: details of the factorization of $A$, as returned by f07mrf.
On exit: the factorization is overwritten by the $n×n$ Hermitian matrix ${A}^{-1}$.
If ${\mathbf{uplo}}=\text{'U'}$, the upper triangle of ${A}^{-1}$ is stored in the upper triangular part of the array.
If ${\mathbf{uplo}}=\text{'L'}$, the lower triangle of ${A}^{-1}$ is stored in the lower triangular part of the array.
4: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f07mwf is called.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
5: $\mathbf{ipiv}\left(*\right)$Integer array Input
Note: the dimension of the array ipiv must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: details of the interchanges and the block structure of $D$, as returned by f07mrf.
6: $\mathbf{work}\left({\mathbf{n}}\right)$Complex (Kind=nag_wp) array Workspace
7: $\mathbf{info}$Integer Output
On exit: ${\mathbf{info}}=0$ unless the routine detects an error (see Section 6).

## 6Error Indicators and Warnings

$-999<{\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}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
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. $D$ is singular and the inverse of $A$ cannot be computed.

## 7Accuracy

The computed inverse $X$ satisfies a bound of the form
• if ${\mathbf{uplo}}=\text{'U'}$, $|D{U}^{\mathrm{H}}{P}^{\mathrm{T}}XPU-I|\le c\left(n\right)\epsilon \left(|D||{U}^{\mathrm{H}}|{P}^{\mathrm{T}}|X|P|U|+|D||{D}^{-1}|\right)$;
• if ${\mathbf{uplo}}=\text{'L'}$, $|D{L}^{\mathrm{H}}{P}^{\mathrm{T}}XPL-I|\le c\left(n\right)\epsilon \left(|D||{L}^{\mathrm{H}}|{P}^{\mathrm{T}}|X|P|L|+|D||{D}^{-1}|\right)$,
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision.

## 8Parallelism and Performance

f07mwf 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{8}{3}{n}^{3}$.
The real analogue of this routine is f07mjf.

## 10Example

This example computes the inverse of the matrix $A$, where
 $A= ( -1.36+0.00i 1.58+0.90i 2.21-0.21i 3.91+1.50i 1.58-0.90i -8.87+0.00i -1.84-0.03i -1.78+1.18i 2.21+0.21i -1.84+0.03i -4.63+0.00i 0.11+0.11i 3.91-1.50i -1.78-1.18i 0.11-0.11i -1.84+0.00i ) .$
Here $A$ is Hermitian indefinite and must first be factorized by f07mrf.

### 10.1Program Text

Program Text (f07mwfe.f90)

### 10.2Program Data

Program Data (f07mwfe.d)

### 10.3Program Results

Program Results (f07mwfe.r)