F04 Chapter Contents
F04 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF04DJF

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

F04DJF computes the solution to a complex system of linear equations $AX=B$, where $A$ is an $n$ by $n$ complex symmetric matrix, stored in packed format and $X$ and $B$ are $n$ by $r$ matrices. An estimate of the condition number of $A$ and an error bound for the computed solution are also returned.

## 2  Specification

 SUBROUTINE F04DJF ( UPLO, N, NRHS, AP, IPIV, B, LDB, RCOND, ERRBND, IFAIL)
 INTEGER N, NRHS, IPIV(N), LDB, IFAIL REAL (KIND=nag_wp) RCOND, ERRBND COMPLEX (KIND=nag_wp) AP(*), B(LDB,*) CHARACTER(1) UPLO

## 3  Description

The diagonal pivoting method is used to factor $A$ as $A=UD{U}^{\mathrm{T}}$, if ${\mathbf{UPLO}}=\text{'U'}$, or $A=LD{L}^{\mathrm{T}}$, if ${\mathbf{UPLO}}=\text{'L'}$, where $U$ (or $L$) is a product of permutation and unit upper (lower) triangular matrices, and $D$ is symmetric and block diagonal with $1$ by $1$ and $2$ by $2$ diagonal blocks. The factored form of $A$ is then used to solve the system of equations $AX=B$.

## 4  References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

## 5  Parameters

