NAG FL Interface
f07ugf (dtpcon)

1 Purpose

f07ugf estimates the condition number of a real triangular matrix, using packed storage.

2 Specification

Fortran Interface
Subroutine f07ugf ( norm, uplo, diag, n, ap, rcond, work, iwork, info)
Integer, Intent (In) :: n
Integer, Intent (Out) :: iwork(n), info
Real (Kind=nag_wp), Intent (In) :: ap(*)
Real (Kind=nag_wp), Intent (Out) :: rcond, work(3*n)
Character (1), Intent (In) :: norm, uplo, diag
C Header Interface
#include <nag.h>
void  f07ugf_ (const char *norm, const char *uplo, const char *diag, const Integer *n, const double ap[], double *rcond, double work[], Integer iwork[], Integer *info, const Charlen length_norm, const Charlen length_uplo, const Charlen length_diag)
The routine may be called by the names f07ugf, nagf_lapacklin_dtpcon or its LAPACK name dtpcon.

3 Description

f07ugf estimates the condition number of a real triangular matrix A, in either the 1-norm or the -norm, using packed storage:
κ1 A = A1 A-11   or   κ A = A A-1 .  
Note that κA=κ1AT.
Because the condition number is infinite if A is singular, the routine actually returns an estimate of the reciprocal of the condition number.
The routine computes A1 or A exactly, and uses Higham's implementation of Hager's method (see Higham (1988)) to estimate A-11 or A-1.

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: norm Character(1) Input
On entry: indicates whether κ1A or κA is estimated.
norm='1' or 'O'
κ1A is estimated.
norm='I'
κA is estimated.
Constraint: norm='1', 'O' or 'I'.
2: uplo Character(1) Input
On entry: specifies whether A is upper or lower triangular.
uplo='U'
A is upper triangular.
uplo='L'
A is lower triangular.
Constraint: uplo='U' or 'L'.
3: diag Character(1) Input
On entry: indicates whether A is a nonunit or unit triangular matrix.
diag='N'
A is a nonunit triangular matrix.
diag='U'
A is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be 1.
Constraint: diag='N' or 'U'.
4: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
5: ap* Real (Kind=nag_wp) array Input
Note: the dimension of the array ap must be at least max1,n×n+1/2.
On entry: the n by n triangular matrix A, packed by columns.
More precisely,
  • if uplo='U', the upper triangle of A must be stored with element Aij in api+jj-1/2 for ij;
  • if uplo='L', the lower triangle of A must be stored with element Aij in api+2n-jj-1/2 for ij.
If diag='U', the diagonal elements of A are assumed to be 1, and are not referenced; the same storage scheme is used whether diag='N' or ‘U’.
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: work3×n Real (Kind=nag_wp) array Workspace
8: iworkn 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

f07ugf 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 f07ugf involves solving a number of systems of linear equations of the form Ax=b or ATx=b; the number is usually 4 or 5 and never more than 11. Each solution involves approximately n2 floating-point operations but takes considerably longer than a call to f07uef with one right-hand side, because extra care is taken to avoid overflow when A is approximately singular.
The complex analogue of this routine is f07uuf.

10 Example

This example estimates the condition number in the 1-norm of the matrix A, where
A= 4.30 0.00 0.00 0.00 -3.96 -4.87 0.00 0.00 0.40 0.31 -8.02 0.00 -0.27 0.07 -5.95 0.12 ,  
using packed storage. The true condition number in the 1-norm is 116.41.

10.1 Program Text

Program Text (f07ugfe.f90)

10.2 Program Data

Program Data (f07ugfe.d)

10.3 Program Results

Program Results (f07ugfe.r)