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

Parameters

Compulsory Input Parameters

1: $uplo$ – string (length ≥ 1)

Specifies how

A

has been factorized.

$uplo ='U'$: $A = U^{H} U$ , where $U$ is upper triangular.
$uplo ='L'$: $A = L L^{H}$ , where $L$ is lower triangular.

Constraint:

uplo ='U'

'L'

2: $n$ – int64int32nag_int scalar

n

, the order of the matrix

A

Constraint:

n \geq 0

3: $ap (:)$ – complex array

The dimension of the array ap must be at least

\max (1, n \times (n + 1) / 2)

The Cholesky factor of

A

stored in packed form, as returned by nag_lapack_zpptrf (f07gr).

4: $anorm$ – double scalar

The

1

-norm of the original matrix

A

. anorm must be computed either before calling nag_lapack_zpptrf (f07gr) or else from a copy of the original matrix

A

Constraint:

anorm \geq 0.0

Optional Input Parameters

None.

Output Parameters

1: $rcond$ – double scalar: 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.
2: $info$ – int64int32nag_int scalar: $info = 0$ unless the function detects an error (see Error Indicators and Warnings).

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.

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.

Further Comments

A call to nag_lapack_zppcon (f07gu) involves solving a number of systems of linear equations of the form

A 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 nag_lapack_zpptrs (f07gs) with one right-hand side, because extra care is taken to avoid overflow when

A

is approximately singular.

The real analogue of this function is nag_lapack_dppcon (f07gg).

Example

This example estimates the condition number in the

1

-norm (or

\infty

-norm) of the matrix

A

, where

A = (\begin{array}{r} 3.23 + 0.00 i & 1.51 - 1.92 i & 1.90 + 0.84 i & 0.42 + 2.50 i \\ 1.51 + 1.92 i & 3.58 + 0.00 i & - 0.23 + 1.11 i & - 1.18 + 1.37 i \\ 1.90 - 0.84 i & - 0.23 - 1.11 i & 4.09 + 0.00 i & 2.33 - 0.14 i \\ 0.42 - 2.50 i & - 1.18 - 1.37 i & 2.33 + 0.14 i & 4.29 + 0.00 i \end{array}) .

Here

A

is Hermitian positive definite, stored in packed form, and must first be factorized by nag_lapack_zpptrf (f07gr). The true condition number in the

1

-norm is

201.92

Open in the MATLAB editor: f07gu_example

function f07gu_example


fprintf('f07gu example results\n\n');

uplo = 'L';
n = int64(4);
ap = [3.23 + 0i    1.51 + 1.92i    1.90 - 0.84i    0.42 - 2.50i ...
                   3.58 + 0i      -0.23 - 1.11i   -1.18 - 1.37i ...
                                   4.09 + 0.00i    2.33 + 0.14i ...
                                                   4.29 + 0.00i];

[L, info] = f07gr( ...
                     uplo, n, ap);

anorm = norm([ap(4) ap(7) ap(9) ap(10)], 1);

[rcond, info] = f07gu( ...
                       uplo, n, L, anorm);

fprintf('Estimate of condition number = %9.2e\n', 1/rcond);

f07gu example results

Estimate of condition number =  1.51e+02

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox