NAG FL Interface
f07pgf (dspcon)

Settings help

FL Name Style:


FL Specification Language:


1 Purpose

f07pgf estimates the condition number of a real symmetric indefinite matrix A, where A has been factorized by f07pdf, using packed storage.

2 Specification

Fortran Interface
Subroutine f07pgf ( uplo, n, ap, ipiv, anorm, rcond, work, iwork, info)
Integer, Intent (In) :: n, ipiv(*)
Integer, Intent (Out) :: iwork(n), info
Real (Kind=nag_wp), Intent (In) :: ap(*), anorm
Real (Kind=nag_wp), Intent (Out) :: rcond, work(2*n)
Character (1), Intent (In) :: uplo
C Header Interface
#include <nag.h>
void  f07pgf_ (const char *uplo, const Integer *n, const double ap[], const Integer ipiv[], const double *anorm, double *rcond, double work[], Integer iwork[], Integer *info, const Charlen length_uplo)
The routine may be called by the names f07pgf, nagf_lapacklin_dspcon or its LAPACK name dspcon.

3 Description

f07pgf estimates the condition number (in the 1-norm) of a real symmetric indefinite matrix A:
κ1(A)=A1A-11 .  
Since A is symmetric, κ1(A)=κ(A)=AA-1.
Because κ1(A) is infinite if A is singular, the routine actually returns an estimate of the reciprocal of κ1(A).
The routine should be preceded by a call to f06rdf to compute A1 and a call to f07pdf to compute the Bunch–Kaufman factorization of A. The routine then uses Higham's implementation of Hager's method (see Higham (1988)) to estimate A-11.

4 References

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

5 Arguments

1: uplo Character(1) Input
On entry: specifies how A has been factorized.
uplo='U'
A=PUDUTPT, where U is upper triangular.
uplo='L'
A=PLDLTPT, where L is lower triangular.
Constraint: uplo='U' or 'L'.
2: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
3: ap(*) Real (Kind=nag_wp) array Input
Note: the dimension of the array ap must be at least max(1,n×(n+1)/2).
On entry: the factorization of A stored in packed form, as returned by f07pdf.
4: ipiv(*) Integer array Input
Note: the dimension of the array ipiv must be at least max(1,n).
On entry: details of the interchanges and the block structure of D, as returned by f07pdf.
5: 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 norm='1'. anorm must be computed either before calling f07pdf or else from a copy of the original matrix A.
Constraint: anorm0.0.
6: 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.
7: work(2×n) Real (Kind=nag_wp) array Workspace
8: iwork(n) Integer array Workspace
9: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

info<0
If 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 ρ, and in practice is nearly always less than 10ρ, although examples can be constructed where rcond is much larger.

8 Parallelism and Performance

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

9 Further Comments

A call to f07pgf 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 2n2 floating-point operations but takes considerably longer than a call to f07pef with one right-hand side, because extra care is taken to avoid overflow when A is approximately singular.
The complex analogues of this routine are f07puf for Hermitian matrices and f07quf for symmetric matrices.

10 Example

This example estimates the condition number in the 1-norm (or -norm) of the matrix A, where
A= ( 2.07 3.87 4.20 -1.15 3.87 -0.21 1.87 0.63 4.20 1.87 1.15 2.06 -1.15 0.63 2.06 -1.81 ) .  
Here A is symmetric indefinite, stored in packed form, and must first be factorized by f07pdf. The true condition number in the 1-norm is 75.68.

10.1 Program Text

Program Text (f07pgfe.f90)

10.2 Program Data

Program Data (f07pgfe.d)

10.3 Program Results

Program Results (f07pgfe.r)