NAG FL Interfacef01kef (complex_​gen_​matrix_​cond_​pow)

▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

1Purpose

f01kef computes an estimate of the relative condition number ${\kappa }_{{A}^{p}}$ of the $p$th power (where $p$ is real) of a complex $n×n$ matrix $A$, in the $1$-norm. The principal matrix power ${A}^{p}$ is also returned.

2Specification

Fortran Interface
 Subroutine f01kef ( n, a, lda, p,
 Integer, Intent (In) :: n, lda Integer, Intent (Inout) :: ifail Real (Kind=nag_wp), Intent (In) :: p Real (Kind=nag_wp), Intent (Out) :: condpa Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*)
#include <nag.h>
 void f01kef_ (const Integer *n, Complex a[], const Integer *lda, const double *p, double *condpa, Integer *ifail)
The routine may be called by the names f01kef or nagf_matop_complex_gen_matrix_cond_pow.

3Description

For a matrix $A$ with no eigenvalues on the closed negative real line, ${A}^{p}$ ($p\in ℝ$) can be defined as
 $Ap= exp(plog(A))$
where $\mathrm{log}\left(A\right)$ is the principal logarithm of $A$ (the unique logarithm whose spectrum lies in the strip $\left\{z:-\pi <\mathrm{Im}\left(z\right)<\pi \right\}$).
The Fréchet derivative of the matrix $p$th power of $A$ is the unique linear mapping $E⟼L\left(A,E\right)$ such that for any matrix $E$
 $(A+E)p - Ap - L(A,E) = o(‖E‖) .$
The derivative describes the first-order effect of perturbations in $A$ on the matrix power ${A}^{p}$.
The relative condition number of the matrix $p$th power can be defined by
 $κAp = ‖L(A)‖ ‖A‖ ‖Ap‖ ,$
where $‖L\left(A\right)‖$ is the norm of the Fréchet derivative of the matrix power at $A$.
f01kef uses the algorithms of Higham and Lin (2011) and Higham and Lin (2013) to compute ${\kappa }_{{A}^{p}}$ and ${A}^{p}$. The real number $p$ is expressed as $p=q+r$ where $q\in \left(-1,1\right)$ and $r\in ℤ$. Then ${A}^{p}={A}^{q}{A}^{r}$. The integer power ${A}^{r}$ is found using a combination of binary powering and, if necessary, matrix inversion. The fractional power ${A}^{q}$ is computed using a Schur decomposition, a Padé approximant and the scaling and squaring method.
To obtain the estimate of ${\kappa }_{{A}^{p}}$, f01kef first estimates $‖L\left(A\right)‖$ by computing an estimate $\gamma$ of a quantity $K\in \left[{n}^{-1}{‖L\left(A\right)‖}_{1},n{‖L\left(A\right)‖}_{1}\right]$, such that $\gamma \le K$. This requires multiple Fréchet derivatives to be computed. Fréchet derivatives of ${A}^{q}$ are obtained by differentiating the Padé approximant. Fréchet derivatives of ${A}^{p}$ are then computed using a combination of the chain rule and the product rule for Fréchet derivatives.
If $A$ is nonsingular but has negative real eigenvalues f01kef will return a non-principal matrix $p$th power and its condition number.

4References

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 SIAM J. Matrix Anal. Appl. 34(3) 1341–1360

5Arguments

1: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
2: $\mathbf{a}\left({\mathbf{lda}},*\right)$Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least ${\mathbf{n}}$.
On entry: the $n×n$ matrix $A$.
On exit: the $n×n$ principal matrix $p$th power, ${A}^{p}$, unless ${\mathbf{ifail}}={\mathbf{1}}$, in which case a non-principal $p$th power is returned.
3: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f01kef is called.
Constraint: ${\mathbf{lda}}\ge {\mathbf{n}}$.
4: $\mathbf{p}$Real (Kind=nag_wp) Input
On entry: the required power of $A$.
5: $\mathbf{condpa}$Real (Kind=nag_wp) Output
On exit: if ${\mathbf{ifail}}={\mathbf{0}}$ or ${\mathbf{3}}$, an estimate of the relative condition number of the matrix $p$th power, ${\kappa }_{{A}^{p}}$. Alternatively, if ${\mathbf{ifail}}={\mathbf{4}}$, the absolute condition number of the matrix $p$th power.
6: $\mathbf{ifail}$Integer Input/Output
On entry: ifail must be set to $0$, $-1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $-1$ means that an error message is printed while a value of $1$ means that it is not.
If halting is not appropriate, the value $-1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $-\mathbf{1}$ 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).

6Error Indicators and Warnings

If on entry ${\mathbf{ifail}}=0$ or $-1$, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
${\mathbf{ifail}}=1$
$A$ has eigenvalues on the negative real line. The principal $p$th power is not defined in this case, so a non-principal power was returned.
${\mathbf{ifail}}=2$
$A$ is singular so the $p$th power cannot be computed.
${\mathbf{ifail}}=3$
${A}^{p}$ has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.
${\mathbf{ifail}}=4$
The relative condition number is infinite. The absolute condition number was returned instead.
${\mathbf{ifail}}=5$
An unexpected internal error occurred. This failure should not occur and suggests that the routine has been called incorrectly.
${\mathbf{ifail}}=-1$
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
${\mathbf{ifail}}=-3$
On entry, ${\mathbf{lda}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{lda}}\ge {\mathbf{n}}$.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7Accuracy

f01kef uses the norm estimation routine f04zdf to produce an estimate $\gamma$ of a quantity $K\in \left[{n}^{-1}{‖L\left(A\right)‖}_{1},n{‖L\left(A\right)‖}_{1}\right]$, such that $\gamma \le K$. For further details on the accuracy of norm estimation, see the documentation for f04zdf.
For a normal matrix $A$ (for which ${A}^{\mathrm{H}}A=A{A}^{\mathrm{H}}$), the Schur decomposition is diagonal and the computation of the fractional part of the matrix power reduces to evaluating powers of the eigenvalues of $A$ and then constructing ${A}^{p}$ 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.

8Parallelism and Performance

f01kef is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f01kef makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

The amount of complex allocatable memory required by the algorithm is typically of the order $10×{n}^{2}$.
The cost of the algorithm is $O\left({n}^{3}\right)$ floating-point operations; see Higham and Lin (2013).
If the matrix $p$th power alone is required, without an estimate of the condition number, then f01fqf should be used. If the Fréchet derivative of the matrix power is required then f01kff should be used. The real analogue of this routine is f01jef.

10Example

This example estimates the relative condition number of the matrix power ${A}^{p}$, where $p=0.4$ and
 $A = ( 1+2i 3 2 1+3i 1+i 1 1 2+i 1 2 1 2i 3 i 2+i 1 ) .$

10.1Program Text

Program Text (f01kefe.f90)

10.2Program Data

Program Data (f01kefe.d)

10.3Program Results

Program Results (f01kefe.r)