# NAG FL Interfacef07guf (zppcon)

## 1Purpose

f07guf estimates the condition number of a complex Hermitian positive definite matrix $A$, where $A$ has been factorized by f07grf, using packed storage.

## 2Specification

Fortran Interface
 Subroutine f07guf ( uplo, n, ap, work, info)
 Integer, Intent (In) :: n Integer, Intent (Out) :: info Real (Kind=nag_wp), Intent (In) :: anorm Real (Kind=nag_wp), Intent (Out) :: rcond, rwork(n) Complex (Kind=nag_wp), Intent (In) :: ap(*) Complex (Kind=nag_wp), Intent (Out) :: work(2*n) Character (1), Intent (In) :: uplo
#include <nag.h>
 void f07guf_ (const char *uplo, const Integer *n, const Complex ap[], const double *anorm, double *rcond, Complex work[], double rwork[], Integer *info, const Charlen length_uplo)
The routine may be called by the names f07guf, nagf_lapacklin_zppcon or its LAPACK name zppcon.

## 3Description

f07guf estimates the condition number (in the $1$-norm) of a complex Hermitian positive definite matrix $A$:
 $κ1A=A1A-11 .$
Since $A$ is Hermitian, ${\kappa }_{1}\left(A\right)={\kappa }_{\infty }\left(A\right)={‖A‖}_{\infty }{‖{A}^{-1}‖}_{\infty }$.
Because ${\kappa }_{1}\left(A\right)$ is infinite if $A$ is singular, the routine actually returns an estimate of the reciprocal of ${\kappa }_{1}\left(A\right)$.
The routine should be preceded by a call to f06udf to compute ${‖A‖}_{1}$ and a call to f07grf to compute the Cholesky factorization of $A$. The routine then uses Higham's implementation of Hager's method (see Higham (1988)) to estimate ${‖{A}^{-1}‖}_{1}$.

## 4References

Higham N J (1988) FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation ACM Trans. Math. Software 14 381–396

## 5Arguments

1: $\mathbf{uplo}$Character(1) Input
On entry: specifies how $A$ has been factorized.
${\mathbf{uplo}}=\text{'U'}$
$A={U}^{\mathrm{H}}U$, where $U$ is upper triangular.
${\mathbf{uplo}}=\text{'L'}$
$A=L{L}^{\mathrm{H}}$, 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{ap}\left(*\right)$Complex (Kind=nag_wp) array Input
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 Cholesky factor of $A$ stored in packed form, as returned by f07grf.
4: $\mathbf{anorm}$Real (Kind=nag_wp) Input
On entry: the $1$-norm of the original matrix $A$, which may be computed by calling f06udf with its argument ${\mathbf{norm}}=\text{'1'}$. anorm must be computed either before calling f07grf or else from a copy of the original matrix $A$.
Constraint: ${\mathbf{anorm}}\ge 0.0$.
5: $\mathbf{rcond}$Real (Kind=nag_wp) Output
On exit: an estimate of the reciprocal of the condition number of $A$. rcond is set to zero if exact singularity is detected or the estimate underflows. If rcond is less than machine precision, $A$ is singular to working precision.
6: $\mathbf{work}\left(2×{\mathbf{n}}\right)$Complex (Kind=nag_wp) array Workspace
7: $\mathbf{rwork}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Workspace
8: $\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.

## 7Accuracy

The computed estimate rcond is never less than the true value $\rho$, and in practice is nearly always less than $10\rho$, although examples can be constructed where rcond is much larger.

## 8Parallelism and Performance

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

A call to f07guf involves solving a number of systems of linear equations of the form $Ax=b$; the number is usually $5$ and never more than $11$. Each solution involves approximately $8{n}^{2}$ real floating-point operations but takes considerably longer than a call to f07gsf with one right-hand side, because extra care is taken to avoid overflow when $A$ is approximately singular.
The real analogue of this routine is f07ggf.

## 10Example

This example estimates the condition number in the $1$-norm (or $\infty$-norm) 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 f07grf. The true condition number in the $1$-norm is $201.92$.

### 10.1Program Text

Program Text (f07gufe.f90)

### 10.2Program Data

Program Data (f07gufe.d)

### 10.3Program Results

Program Results (f07gufe.r)