PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_matop_complex_gen_matrix_frcht_pow (f01kf)
Purpose
nag_matop_complex_gen_matrix_frcht_pow (f01kf) computes the Fréchet derivative of the th power (where is real) of the complex by matrix applied to the complex by matrix . The principal matrix power is also returned.
Syntax
[
a,
e,
ifail] = nag_matop_complex_gen_matrix_frcht_pow(
a,
e,
p, 'n',
n)
Description
For a matrix
with no eigenvalues on the closed negative real line,
(
) can be defined as
where
is the principal logarithm of
(the unique logarithm whose spectrum lies in the strip
). If
is nonsingular but has negative real eigenvalues, the principal logarithm is not defined, but a non-principal
th power can be defined by using a non-principal logarithm.
The Fréchet derivative of the matrix
th power of
is the unique linear mapping
such that for any matrix
The derivative describes the first-order effect of perturbations in on the matrix power .
nag_matop_complex_gen_matrix_frcht_pow (f01kf) uses the algorithms of
Higham and Lin (2011) and
Higham and Lin (2013) to compute
and
. The real number
is expressed as
where
and
. Then
. The integer power
is found using a combination of binary powering and, if necessary, matrix inversion. The fractional power
is computed using a Schur decomposition, a Padé approximant and the scaling and squaring method. The Padé approximant is differentiated in order to obtain the Fréchet derivative of
and
is then computed using a combination of the chain rule and the product rule for Fréchet derivatives.
References
Higham N J (2008) Functions of Matrices: Theory and Computation SIAM, Philadelphia, PA, USA
Higham N J and Lin L (2011) A Schur–Padé algorithm for fractional powers of a matrix SIAM J. Matrix Anal. Appl. 32(3) 1056–1078
Higham N J and Lin L (2013) An improved Schur–Padé algorithm for fractional powers of a matrix and their Fréchet derivatives
MIMS Eprint 2013.1 Manchester Institute for Mathematical Sciences, School of Mathematics, University of Manchester
http://eprints.ma.man.ac.uk/
Parameters
Compulsory Input Parameters
- 1:
– complex array
-
The first dimension of the array
a must be at least
.
The second dimension of the array
a must be at least
.
The by matrix .
- 2:
– complex array
-
The first dimension of the array
e must be at least
.
The second dimension of the array
e must be at least
.
The by matrix .
- 3:
– double scalar
-
The required power of .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the first dimension of the arrays
a,
e and the second dimension of the array
a. (An error is raised if these dimensions are not equal.)
, the order of the matrix .
Constraint:
.
Output Parameters
- 1:
– complex array
-
The first dimension of the array
a will be
.
The second dimension of the array
a will be
.
The by principal matrix th power, . Alternatively if , a non-principal th power is returned.
- 2:
– complex array
-
The first dimension of the array
e will be
.
The second dimension of the array
e will be
.
The Fréchet derivative .
- 3:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
Errors or warnings detected by the function:
-
-
has eigenvalues on the negative real line. The principal th power is not defined in this case, so a non-principal power was returned.
-
-
is singular so the th power cannot be computed.
-
-
has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.
-
-
An unexpected internal error occurred. This failure should not occur and suggests that the function has been called incorrectly.
-
-
Constraint: .
-
-
Constraint: .
-
-
Constraint: .
-
An unexpected error has been triggered by this routine. Please
contact
NAG.
-
Your licence key may have expired or may not have been installed correctly.
-
Dynamic memory allocation failed.
Accuracy
For a normal matrix
(for which
), the Schur decomposition is diagonal and the computation of the fractional part of the matrix power reduces to evaluating powers of the eigenvalues of
and then constructing
using the Schur vectors. This should give a very accurate result. In general, however, no error bounds are available for the algorithm. See
Higham and Lin (2011) and
Higham and Lin (2013) for details and further discussion.
If the condition number of the matrix power is required then
nag_matop_complex_gen_matrix_cond_pow (f01ke) should be used.
Further Comments
The complex allocatable memory required by the algorithm is approximately .
The cost of the algorithm is
floating-point operations; see
Higham and Lin (2011) and
Higham and Lin (2013).
If the matrix
th power alone is required, without the Fréchet derivative, then
nag_matop_complex_gen_matrix_pow (f01fq) should be used. If the condition number of the matrix power is required then
nag_matop_complex_gen_matrix_cond_pow (f01ke) should be used. The real analogue of this function is
nag_matop_real_gen_matrix_frcht_pow (f01jf).
Example
This example finds
and the Fréchet derivative of the matrix power
, where
,
Open in the MATLAB editor:
f01kf_example
function f01kf_example
fprintf('f01kf example results\n\n');
a = [ 2 3 2 1+3i;
2+i 1 1 2+ i;
0+i 2+2i 0+2i 0+4i;
3 0+ i 3 1];
e = [ 0+i 3 2 1+3i;
0+i 1 3+3i 0+ i;
0+i 2+2i 0+2i 0;
2 0+ i 1 1];
p = 0.2;
[pa, lpae, ifail] = f01kf(a,e,p);
disp('A^p:');
disp(pa);
disp('L_p(A,E):');
disp(lpae);
f01kf example results
A^p:
1.2029 - 0.0424i 0.0810 + 0.0428i 0.2374 - 0.1718i -0.0520 + 0.0976i
0.1311 - 0.0378i 1.1054 + 0.1091i -0.0757 + 0.0066i 0.2308 + 0.1373i
-0.0305 - 0.1948i 0.4878 + 0.2846i 1.0822 + 0.2620i -0.1050 + 0.3131i
0.3401 + 0.1792i -0.3005 - 0.0857i 0.1838 - 0.0261i 1.2347 - 0.1571i
L_p(A,E):
0.0980 - 0.0926i -0.0980 + 0.2759i 0.0410 - 0.2629i 0.0136 + 0.1853i
-0.0644 + 0.3359i -0.2093 - 0.3976i 0.4315 + 0.0395i 0.1337 - 0.0976i
0.1912 + 0.0032i 0.2279 + 0.3308i -0.0963 + 0.1146i -0.0925 - 0.3254i
-0.0907 + 0.1255i -0.0153 - 0.4022i 0.1299 + 0.0694i 0.2238 + 0.1179i
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015