1: $a (lda :)$ – complex array: The first dimension of the array a must be at least $n$ .
The second dimension of the array a must be at least $n$ .

The $n$ by $n$ matrix $A$ .

Optional Input Parameters

1: $n$ – int64int32nag_int scalar: Default: the first dimension of the array a.
$n$ , the order of the matrix $A$ .

Constraint: $n \geq 0$ .

Output Parameters

1: $a (lda :)$ – complex array: The first dimension of the array a will be $n$ .
The second dimension of the array a will be $n$ .

With $ifail = 0$ , the $n$ by $n$ matrix exponential $e^{A}$ .
2: $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 = 1$: The linear equations to be solved for the Padé approximant are singular; it is likely that this function has been called incorrectly.

$ifail = 2$: The linear equations to be solved are nearly singular and the Padé approximant probably has no correct figures; it is likely that this function has been called incorrectly.

W $ifail = 3$: $e^{A}$ has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.

$ifail = 4$: An unexpected internal error has occurred. Please contact NAG.

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

$ifail = - 3$: Constraint: $lda \geq 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.

Accuracy

For a normal matrix

A

(for which

A^{H} A = A A^{H}

) the computed matrix,

e^{A}

, is guaranteed to be close to the exact matrix, that is, the method is forward stable. No such guarantee can be given for non-normal matrices. See Al–Mohy and Higham (2009) and Section 10.3 of Higham (2008) for details and further discussion.

If estimates of the condition number of the matrix exponential are required then nag_matop_complex_gen_matrix_cond_exp (f01kg) should be used.

Further Comments

The integer allocatable memory required is n, and the complex allocatable memory required is approximately

6 \times n^{2}

The cost of the algorithm is

O (n^{3})

; see Section 5 of Al–Mohy and Higham (2009). The complex allocatable memory required is approximately

6 \times n^{2}

If the Fréchet derivative of the matrix exponential is required then nag_matop_complex_gen_matrix_frcht_exp (f01kh) should be used.

As well as the excellent book cited above, the classic reference for the computation of the matrix exponential is Moler and Van Loan (2003).

Example

This example finds the matrix exponential of the matrix

A = (\begin{matrix} 1 + i & 2 + i & 2 + i & 2 + i \\ 3 + 2 i & 1 & 1 & 2 + i \\ 3 + 2 i & 2 + i & 1 & 2 + i \\ 3 + 2 i & 3 + 2 i & 3 + 2 i & 1 + i \end{matrix}) .

Open in the MATLAB editor: f01fc_example

function f01fc_example


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

a = [ 1 + 1i,  2 + 1i,  2 + 1i,  2 + 1i;
      3 + 2i,  1 + 0i,  1 + 0i,  2 + 1i;
      3 + 2i,  2 + 1i,  1 + 0i,  2 + 1i;
      3 + 2i,  3 + 2i,  3 + 2i,  1 + 1i];

% Compute exp(a)
[expa, ifail] = f01fc(a);

% Display results
[ifail] = x04da('g', ' ', expa, 'Exp(a)');

f01fc example results

 Exp(a)
             1          2          3          4
 1   -157.9003  -194.6526  -186.5627  -155.7669
     -754.3717  -555.0507  -475.4533  -520.1876

 2   -206.8899  -225.4985  -212.4414  -186.5627
     -694.7443  -505.3938  -431.0611  -475.4533

 3   -208.7476  -238.4962  -225.4985  -194.6526
     -808.2090  -590.8045  -505.3938  -555.0507

 4   -133.3958  -208.7476  -206.8899  -157.9003
    -1085.5496  -808.2090  -694.7443  -754.3717

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

Chapter Contents

Chapter Introduction

NAG Toolbox