NAG Library Routine Document
f07ggf (dppcon)
1
Purpose
f07ggf (dppcon) estimates the condition number of a real symmetric positive definite matrix
$A$, where
$A$ has been factorized by
f07gdf (dpptrf), using packed storage.
2
Specification
Fortran Interface
Integer, Intent (In)  ::  n  Integer, Intent (Out)  ::  iwork(n), info  Real (Kind=nag_wp), Intent (In)  ::  ap(*), anorm  Real (Kind=nag_wp), Intent (Out)  ::  rcond, work(3*n)  Character (1), Intent (In)  ::  uplo 

The routine may be called by its
LAPACK
name dppcon.
3
Description
f07ggf (dppcon) estimates the condition number (in the
$1$norm) of a real symmetric positive definite matrix
$A$:
Since
$A$ is symmetric,
${\kappa}_{1}\left(A\right)={\kappa}_{\infty}\left(A\right)={\Vert A\Vert}_{\infty}{\Vert {A}^{1}\Vert}_{\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
f06rdf to compute
${\Vert A\Vert}_{1}$ and a call to
f07gdf (dpptrf) to compute the Cholesky factorization of
$A$. The routine then uses Higham's implementation of Hager's method (see
Higham (1988)) to estimate
${\Vert {A}^{1}\Vert}_{1}$.
4
References
Higham N J (1988) FORTRAN codes for estimating the onenorm of a real or complex matrix, with applications to condition estimation ACM Trans. Math. Software 14 381–396
5
Arguments
 1: $\mathbf{uplo}$ – Character(1)Input

On entry: specifies how
$A$ has been factorized.
 ${\mathbf{uplo}}=\text{'U'}$
 $A={U}^{\mathrm{T}}U$, where $U$ is upper triangular.
 ${\mathbf{uplo}}=\text{'L'}$
 $A=L{L}^{\mathrm{T}}$, where $L$ is lower triangular.
Constraint:
${\mathbf{uplo}}=\text{'U'}$ or $\text{'L'}$.
 2: $\mathbf{n}$ – IntegerInput

On entry: $n$, the order of the matrix $A$.
Constraint:
${\mathbf{n}}\ge 0$.
 3: $\mathbf{ap}\left(*\right)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array
ap
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\times \left({\mathbf{n}}+1\right)/2\right)$.
On entry: the Cholesky factor of
$A$ stored in packed form, as returned by
f07gdf (dpptrf).
 4: $\mathbf{anorm}$ – Real (Kind=nag_wp)Input

On entry: the
$1$norm of the
original matrix
$A$, which may be computed by calling
f06rdf with its argument
${\mathbf{norm}}=\text{'1'}$.
anorm must be computed either
before calling
f07gdf (dpptrf) 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(3\times {\mathbf{n}}\right)$ – Real (Kind=nag_wp) arrayWorkspace

 7: $\mathbf{iwork}\left({\mathbf{n}}\right)$ – Integer arrayWorkspace

 8: $\mathbf{info}$ – IntegerOutput
On exit:
${\mathbf{info}}=0$ unless the routine detects an error (see
Section 6).
6
Error 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.
7
Accuracy
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.
8
Parallelism and Performance
f07ggf (dppcon) 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 implementationspecific information.
A call to
f07ggf (dppcon) involves solving a number of systems of linear equations of the form
$Ax=b$; the number is usually
$4$ or
$5$ and never more than
$11$. Each solution involves approximately
$2{n}^{2}$ floatingpoint operations but takes considerably longer than a call to
f07gef (dpptrs) with one righthand side, because extra care is taken to avoid overflow when
$A$ is approximately singular.
The complex analogue of this routine is
f07guf (zppcon).
10
Example
This example estimates the condition number in the
$1$norm (or
$\infty $norm) of the matrix
$A$, where
Here
$A$ is symmetric positive definite, stored in packed form, and must first be factorized by
f07gdf (dpptrf). The true condition number in the
$1$norm is
$97.32$.
10.1
Program Text
Program Text (f07ggfe.f90)
10.2
Program Data
Program Data (f07ggfe.d)
10.3
Program Results
Program Results (f07ggfe.r)