Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_matop_complex_gen_matrix_fun_num (f01fl)

## Purpose

nag_matop_complex_gen_matrix_fun_num (f01fl) computes the matrix function, $f\left(A\right)$, of a complex $n$ by $n$ matrix $A$. Numerical differentiation is used to evaluate the derivatives of $f$ when they are required.

## Syntax

[a, user, iflag, ifail] = f01fl(a, f, 'n', n, 'user', user)
[a, user, iflag, ifail] = nag_matop_complex_gen_matrix_fun_num(a, f, 'n', n, 'user', user)

## Description

$f\left(A\right)$ is computed using the Schur–Parlett algorithm described in Higham (2008) and Davies and Higham (2003). The coefficients of the Taylor series used in the algorithm are evaluated using the numerical differentiation algorithm of Lyness and Moler (1967).
The scalar function $f$ is supplied via function f which evaluates $f\left({z}_{i}\right)$ at a number of points ${z}_{i}$.

## References

Davies P I and Higham N J (2003) A Schur–Parlett algorithm for computing matrix functions. SIAM J. Matrix Anal. Appl. 25(2) 464–485
Higham N J (2008) Functions of Matrices: Theory and Computation SIAM, Philadelphia, PA, USA
Lyness J N and Moler C B (1967) Numerical differentiation of analytic functions SIAM J. Numer. Anal. 4(2) 202–210

## Parameters

### Compulsory Input Parameters

1:     $\mathrm{a}\left(\mathit{lda},:\right)$ – complex array
The first dimension of the array a must be at least ${\mathbf{n}}$.
The second dimension of the array a must be at least ${\mathbf{n}}$.
The $n$ by $n$ matrix $A$.
2:     $\mathrm{f}$ – function handle or string containing name of m-file
The function f evaluates $f\left({z}_{i}\right)$ at a number of points ${z}_{i}$.
[iflag, fz, user] = f(iflag, nz, z, user)

Input Parameters

1:     $\mathrm{iflag}$int64int32nag_int scalar
iflag will be zero.
2:     $\mathrm{nz}$int64int32nag_int scalar
${n}_{z}$, the number of function values required.
3:     $\mathrm{z}\left({\mathbf{nz}}\right)$ – complex array
The ${n}_{z}$ points ${z}_{1},{z}_{2},\dots ,{z}_{{n}_{z}}$ at which the function $f$ is to be evaluated.
4:     $\mathrm{user}$ – Any MATLAB object
f is called from nag_matop_complex_gen_matrix_fun_num (f01fl) with the object supplied to nag_matop_complex_gen_matrix_fun_num (f01fl).

Output Parameters

1:     $\mathrm{iflag}$int64int32nag_int scalar
iflag should either be unchanged from its entry value of zero, or may be set nonzero to indicate that there is a problem in evaluating the function $f\left({z}_{i}\right)$; for instance $f\left({z}_{i}\right)$ may not be defined. If iflag is returned as nonzero then nag_matop_complex_gen_matrix_fun_num (f01fl) will terminate the computation, with ${\mathbf{ifail}}={\mathbf{2}}$.
2:     $\mathrm{fz}\left({\mathbf{nz}}\right)$ – complex array
The ${n}_{z}$ function values. ${\mathbf{fz}}\left(\mathit{i}\right)$ should return the value $f\left({z}_{\mathit{i}}\right)$, for $\mathit{i}=1,2,\dots ,{n}_{z}$.
3:     $\mathrm{user}$ – Any MATLAB object

### Optional Input Parameters

1:     $\mathrm{n}$int64int32nag_int scalar
Default: the first dimension of the array a.
$n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
2:     $\mathrm{user}$ – Any MATLAB object
user is not used by nag_matop_complex_gen_matrix_fun_num (f01fl), but is passed to f. Note that for large objects it may be more efficient to use a global variable which is accessible from the m-files than to use user.

### Output Parameters

1:     $\mathrm{a}\left(\mathit{lda},:\right)$ – complex array
The first dimension of the array a will be ${\mathbf{n}}$.
The second dimension of the array a will be ${\mathbf{n}}$.
The $n$ by $n$ matrix, $f\left(A\right)$.
2:     $\mathrm{user}$ – Any MATLAB object
3:     $\mathrm{iflag}$int64int32nag_int scalar
${\mathbf{iflag}}=0$, unless iflag has been set nonzero inside f, in which case iflag will be the value set and ifail will be set to ${\mathbf{ifail}}={\mathbf{2}}$.
4:     $\mathrm{ifail}$int64int32nag_int scalar
${\mathbf{ifail}}={\mathbf{0}}$ unless the function detects an error (see Error Indicators and Warnings).

