f01 Chapter Contents
f01 Chapter Introduction
NAG Library Manual

# NAG Library Function Documentnag_matop_complex_gen_matrix_cond_pow (f01kec)

## 1  Purpose

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

## 2  Specification

 #include #include
 void nag_matop_complex_gen_matrix_cond_pow (Integer n, Complex a[], Integer pda, double p, double *condpa, NagError *fail)

## 3  Description

For a matrix $A$ with no eigenvalues on the closed negative real line, ${A}^{p}$ ($p\in ℝ$) can be defined as
 $Ap= expplogA$
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+Ep - Ap - LA,E = oE .$
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 = LA A Ap ,$
where $‖L\left(A\right)‖$ is the norm of the Fréchet derivative of the matrix power at $A$.
nag_matop_complex_gen_matrix_cond_pow (f01kec) 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}}$, nag_matop_complex_gen_matrix_cond_pow (f01kec) 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 nag_matop_complex_gen_matrix_cond_pow (f01kec) will return a non-principal matrix $p$th power and its condition number.

## 4  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/

## 5  Arguments

1:     nIntegerInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
2:     a[$\mathit{dim}$]ComplexInput/Output
Note: the dimension, dim, of the array a must be at least ${\mathbf{pda}}×{\mathbf{n}}$.
The $\left(i,j\right)$th element of the matrix $A$ is stored in ${\mathbf{a}}\left[\left(j-1\right)×{\mathbf{pda}}+i-1\right]$.
On entry: the $n$ by $n$ matrix $A$.
On exit: the $n$ by $n$ principal matrix $p$th power, ${A}^{p}$, unless ${\mathbf{fail}}\mathbf{.}\mathbf{code}=$ NE_NEGATIVE_EIGVAL, in which case a non-principal $p$th power is returned.
3:     pdaIntegerInput
On entry: the stride separating matrix row elements in the array a.
Constraint: ${\mathbf{pda}}\ge {\mathbf{n}}$.
4:     pdoubleInput
On entry: the required power of $A$.
On exit: if ${\mathbf{fail}}\mathbf{.}\mathbf{code}=$ NE_NOERROR or NW_SOME_PRECISION_LOSS, an estimate of the relative condition number of the matrix $p$th power, ${\kappa }_{{A}^{p}}$. Alternatively, if ${\mathbf{fail}}\mathbf{.}\mathbf{code}=$ NE_RCOND, the absolute condition number of the matrix $p$th power.
6:     failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
On entry, argument $⟨\mathit{\text{value}}⟩$ had an illegal value.
NE_INT
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
NE_INT_2
On entry, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{pda}}\ge {\mathbf{n}}$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
NE_NEGATIVE_EIGVAL
$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.
NE_RCOND
The relative condition number is infinite. The absolute condition number was returned instead.
NE_SINGULAR
$A$ is singular so the $p$th power cannot be computed.
NW_SOME_PRECISION_LOSS
${A}^{p}$ has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.

## 7  Accuracy

nag_matop_complex_gen_matrix_cond_pow (f01kec) uses the norm estimation function nag_linsys_complex_gen_norm_rcomm (f04zdc) 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 nag_linsys_complex_gen_norm_rcomm (f04zdc).
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.

## 8  Parallelism and Performance

nag_matop_complex_gen_matrix_cond_pow (f01kec) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
nag_matop_complex_gen_matrix_cond_pow (f01kec) 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.

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 nag_matop_complex_gen_matrix_pow (f01fqc) should be used. If the Fréchet derivative of the matrix power is required then nag_matop_complex_gen_matrix_frcht_pow (f01kfc) should be used. The real analogue of this function is nag_matop_real_gen_matrix_cond_pow (f01jec).

## 10  Example

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.1  Program Text

Program Text (f01kece.c)

### 10.2  Program Data

Program Data (f01kece.d)

### 10.3  Program Results

Program Results (f01kece.r)