f07 Chapter Contents
f07 Chapter Introduction
NAG C Library Manual

# NAG Library Function Documentnag_zpptri (f07gwc)

## 1  Purpose

nag_zpptri (f07gwc) computes the inverse of a complex Hermitian positive definite matrix $A$, where $A$ has been factorized by nag_zpptrf (f07grc), using packed storage.

## 2  Specification

 #include #include
 void nag_zpptri (Nag_OrderType order, Nag_UploType uplo, Integer n, Complex ap[], NagError *fail)

## 3  Description

nag_zpptri (f07gwc) is used to compute the inverse of a complex Hermitian positive definite matrix $A$, the function must be preceded by a call to nag_zpptrf (f07grc), which computes the Cholesky factorization of $A$, using packed storage.
If ${\mathbf{uplo}}=\mathrm{Nag_Upper}$, $A={U}^{\mathrm{H}}U$ and ${A}^{-1}$ is computed by first inverting $U$ and then forming $\left({U}^{-1}\right){U}^{-\mathrm{H}}$.
If ${\mathbf{uplo}}=\mathrm{Nag_Lower}$, $A=L{L}^{\mathrm{H}}$ and ${A}^{-1}$ is computed by first inverting $L$ and then forming ${L}^{-\mathrm{H}}\left({L}^{-1}\right)$.

## 4  References

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

## 5  Arguments

1:     orderNag_OrderTypeInput
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by ${\mathbf{order}}=\mathrm{Nag_RowMajor}$. See Section 3.2.1.3 in the Essential Introduction for a more detailed explanation of the use of this argument.
Constraint: ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ or Nag_ColMajor.
2:     uploNag_UploTypeInput
On entry: specifies how $A$ has been factorized.
${\mathbf{uplo}}=\mathrm{Nag_Upper}$
$A={U}^{\mathrm{H}}U$, where $U$ is upper triangular.
${\mathbf{uplo}}=\mathrm{Nag_Lower}$
$A=L{L}^{\mathrm{H}}$, where $L$ is lower triangular.
Constraint: ${\mathbf{uplo}}=\mathrm{Nag_Upper}$ or $\mathrm{Nag_Lower}$.
3:     nIntegerInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4:     ap[$\mathit{dim}$]ComplexInput/Output
Note: the dimension, dim, of the array ap must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}×\left({\mathbf{n}}+1\right)/2\right)$.
On entry: the Cholesky factor of $A$ stored in packed form, as returned by nag_zpptrf (f07grc).
On exit: the factorization is overwritten by the $n$ by $n$ matrix ${A}^{-1}$.
The storage of elements ${A}_{ij}$ depends on the order and uplo arguments as follows:
• if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(j-1\right)×j/2+i-1\right]$, for $i\le j$;
• if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-j\right)×\left(j-1\right)/2+i-1\right]$, for $i\ge j$;
• if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-i\right)×\left(i-1\right)/2+j-1\right]$, for $i\le j$;
• if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(i-1\right)×i/2+j-1\right]$, for $i\ge j$.
5:     failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_INT
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 0$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
NE_SINGULAR
Diagonal element $〈\mathit{\text{value}}〉$ of the Cholesky factor is zero; the Cholesky factor is singular and the inverse of $A$ cannot be computed.

## 7  Accuracy

The computed inverse $X$ satisfies
 $XA-I2≤cnεκ2A and AX-I2≤cnεκ2A ,$
where $c\left(n\right)$ is a modest function of $n$, $\epsilon$ is the machine precision and ${\kappa }_{2}\left(A\right)$ is the condition number of $A$ defined by
 $κ2A=A2A-12 .$

The total number of real floating point operations is approximately $\frac{8}{3}{n}^{3}$.
The real analogue of this function is nag_dpptri (f07gjc).

## 9  Example

This example computes the inverse of the matrix $A$, where
 $A= 3.23+0.00i 1.51-1.92i 1.90+0.84i 0.42+2.50i 1.51+1.92i 3.58+0.00i -0.23+1.11i -1.18+1.37i 1.90-0.84i -0.23-1.11i 4.09+0.00i 2.33-0.14i 0.42-2.50i -1.18-1.37i 2.33+0.14i 4.29+0.00i .$
Here $A$ is Hermitian positive definite, stored in packed form, and must first be factorized by nag_zpptrf (f07grc).

### 9.1  Program Text

Program Text (f07gwce.c)

### 9.2  Program Data

Program Data (f07gwce.d)

### 9.3  Program Results

Program Results (f07gwce.r)