## Error Indicators and Warnings

Errors or warnings detected by the function:
${\mathbf{ifail}}=1$
A Taylor series failed to converge after $40$ terms. Further Taylor series coefficients can no longer reliably be obtained by numerical differentiation.
${\mathbf{ifail}}=2$
iflag has been set nonzero by the user.
${\mathbf{ifail}}=3$
The function was unable to compute the Schur decomposition of $A$.
Note:  this failure should not occur and suggests that the function has been called incorrectly.
There was an error whilst reordering the Schur form of $A$.
Note:  this failure should not occur and suggests that the function has been called incorrectly.
${\mathbf{ifail}}=5$
${\mathbf{ifail}}=-1$
Input argument number $_$ is invalid.
${\mathbf{ifail}}=-3$
On entry, argument lda is invalid.
Constraint: $\mathit{lda}\ge {\mathbf{n}}$.
${\mathbf{ifail}}=-99$
An unexpected error has been triggered by this routine. Please contact NAG.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.

## Accuracy

For a normal matrix $A$ (for which ${A}^{\mathrm{H}}A=A{A}^{\mathrm{H}}$) Schur decomposition is diagonal and the algorithm reduces to evaluating $f$ at the eigenvalues of $A$ and then constructing $f\left(A\right)$ using the Schur vectors. See Section 9.4 of Higham (2008) for further discussion of the Schur–Parlett algorithm, and Lyness and Moler (1967) for a discussion of numerical differentiation.

The integer allocatable memory required is $n$, and up to $6{n}^{2}$ of complex allocatable memory is required.
The cost of the Schur–Parlett algorithm depends on the spectrum of $A$, but is roughly between $28{n}^{3}$ and ${n}^{4}/3$ floating-point operations. There is an additional cost in numerically differentiating $f$, in order to obtain the Taylor series coefficients. If the derivatives of $f$ are known analytically, then nag_matop_complex_gen_matrix_fun_usd (f01fm) can be used to evaluate $f\left(A\right)$ more accurately. If $A$ is complex Hermitian then it is recommended that nag_matop_complex_herm_matrix_fun (f01ff) be used as it is more efficient and, in general, more accurate than nag_matop_complex_gen_matrix_fun_num (f01fl).
Note that $f$ must be analytic in the region of the complex plane containing the spectrum of $A$.
For further information on matrix functions, see Higham (2008).
If estimates of the condition number of the matrix function are required then nag_matop_complex_gen_matrix_cond_num (f01kb) should be used.
nag_matop_real_gen_matrix_fun_num (f01el) can be used to find the matrix function $f\left(A\right)$ for a real matrix $A$.

## Example

This example finds $\mathrm{sin}2A$ where
 $A= 1.0+0.0i 0.0+1.0i 1.0+0.0i 0.0+1.0i -1.0+0.0i 0.0+0.0i 2.0+1.0i 0.0+0.0i 0.0+0.0i 2.0+1.0i 0.0+2.0i 0.0+1.0i 1.0+0.0i 1.0+1.0i -1.0+0.0i 2.0+1.0i .$
```function f01fl_example

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

a = [1.0+0.0i, 0.0+1.0i,  1.0+0.0i, 0.0+1.0i;
-1.0+0.0i, 0.0+0.0i,  2.0+1.0i, 0.0+0.0i;
0.0+0.0i, 2.0+1.0i,  0.0+2.0i, 0.0+1.0i;
1.0+0.0i, 1.0+1.0i, -1.0+0.0i, 2.0+1.0i];

% Compute f(a)
[sin2a, user, iflag, ifail] = f01fl(a, @f);

disp('f(A) = sin(2A)');
disp(sin2a);

function [iflag, fz, user] = f(iflag, nz, z, user)
fz = sin(2*z);
```
```f01fl example results

f(A) = sin(2A)
1.1960 - 3.2270i -21.0733 - 9.6441i -15.4159 -14.1977i -12.4279 -11.9638i
3.2957 - 3.6334i -14.6084 -21.4846i  -6.7764 -24.1726i  -5.1338 -17.0926i
5.0928 - 3.7806i -14.6839 -34.5063i  -0.9231 -35.4729i  -2.0715 -26.3460i
-1.8349 + 0.0808i  -8.2484 - 0.4014i  -6.0093 - 1.6831i  -7.1318 - 1.9396i

```

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015