Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug

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

Parameters

Compulsory Input Parameters

1: $uplo$ – string (length ≥ 1): If $uplo ='U'$ , the upper triangle of the matrix $A$ is stored.
If $uplo ='L'$ , the lower triangle of the matrix $A$ is stored.

Constraint: $uplo ='U'$ or $'L'$ .
2: $a (lda :)$ – complex array: The first dimension of the array a must be at least $\max (1, n)$ .
The second dimension of the array a must be at least $\max (1, n)$ .

The $n$ by $n$ Hermitian matrix $A$ .
If $uplo ='U'$ , the leading n by n upper triangular part of the array a contains the upper triangular part of the matrix $A$ , and the strictly lower triangular part of a is not referenced.

If $uplo ='L'$ , the leading n by n lower triangular part of the array a contains the lower triangular part of the matrix $A$ , and the strictly upper triangular part of a is not referenced.
3: $b (ldb :)$ – complex array: The first dimension of the array b must be at least $\max (1, n)$ .
The second dimension of the array b must be at least $\max (1, nrhs_p)$ .

The $n$ by $r$ matrix of right-hand sides $B$ .

Optional Input Parameters

1: $n$ – int64int32nag_int scalar: Default: the first dimension of the arrays a, b and the second dimension of the array a.
The number of linear equations $n$ , i.e., the order of the matrix $A$ .

Constraint: $n \geq 0$ .
2: $nrhs_p$ – int64int32nag_int scalar: Default: the second dimension of the array b.
The number of right-hand sides $r$ , i.e., the number of columns of the matrix $B$ .

Constraint: $nrhs_p \geq 0$ .

Output Parameters

1: $a (lda :)$ – complex array

The first dimension of the array a will be

\max (1, n)

The second dimension of the array a will be

\max (1, n)

ifail \geq 0

, the block diagonal matrix

D

and the multipliers used to obtain the factor

U

L

from the factorization

A = U D U^{H}

A = L D L^{H}

as computed by nag_lapack_zhetrf (f07mr).

2: $ipiv (n)$ – int64int32nag_int array

ifail \geq 0

, details of the interchanges and the block structure of

D

, as determined by nag_lapack_zhetrf (f07mr).

If $ipiv (k) > 0$ , then rows and columns $k$ and $ipiv (k)$ were interchanged, and $d_{k k}$ is a $1$ by $1$ diagonal block;
if $uplo ='U'$ and $ipiv (k) = ipiv (k - 1) < 0$ , then rows and columns $k - 1$ and $- ipiv (k)$ were interchanged and $d_{k - 1 : k, k - 1 : k}$ is a $2$ by $2$ diagonal block;
if $uplo ='L'$ and $ipiv (k) = ipiv (k + 1) < 0$ , then rows and columns $k + 1$ and $- ipiv (k)$ were interchanged and $d_{k : k + 1, k : k + 1}$ is a $2$ by $2$ diagonal block.

3: $b (ldb :)$ – complex array

The first dimension of the array b will be

\max (1, n)

The second dimension of the array b will be

\max (1, nrhs_p)

ifail = 0

n + 1

, the

n

r

solution matrix

X

4: $rcond$ – double scalar

If no constraints are violated, an estimate of the reciprocal of the condition number of the matrix

A

, computed as

rcond = 1 / ({‖A‖}_{1} {‖A^{- 1}‖}_{1})

5: $errbnd$ – double scalar

ifail = 0

n + 1

, an estimate of the forward error bound for a computed solution

\hat{x}

, such that

{‖\hat{x} - x‖}_{1} / {‖x‖}_{1} \leq errbnd

, where

\hat{x}

is a column of the computed solution returned in the array b and

x

is the corresponding column of the exact solution

X

. If rcond is less than machine precision, then errbnd is returned as unity.

6: $ifail$ – int64int32nag_int scalar

ifail = 0

unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

$ifail > 0 and ifail \leq n$: Diagonal block $_$ of the block diagonal matrix is zero. The factorization has been completed, but the solution could not be computed.

W $ifail = n + 1$: A solution has been computed, but rcond is less than machine precision so that the matrix $A$ is numerically singular.

$ifail = - 1$: On entry, uplo not one of 'U' or 'u' or 'L' or 'l'.

$ifail = - 2$: Constraint: $n \geq 0$ .

$ifail = - 3$: Constraint: $nrhs_p \geq 0$ .

$ifail = - 5$: Constraint: $lda \geq \max (1, n)$ .

$ifail = - 8$: Constraint: $ldb \geq \max (1, n)$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.

