NAG FL Interface
f07huf (zpbcon)

Settings help

FL Name Style:

FL Specification Language:

1 Purpose

f07huf estimates the condition number of a complex Hermitian positive definite band matrix A, where A has been factorized by f07hrf.

2 Specification

Fortran Interface
Subroutine f07huf ( uplo, n, kd, ab, ldab, anorm, rcond, work, rwork, info)
Integer, Intent (In) :: n, kd, ldab
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) :: ab(ldab,*)
Complex (Kind=nag_wp), Intent (Out) :: work(2*n)
Character (1), Intent (In) :: uplo
C Header Interface
#include <nag.h>
void  f07huf_ (const char *uplo, const Integer *n, const Integer *kd, const Complex ab[], const Integer *ldab, const double *anorm, double *rcond, Complex work[], double rwork[], Integer *info, const Charlen length_uplo)
The routine may be called by the names f07huf, nagf_lapacklin_zpbcon or its LAPACK name zpbcon.

3 Description

f07huf estimates the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix A:
κ1(A)=A1A-11 .  
Since A is Hermitian, κ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 f06uef to compute A1 and a call to f07hrf to compute the Cholesky 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.
A=UHU, where U is upper triangular.
A=LLH, 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: kd Integer Input
On entry: kd, the number of superdiagonals or subdiagonals of the matrix A.
Constraint: kd0.
4: ab(ldab,*) Complex (Kind=nag_wp) array Input
Note: the second dimension of the array ab must be at least max(1,n).
On entry: the Cholesky factor of A, as returned by f07hrf.
5: ldab Integer Input
On entry: the first dimension of the array ab as declared in the (sub)program from which f07huf is called.
Constraint: ldabkd+1.
6: anorm Real (Kind=nag_wp) Input
On entry: the 1-norm of the original matrix A, which may be computed by calling f06uef with its argument norm='1'. anorm must be computed either before calling f07hrf or else from a copy of the original matrix A.
Constraint: anorm0.0.
7: 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.
8: work(2×n) Complex (Kind=nag_wp) array Workspace
9: rwork(n) Real (Kind=nag_wp) array Workspace
10: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

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

Background information to multithreading can be found in the Multithreading documentation.
f07huf 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 f07huf 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 16nk real floating-point operations (assuming nk) but takes considerably longer than a call to f07hsf 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 f07hgf.

10 Example

This example estimates the condition number in the 1-norm (or -norm) of the matrix A, where
A= ( 9.39+0.00i 1.08-1.73i 0.00+0.00i 0.00+0.00i 1.08+1.73i 1.69+0.00i -0.04+0.29i 0.00+0.00i 0.00+0.00i -0.04-0.29i 2.65+0.00i -0.33+2.24i 0.00+0.00i 0.00+0.00i -0.33-2.24i 2.17+0.00i ) .  
Here A is Hermitian positive definite, and is treated as a band matrix, which must first be factorized by f07hrf. The true condition number in the 1-norm is 153.45.

10.1 Program Text

Program Text (f07hufe.f90)

10.2 Program Data

Program Data (f07hufe.d)

10.3 Program Results

Program Results (f07hufe.r)