NAG Library Routine Document

Integer, Intent (In)	::	n, lda
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (In)	::	anorm
Real (Kind=nag_wp), Intent (Out)	::	rcond, rwork(2*n)
Complex (Kind=nag_wp), Intent (In)	::	a(lda,*)
Complex (Kind=nag_wp), Intent (Out)	::	work(2*n)
Character (1), Intent (In)	::	norm

C Header Interface

#include <nagmk26.h>

void	f07auf_ (const char norm, const Integer n, const Complex a[], const Integer lda, const double anorm, double rcond, Complex work[], double rwork[], Integer info, const Charlen length_norm)

The routine may be called by its LAPACK name zgecon.

3

Description

f07auf (zgecon) estimates the condition number of a complex matrix

A

, in either the

1

-norm or the

\infty

-norm:

κ_{1} (A) = {‖A‖}_{1} {‖A^{- 1}‖}_{1} or κ_{\infty} (A) = {‖A‖}_{\infty} {‖A^{- 1}‖}_{\infty} .

Note that

κ_{\infty} (A) = κ_{1} (A^{H})

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 should be preceded by a call to f06uaf to compute

{‖A‖}_{1}

{‖A‖}_{\infty}

, and a call to f07arf (zgetrf) to compute the

L U

factorization of

A

. The routine then uses Higham's implementation of Hager's method (see Higham (1988)) to estimate

{‖A^{- 1}‖}_{1}

{‖A^{- 1}‖}_{\infty}

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

κ_{1} (A)

κ_{\infty} (A)

is estimated.

$norm ='1'$ or $'O'$: $κ_{1} (A)$ is estimated.
$norm ='I'$: $κ_{\infty} (A)$ is estimated.

Constraint:

norm ='1'

'O'

'I'

2: $n$ – IntegerInput

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

3: $a (lda *)$ – Complex (Kind=nag_wp) arrayInput

Note: the second dimension of the array a must be at least

\max (1, n)

On entry: the

L U

factorization of

A

, as returned by f07arf (zgetrf).

4: $lda$ – IntegerInput

On entry: the first dimension of the array a as declared in the (sub)program from which f07auf (zgecon) is called.

Constraint:

lda \geq \max (1, n)

5: $anorm$ – Real (Kind=nag_wp)Input

On entry: if

norm ='1'

'O'

, the

1

-norm of the original matrix

A

norm ='I'

, the

\infty

-norm of the original matrix

A

anorm may be computed by calling f06uaf with the same value for the argument norm.

anorm must be computed either before calling f07arf (zgetrf) or else from a copy of the original matrix

A

(see Section 10).

Constraint:

anorm \geq 0.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 \times n)$ – Complex (Kind=nag_wp) arrayWorkspace

8: $rwork (2 \times n)$ – Real (Kind=nag_wp) arrayWorkspace

9: $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 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

f07auf (zgecon) 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 f07auf (zgecon) involves solving a number of systems of linear equations of the form

A x = b

A^{H} x = b

; the number is usually

5

and never more than

11

. Each solution involves approximately

8 n^{2}

real floating-point operations but takes considerably longer than a call to f07asf (zgetrs) 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 f07agf (dgecon).

10

Example

This example estimates the condition number in the

1

-norm of the matrix

A

, where

A = (\begin{array}{r} - 1.34 + 2.55 i & 0.28 + 3.17 i & - 6.39 - 2.20 i & 0.72 - 0.92 i \\ - 0.17 - 1.41 i & 3.31 - 0.15 i & - 0.15 + 1.34 i & 1.29 + 1.38 i \\ - 3.29 - 2.39 i & - 1.91 + 4.42 i & - 0.14 - 1.35 i & 1.72 + 1.35 i \\ 2.41 + 0.39 i & - 0.56 + 1.47 i & - 0.83 - 0.69 i & - 1.96 + 0.67 i \end{array}) .

Here

A

is nonsymmetric and must first be factorized by f07arf (zgetrf). The true condition number in the

1

-norm is

231.86

NAG Library Routine Document

f07auf (zgecon)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results