1:     $\mathrm{UPLO}$ – CHARACTER(1)Input
On entry: if ${\mathbf{UPLO}}=\text{'U'}$, the upper triangle of the matrix $A$ is stored.
If ${\mathbf{UPLO}}=\text{'L'}$, the lower triangle of the matrix $A$ is stored.
Constraint: ${\mathbf{UPLO}}=\text{'U'}$ or $\text{'L'}$.
2:     $\mathrm{N}$ – INTEGERInput
On entry: the number of linear equations $n$, i.e., the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     $\mathrm{NRHS}$ – INTEGERInput
On entry: the number of right-hand sides $r$, i.e., the number of columns of the matrix $B$.
Constraint: ${\mathbf{NRHS}}\ge 0$.
4:     $\mathrm{AP}\left(*\right)$ – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension 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 $n$ by $n$ symmetric matrix $A$, packed column-wise in a linear array. The $j$th column of the matrix $A$ is stored in the array AP as follows:
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$.
On exit: if ${\mathbf{IFAIL}}\ge {\mathbf{0}}$, the block diagonal matrix $D$ and the multipliers used to obtain the factor $U$ or $L$ from the factorization $A=UD{U}^{\mathrm{T}}$ or $A=LD{L}^{\mathrm{T}}$ as computed by F07QRF (ZSPTRF), stored as a packed triangular matrix in the same storage format as $A$.
5:     $\mathrm{IPIV}\left({\mathbf{N}}\right)$ – INTEGER arrayOutput
On exit: if no constraints are violated, details of the interchanges and the block structure of $D$, as determined by F07QRF (ZSPTRF).
• If ${\mathbf{IPIV}}\left(k\right)>0$, then rows and columns $k$ and ${\mathbf{IPIV}}\left(k\right)$ were interchanged, and ${d}_{kk}$ is a $1$ by $1$ diagonal block;
• if ${\mathbf{UPLO}}=\text{'U'}$ and ${\mathbf{IPIV}}\left(k\right)={\mathbf{IPIV}}\left(k-1\right)<0$, then rows and columns $k-1$ and $-{\mathbf{IPIV}}\left(k\right)$ were interchanged and ${d}_{k-1:k,k-1:k}$ is a $2$ by $2$ diagonal block;
• if ${\mathbf{UPLO}}=\text{'L'}$ and ${\mathbf{IPIV}}\left(k\right)={\mathbf{IPIV}}\left(k+1\right)<0$, then rows and columns $k+1$ and $-{\mathbf{IPIV}}\left(k\right)$ were interchanged and ${d}_{k:k+1,k:k+1}$ is a $2$ by $2$ diagonal block.
6:     $\mathrm{B}\left({\mathbf{LDB}},*\right)$ – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array B must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{NRHS}}\right)$.
On entry: the $n$ by $r$ matrix of right-hand sides $B$.
On exit: if ${\mathbf{IFAIL}}={\mathbf{0}}$ or $\mathbf{N}+{\mathbf{1}}$, the $n$ by $r$ solution matrix $X$.
7:     $\mathrm{LDB}$ – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F04DJF is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
8:     $\mathrm{RCOND}$ – REAL (KIND=nag_wp)Output
On exit: if no constraints are violated, an estimate of the reciprocal of the condition number of the matrix $A$, computed as ${\mathbf{RCOND}}=1/\left({‖A‖}_{1}{‖{A}^{-1}‖}_{1}\right)$.
9:     $\mathrm{ERRBND}$ – REAL (KIND=nag_wp)Output
On exit: if ${\mathbf{IFAIL}}={\mathbf{0}}$ or $\mathbf{N}+{\mathbf{1}}$, an estimate of the forward error bound for a computed solution $\stackrel{^}{x}$, such that ${‖\stackrel{^}{x}-x‖}_{1}/{‖x‖}_{1}\le {\mathbf{ERRBND}}$, where $\stackrel{^}{x}$ is a column of the computed solution returned in the array B and $x$ is the corresponding column of the exact solution $X$. If RCOND is less than machine precision, then ERRBND is returned as unity.
10:   $\mathrm{IFAIL}$ – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is $0$. When the value $-\mathbf{1}\text{​ or ​}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit: ${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{1}}$, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
${\mathbf{IFAIL}}<0 \text{and} {\mathbf{IFAIL}}\ne -999$
If ${\mathbf{IFAIL}}=-i$, the $i$th argument had an illegal value.
${\mathbf{IFAIL}}>0 \text{and} {\mathbf{IFAIL}}\le {\mathbf{N}}$
If ${\mathbf{IFAIL}}=i$, ${d}_{ii}$ is exactly zero. The factorization has been completed, but the block diagonal matrix $D$ is exactly singular, so the solution could not be computed.
${\mathbf{IFAIL}}={\mathbf{N}}+1$
RCOND is less than machine precision, so that the matrix $A$ is numerically singular. A solution to the equations $AX=B$ has nevertheless been computed.
${\mathbf{IFAIL}}=-99$
See Section 3.8 in the Essential Introduction for further information.
${\mathbf{IFAIL}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.
${\mathbf{IFAIL}}=-999$
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

## 7  Accuracy

The computed solution for a single right-hand side, $\stackrel{^}{x}$, satisfies an equation of the form
 $A+E x^=b,$
where
 $E1 = Oε A1$
and $\epsilon$ is the machine precision. An approximate error bound for the computed solution is given by
 $x^-x1 x1 ≤ κA E1 A1 ,$
where $\kappa \left(A\right)={‖{A}^{-1}‖}_{1}{‖A‖}_{1}$, the condition number of $A$ with respect to the solution of the linear equations. F04DJF uses the approximation ${‖E‖}_{1}=\epsilon {‖A‖}_{1}$ to estimate ERRBND. See Section 4.4 of Anderson et al. (1999) for further details.

## 8  Parallelism and Performance

F04DJF is not threaded by NAG in any implementation.
F04DJF 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 packed storage scheme is illustrated by the following example when $n=4$ and ${\mathbf{UPLO}}=\text{'U'}$. Two-dimensional storage of the symmetric matrix $A$:
 $a11 a12 a13 a14 a22 a23 a24 a33 a34 a44 aij = aji$
Packed storage of the upper triangle of $A$:
 $AP= a11, a12, a22, a13, a23, a33, a14, a24, a34, a44$
The total number of floating-point operations required to solve the equations $AX=B$ is proportional to $\left(\frac{1}{3}{n}^{3}+2{n}^{2}r\right)$. The condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization.
In practice the condition number estimator is very reliable, but it can underestimate the true condition number; see Section 15.3 of Higham (2002) for further details.
Routine F04CJF is for complex Hermitian matrices, and the real analogue of F04DJF is F04BJF.

## 10  Example

This example solves the equations
 $AX=B,$
where $A$ is the symmetric indefinite matrix
 $A= -0.56+0.12i -1.54-2.86i 5.32-1.59i 3.80+0.92i -1.54-2.86i -2.83-0.03i -3.52+0.58i -7.86-2.96i 5.32-1.59i -3.52+0.58i 8.86+1.81i 5.14-0.64i 3.80+0.92i -7.86-2.96i 5.14-0.64i -0.39-0.71i$
and
 $B= -6.43+19.24i -4.59-35.53i -0.49-01.47i 6.95+20.49i -48.18+66.00i -12.08-27.02i -55.64+41.22i -19.09-35.97i .$
An estimate of the condition number of $A$ and an approximate error bound for the computed solutions are also printed.

### 10.1  Program Text

Program Text (f04djfe.f90)

### 10.2  Program Data

Program Data (f04djfe.d)

### 10.3  Program Results

Program Results (f04djfe.r)