F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF07NWF (ZSYTRI)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F07NWF (ZSYTRI) computes the inverse of a complex symmetric matrix $A$, where $A$ has been factorized by F07NRF (ZSYTRF).

## 2  Specification

 SUBROUTINE F07NWF ( UPLO, N, A, LDA, IPIV, WORK, INFO)
 INTEGER N, LDA, IPIV(*), INFO COMPLEX (KIND=nag_wp) A(LDA,*), WORK(2*N) CHARACTER(1) UPLO
The routine may be called by its LAPACK name zsytri.

## 3  Description

F07NWF (ZSYTRI) is used to compute the inverse of a complex symmetric matrix $A$, the routine must be preceded by a call to F07NRF (ZSYTRF), which computes the Bunch–Kaufman factorization of $A$.
If ${\mathbf{UPLO}}=\text{'U'}$, $A=PUD{U}^{\mathrm{T}}{P}^{\mathrm{T}}$ and ${A}^{-1}$ is computed by solving ${U}^{\mathrm{T}}{P}^{\mathrm{T}}XPU={D}^{-1}$ for $X$.
If ${\mathbf{UPLO}}=\text{'L'}$, $A=PLD{L}^{\mathrm{T}}{P}^{\mathrm{T}}$ and ${A}^{-1}$ is computed by solving ${L}^{\mathrm{T}}{P}^{\mathrm{T}}XPL={D}^{-1}$ for $X$.

## 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  Parameters

1:     UPLO – CHARACTER(1)Input
On entry: specifies how $A$ has been factorized.
${\mathbf{UPLO}}=\text{'U'}$
$A=PUD{U}^{\mathrm{T}}{P}^{\mathrm{T}}$, where $U$ is upper triangular.
${\mathbf{UPLO}}=\text{'L'}$
$A=PLD{L}^{\mathrm{T}}{P}^{\mathrm{T}}$, where $L$ is lower triangular.
Constraint: ${\mathbf{UPLO}}=\text{'U'}$ or $\text{'L'}$.
2:     N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     A(LDA,$*$) – COMPLEX (KIND=nag_wp) arrayInput/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 F07NRF (ZSYTRF).
On exit: the factorization is overwritten by the $n$ by $n$ symmetric 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:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F07NWF (ZSYTRI) is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
5:     IPIV($*$) – INTEGER arrayInput
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 F07NRF (ZSYTRF).
6:     WORK($2×{\mathbf{N}}$) – COMPLEX (KIND=nag_wp) arrayWorkspace
7:     INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, the $i$th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.
${\mathbf{INFO}}>0$
If ${\mathbf{INFO}}=i$, $d\left(i,i\right)$ is exactly zero; $D$ is singular and the inverse of $A$ cannot be computed.

## 7  Accuracy

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

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

## 9  Example

This example computes the inverse of the matrix $A$, where
 $A= -0.39-0.71i 5.14-0.64i -7.86-2.96i 3.80+0.92i 5.14-0.64i 8.86+1.81i -3.52+0.58i 5.32-1.59i -7.86-2.96i -3.52+0.58i -2.83-0.03i -1.54-2.86i 3.80+0.92i 5.32-1.59i -1.54-2.86i -0.56+0.12i .$
Here $A$ is symmetric and must first be factorized by F07NRF (ZSYTRF).

### 9.1  Program Text

Program Text (f07nwfe.f90)

### 9.2  Program Data

Program Data (f07nwfe.d)

### 9.3  Program Results

Program Results (f07nwfe.r)