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 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 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 array b.
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)$ .

If $ifail = 0$ or $n + 1$ , the factor $U$ or $L$ from the Cholesky factorization $A = U^{H} U$ or $A = L L^{H}$ .
2: $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)$ .

If $ifail = 0$ or $n + 1$ , the $n$ by $r$ solution matrix $X$ .
3: $rcond$ – double scalar: If $ifail = 0$ or $n + 1$ , an estimate of the reciprocal of the condition number of the matrix $A$ , computed as $rcond = 1 / ({‖A‖}_{1} {‖A^{- 1}‖}_{1})$ .
4: $errbnd$ – double scalar: If $ifail = 0$ or $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.
5: $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$: The principal minor of order $_$ of the matrix $A$ is not positive definite. The factorization has not been completed and 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 = - 7$: 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 $2 \times n$ . Allocation failed before the solution could be computed.

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_posdef_solve (f04cd) 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} + 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.

The real analogue of nag_linsys_complex_posdef_solve (f04cd) is nag_linsys_real_posdef_solve (f04bd).

Example

This example solves the equations

A X = B,

where

A

is the Hermitian positive definite matrix

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

and

B = (\begin{array}{r} 3.93 - 6.14 i & 1.48 + 6.58 i \\ 6.17 + 9.42 i & 4.65 - 4.75 i \\ - 7.17 - 21.83 i & - 4.91 + 2.29 i \\ 1.99 - 14.38 i & 7.64 - 10.79 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: f04cd_example

function f04cd_example


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

% Solve complex Ax = b for Hermitian A with error bound and condition number
uplo = 'Upper';
cz = complex(0);
a = [3.23,  1.51 - 1.92i,  1.90 + 0.84i,  0.42 + 2.50i;
      cz,   3.58 + 0i,    -0.23 + 1.11i, -1.18 + 1.37i;
      cz,    cz,           4.09 + 0i,     2.33 - 0.14i;
      cz,    cz,            cz,           4.29 + 0i];
b = [ 3.93 -  6.14i,  1.48 +  6.58i;
      6.17 +  9.42i,  4.65 -  4.75i;
     -7.17 - 21.83i, -4.91 +  2.29i;
      1.99 - 14.38i,  7.64 - 10.79i];

[a, x, rcond, errbnd, ifail] = ...
  f04cd(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);

f04cd example results

Solution
   1.0000 - 1.0000i  -1.0000 + 2.0000i
  -0.0000 + 3.0000i   3.0000 - 4.0000i
  -4.0000 - 5.0000i  -2.0000 + 3.0000i
   2.0000 + 1.0000i   4.0000 - 5.0000i

Estimate of condition number
     151.4

Estimate of error bound for computed solutions
   1.7e-14

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

Chapter Contents

Chapter Introduction

NAG Toolbox