hide long namesshow long names

hide short namesshow short names

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_matop_complex_gen_matrix_fun_usd (f01fm)

▸▿ Contents

1 Purpose

2 Syntax

3 Description

4 References

▸▿ 5 Parameters

5.1 Compulsory Input Parameters

5.2 Optional Input Parameters

5.3 Output Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

Purpose

nag_matop_complex_gen_matrix_fun_usd (f01fm) computes the matrix function,

f (A)

, of a complex

n

by

n

matrix

A

, using analytical derivatives of

f

you have supplied.

Syntax

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

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

Description

f (A)

is computed using the Schur–Parlett algorithm described in Higham (2008) and Davies and Higham (2003).

The scalar function

f

, and the derivatives of

f

, are returned by the function f which, given an integer

m

, should evaluate

f^{(m)} (z_{i})

at a number of points

z_{i}

, for

i = 1, 2, \dots, n_{z}

, on the complex plane. nag_matop_complex_gen_matrix_fun_usd (f01fm) is therefore appropriate for functions that can be evaluated on the complex plane and whose derivatives, of arbitrary order, can also be evaluated on the complex plane.

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

Parameters

Compulsory Input Parameters

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

.

2: $f$ – function handle or string containing name of m-file

Given an integer

m

, the function f evaluates

f^{(m)} (z_{i})

at a number of points

z_{i}

.

[iflag, fz, user] = f(m, iflag, nz, z, user)

Input Parameters

1: $m$ – int64int32nag_int scalar: The order, $m$ , of the derivative required.
If $m = 0$ , $f (z_{i})$ should be returned. For $m > 0$ , $f^{(m)} (z_{i})$ should be returned.
2: $iflag$ – int64int32nag_int scalar: iflag will be zero.
3: $nz$ – int64int32nag_int scalar: $n_{z}$ , the number of function or derivative values required.
4: $z (nz)$ – complex array: The $n_{z}$ points $z_{1}, z_{2}, \dots, z_{n_{z}}$ at which the function $f$ is to be evaluated.
5: $user$ – Any MATLAB object: f is called from nag_matop_complex_gen_matrix_fun_usd (f01fm) with the object supplied to nag_matop_complex_gen_matrix_fun_usd (f01fm).

Output Parameters

1: $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 (z)$ ; for instance $f (z_{i})$ may not be defined for a particular $z_{i}$ . If iflag is returned as nonzero then nag_matop_complex_gen_matrix_fun_usd (f01fm) will terminate the computation, with $ifail = 2$ .
2: $fz (nz)$ – complex array: The $n_{z}$ function or derivative values. $fz (i)$ should return the value $f^{(m)} (z_{i})$ , for $i = 1, 2, \dots, n_{z}$ .
3: $user$ – Any MATLAB object

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$ .
2: $user$ – Any MATLAB object: user is not used by nag_matop_complex_gen_matrix_fun_usd (f01fm), 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: $a (lda :)$ – complex array: The first dimension of the array a will be $n$ .
The second dimension of the array a will be $n$ .

The $n$ by $n$ matrix, $f (A)$ .
2: $user$ – Any MATLAB object
3: $iflag$ – int64int32nag_int scalar: $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 $ifail = 2$ .
4: $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:

$ifail = 1$: A Taylor series failed to converge.

$ifail = 2$: iflag has been set nonzero by the user.

$ifail = 3$: 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.

$ifail = 4$: 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.

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

$ifail = - 1$: Input argument number $_$ is invalid.

$ifail = - 3$: On entry, argument lda is invalid.
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 Schur decomposition is diagonal and the algorithm reduces to evaluating

f

at the eigenvalues of

A

and then constructing

f (A)

using the Schur vectors. This should give a very accurate result. In general, however, no error bounds are available for the algorithm. See Section 9.4 of Higham (2008) for further discussion of the Schur–Parlett algorithm.

Further Comments

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 evaluating

f

and its derivatives. If the derivatives of

f

are not known analytically, then nag_matop_complex_gen_matrix_fun_num (f01fl) can be used to evaluate

f (A)

using numerical differentiation. 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_usd (f01fm).

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_usd (f01kc) should be used.

nag_matop_real_gen_matrix_fun_usd (f01em) can be used to find the matrix function

f (A)

for a real matrix

A

.

Example

This example finds the

e^{3 A}

where

A = (\begin{array}{r} 1.0 + 0.0 i & 0.0 + 0.0 i & 1.0 + 0.0 i & 0.0 + 2.0 i \\ 0.0 + 1.0 i & 1.0 + 0.0 i & - 1.0 + 0.0 i & 1.0 + 0.0 i \\ - 1.0 + 0.0 i & 0.0 + 1.0 i & 0.0 + 1.0 i & 0.0 + 1.0 i \\ 1.0 + 1.0 i & 0.0 + 2.0 i & - 1.0 + 0.0 i & 0.0 + 1.0 i \end{array}) .

Open in the MATLAB editor: f01fm_example

function f01fm_example


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

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

% Compute exp(3*a)
[exp3a, user, iflag, ifail] = f01fm(a, @f);

disp('f(A) = exp(3A)');
disp(exp3a);



function [iflag, fz, user] = f(m, iflag, nz, z, user)
  fz = double(3^m)*exp(3*z);

f01fm example results

f(A) = exp(3A)
 -10.3264 +14.8082i  -1.4883 +74.3369i -12.1206 -47.0956i  41.5622 +32.2927i
  63.3909 -40.5336i -21.0117 -62.7073i  16.5106 +35.2787i  -5.1725 +17.9413i
  -6.3954 +56.4708i  25.4246 +13.8034i -14.4937 - 9.2397i -20.3167 + 2.8647i
  31.4957 +23.2757i  28.6003 +21.4573i -23.8034 -11.6547i  23.9841 +18.7737i

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

Chapter Contents

Chapter Introduction

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