NAG Library Routine Document

f07juf  (zptcon)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f07juf (zptcon) computes the reciprocal condition number of a complex n  by n  Hermitian positive definite tridiagonal matrix A , using the LDLH  factorization returned by f07jrf (zpttrf).

2
Specification

Fortran Interface
Subroutine f07juf ( n, d, e, anorm, rcond, rwork, info)
Integer, Intent (In):: n
Integer, Intent (Out):: info
Real (Kind=nag_wp), Intent (In):: d(*), anorm
Real (Kind=nag_wp), Intent (Out):: rcond, rwork(n)
Complex (Kind=nag_wp), Intent (In):: e(*)
C Header Interface
#include nagmk26.h
void  f07juf_ ( const Integer *n, const double d[], const Complex e[], const double *anorm, double *rcond, double rwork[], Integer *info)
The routine may be called by its LAPACK name zptcon.

3
Description

f07juf (zptcon) should be preceded by a call to f07jrf (zpttrf), which computes a modified Cholesky factorization of the matrix A  as
A=LDLH ,  
where L  is a unit lower bidiagonal matrix and D  is a diagonal matrix, with positive diagonal elements. f07juf (zptcon) then utilizes the factorization to compute A-11  by a direct method, from which the reciprocal of the condition number of A , 1/κA  is computed as
1/κ1A=1 / A1 A-11 .  
1/κA  is returned, rather than κA , since when A  is singular κA  is infinite.

4
References

Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

5
Arguments

1:     n – IntegerInput
On entry: n, the order of the matrix A.
Constraint: n0.
2:     d* – Real (Kind=nag_wp) arrayInput
Note: the dimension of the array d must be at least max1,n.
On entry: must contain the n diagonal elements of the diagonal matrix D from the LDLH factorization of A.
3:     e* – Complex (Kind=nag_wp) arrayInput
Note: the dimension of the array e must be at least max1,n-1.
On entry: must contain the n-1 subdiagonal elements of the unit lower bidiagonal matrix L. (e can also be regarded as the superdiagonal of the unit upper bidiagonal matrix U from the UHDU factorization of A.)
4:     anorm – Real (Kind=nag_wp)Input
On entry: the 1-norm of the original matrix A, which may be computed by calling f06upf with its argument norm='1'. anorm must be computed either before calling f07jrf (zpttrf) or else from a copy of the original matrix A.
Constraint: anorm0.0.
5:     rcond – Real (Kind=nag_wp)Output
On exit: the reciprocal condition number, 1/κ1A=1/A1A-11.
6:     rworkn – Real (Kind=nag_wp) arrayWorkspace
7:     info – IntegerOutput
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 condition number will be the exact condition number for a closely neighbouring matrix.

8
Parallelism and Performance

f07juf (zptcon) 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

The condition number estimation requires On  floating-point operations.
See Section 15.6 of Higham (2002) for further details on computing the condition number of tridiagonal matrices.
The real analogue of this routine is f07jgf (dptcon).

10
Example

This example computes the condition number of the Hermitian positive definite tridiagonal matrix A  given by
A = 16.0i+00.0 16.0-16.0i 0.0i+0.0 0.0i+0.0 16.0+16.0i 41.0i+00.0 18.0+9.0i 0.0i+0.0 0.0i+00.0 18.0-09.0i 46.0i+0.0 1.0+4.0i 0.0i+00.0 0.0i+00.0 1.0-4.0i 21.0i+0.0 .  

10.1
Program Text

Program Text (f07jufe.f90)

10.2
Program Data

Program Data (f07jufe.d)

10.3
Program Results

Program Results (f07jufe.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017