F01 Chapter Contents
F01 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF01FCF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F01FCF computes the matrix exponential, ${e}^{A}$, of a complex $n$ by $n$ matrix $A$.

## 2  Specification

 SUBROUTINE F01FCF ( N, A, LDA, IFAIL)
 INTEGER N, LDA, IFAIL COMPLEX (KIND=nag_wp) A(LDA,*)

## 3  Description

${e}^{A}$ is computed using a Padé approximant and the scaling and squaring method described in Higham (2005) and Higham (2008).
If $A$ has a full set of eigenvectors $V$ then $A$ can be factorized as
 $A = V D V-1 ,$
where $D$ is the diagonal matrix whose diagonal elements, ${d}_{i}$, are the eigenvalues of $A$. ${e}^{A}$ is then given by
 $eA = V eD V-1 ,$
where ${e}^{D}$ is the diagonal matrix whose $i$th diagonal element is ${e}^{{d}_{i}}$.
Note that ${e}^{A}$ is not computed this way as to do so would, in general, be unstable.

## 4  References

Higham N J (2005) The scaling and squaring method for the matrix exponential revisited SIAM J. Matrix Anal. Appl. 26(4) 1179–1193
Higham N J (2008) Functions of Matrices: Theory and Computation SIAM, Philadelphia, PA, USA
Moler C B and Van Loan C F (2003) Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later SIAM Rev. 45 3–49

## 5  Parameters

1:     N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
2:     A(LDA,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least ${\mathbf{N}}$.
On entry: the $n$ by $n$ matrix $A$.
On exit: with ${\mathbf{IFAIL}}={\mathbf{0}}$, the $n$ by $n$ matrix exponential, ${e}^{A}$.
3:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F01FCF is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
4:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is $0$. When the value $-\mathbf{1}\text{​ or ​}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit: ${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{1}}$, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
If ${\mathbf{IFAIL}}=-{\mathbit{i}}$, the $i$th argument had an illegal value.
${\mathbf{IFAIL}}=-999$
Internal memory allocation failed.
The INTEGER allocatable memory required is N, and the complex allocatable memory required is approximately $6×{{\mathbf{N}}}^{2}$.
Note: these failures should not occur, and suggest that the routine has been called incorrectly.
If ${\mathbf{IFAIL}}\le \mathbf{N}$, the linear equations to be solved for the Padé approximant are singular.
If ${\mathbf{IFAIL}}=\mathbf{N}+{\mathbf{1}}$, the linear equations to be solved are nearly singular and the Padé approximant probably has no correct figures.
${\mathbf{IFAIL}}={\mathbf{N}}+2$
${e}^{A}$ has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.

## 7  Accuracy

For a normal matrix $A$ (for which ${A}^{\mathrm{H}}A=A{A}^{\mathrm{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 Section 10.3 of Higham (2008) for details and further discussion.
For discussion of the condition of the matrix exponential see Section 10.2 of Higham (2008).

The cost of the algorithm is $O\left({n}^{3}\right)$; see Algorithm 10.20 in Higham (2008).
If estimates of the condition number of the matrix exponential are required then F01KAF 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).

## 9  Example

This example find the matrix exponential of the matrix
 $A = 1+2i 2+2i 2+2i 2+i 3+2i 1 1 2+i 3+2i 2+2i 1 2+i 3+2i 3+2i 3+2i 1+i .$

### 9.1  Program Text

Program Text (f01fcfe.f90)

### 9.2  Program Data

Program Data (f01fcfe.d)

### 9.3  Program Results

Program Results (f01fcfe.r)