$ifail = - 999$: Dynamic memory allocation failed.
The double allocatable memory required is n, and the complex allocatable memory required is $\max (2 \times n, lwork)$ , where lwork is the optimum workspace required by nag_lapack_zhesv (f07mn). If this failure occurs it may be possible to solve the equations by calling the packed storage version of nag_linsys_complex_herm_solve (f04ch), nag_linsys_complex_herm_packed_solve (f04cj), or by calling nag_lapack_zhesv (f07mn) directly with less than the optimum workspace (see Chapter F07).

Accuracy

The computed solution for a single right-hand side,

\hat{x}

, satisfies an equation of the form

(A + E) \hat{x} = b,

where

{‖E‖}_{1} = O (ε) {‖A‖}_{1}

and

ε

is the machine precision. An approximate error bound for the computed solution is given by

\frac{{‖\hat{x} - x‖}_{1}}{{‖x‖}_{1}} \leq κ (A) \frac{{‖E‖}_{1}}{{‖A‖}_{1}},

where

κ (A) = {‖A^{- 1}‖}_{1} {‖A‖}_{1}

, the condition number of

A

with respect to the solution of the linear equations. nag_linsys_complex_herm_solve (f04ch) uses the approximation

{‖E‖}_{1} = ε {‖A‖}_{1}

to estimate errbnd. See Section 4.4 of Anderson et al. (1999) for further details.

Further Comments

The total number of floating-point operations required to solve the equations

A X = B

is proportional to

(\frac{1}{3} n^{3} + 2 n^{2} r)

. The condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization.

In practice the condition number estimator is very reliable, but it can underestimate the true condition number; see Section 15.3 of Higham (2002) for further details.

Function nag_linsys_complex_symm_solve (f04dh) is for complex symmetric matrices, and the real analogue of nag_linsys_complex_herm_solve (f04ch) is nag_linsys_real_symm_solve (f04bh).

Example

This example solves the equations

A X = B,

where

A

is the Hermitian indefinite matrix

A = (\begin{array}{r} - 1.84 & 0.11 - 0.11 i & - 1.78 - 1.18 i & 3.91 - 1.50 i \\ 0.11 + 0.11 i & - 4.63 & - 1.84 + 0.03 i & 2.21 + 0.21 i \\ - 1.78 + 1.18 i & - 1.84 - 0.03 i & - 8.87 & 1.58 - 0.90 i \\ 3.91 + 1.50 i & 2.21 - 0.21 i & 1.58 + 0.90 i & - 1.36 \end{array})

and

B = (\begin{array}{r} 2.98 - 10.18 i & 28.68 - 39.89 i \\ - 9.58 + 3.88 i & - 24.79 - 8.40 i \\ - 0.77 - 16.05 i & 4.23 - 70.02 i \\ 7.79 + 5.48 i & - 35.39 + 18.01 i \end{array}) .

An estimate of the condition number of

A

and an approximate error bound for the computed solutions are also printed.

Open in the MATLAB editor: f04ch_example

function f04ch_example


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

% Solve complex Ax = b for Hermitian A with error bound and condition number
cz = complex(0);
uplo = 'Upper';
a = [-1.84,  0.11 - 0.11i, -1.78 - 1.18i,  3.91 - 1.50i;
        cz, -4.63 + 0i,    -1.84 + 0.03i,  2.21 + 0.21i;
        cz,         cz,    -8.87 + 0i,     1.58 - 0.90i;
        cz,         cz,            cz,    -1.36 + 0i];
b = [ 2.98 - 10.18i,  28.68 - 39.89i;
     -9.58 +  3.88i, -24.79 -  8.40i;
     -0.77 - 16.05i,   4.23 - 70.02i;
      7.79 +  5.48i, -35.39 + 18.01i];

[a, ipiv, x, rcond, errbnd, ifail] = ...
  f04ch(uplo, a, b);

disp('Solution');
disp(x);
disp('Estimate of condition number');
fprintf('%10.1f\n\n',1/rcond);
disp('Estimate of error bound for computed solutions');
fprintf('%10.1e\n\n',errbnd);

f04ch example results

Solution
   2.0000 + 1.0000i  -8.0000 + 6.0000i
   3.0000 - 2.0000i   7.0000 - 2.0000i
  -1.0000 + 2.0000i  -1.0000 + 5.0000i
   1.0000 - 1.0000i   3.0000 - 4.0000i

Estimate of condition number
       6.7

Estimate of error bound for computed solutions
   7.4e-16

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

Chapter Contents

Chapter Introduction

NAG Toolbox