NAG Library Routine Document
F01FJF
1 Purpose
F01FJF computes the principal matrix logarithm, $\mathrm{log}\left(A\right)$, of a complex $n$ by $n$ matrix $A$, with no eigenvalues on the closed negative real line.
2 Specification
INTEGER 
N, LDA, IFAIL 
COMPLEX (KIND=nag_wp) 
A(LDA,*) 

3 Description
Any nonsingular matrix $A$ has infinitely many logarithms. For a matrix with no eigenvalues on the closed negative real line, the principal logarithm is the unique logarithm whose spectrum lies in the strip $\left\{z:\pi <\mathrm{Im}\left(z\right)<\pi \right\}$. If $A$ is nonsingular but has eigenvalues on the negative real line, the principal logarithm is not defined, but F01FJF will return a nonprincipal logarithm.
$\mathrm{log}\left(A\right)$ is computed using the Schur–Parlett algorithm for the matrix logarithm described in
Higham (2008) and
Davies and Higham (2003).
4 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
5 Parameters
 1: N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint:
${\mathbf{N}}\ge 0$.
 2: A(LDA,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output

Note: the second dimension of the array
A
must be at least
${\mathbf{N}}$.
On entry: the $n$ by $n$ matrix $A$.
On exit: the $n$ by $n$ principal matrix logarithm, $\mathrm{log}\left(A\right)$, unless ${\mathbf{IFAIL}}={\mathbf{4}}$, in which case a nonprincipal logarithm is returned.
 3: LDA – INTEGERInput
On entry: the first dimension of the array
A as declared in the (sub)program from which F01FJF is called.
Constraint:
${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
 4: IFAIL – INTEGERInput/Output

On entry:
IFAIL must be set to
$0$,
$1\text{ or}1$. If you are unfamiliar with this parameter you should refer to
Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{ or}1$ is recommended. If the output of error messages is undesirable, then the value
$1$ is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is
$0$.
When the value $\mathbf{1}\text{ 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).
6 Error Indicators and Warnings
If on entry
${\mathbf{IFAIL}}={\mathbf{0}}$ or
${{\mathbf{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$ is singular so the logarithm cannot be computed.
 ${\mathbf{IFAIL}}=2$

$A$ was found to have eigenvalues on the negative real line.
The principal logarithm is not defined in this case,
so a nonprincipal logarithm was returned.
 ${\mathbf{IFAIL}}=3$

The arithmetic precision is higher than that used for the Padé approximant computed matrix logarithm.
 ${\mathbf{IFAIL}}=4$

An unexpected internal error has occurred. Please contact
NAG.
 ${\mathbf{IFAIL}}=1$

On entry, ${\mathbf{N}}=\u27e8\mathit{\text{value}}\u27e9$.
Constraint: ${\mathbf{N}}\ge 0$.
 ${\mathbf{IFAIL}}=3$

On entry, ${\mathbf{LDA}}=\u27e8\mathit{\text{value}}\u27e9$ and ${\mathbf{N}}=\u27e8\mathit{\text{value}}\u27e9$.
Constraint: ${\mathbf{LDA}}\ge {\mathbf{N}}$.
 ${\mathbf{IFAIL}}=999$

Allocation of memory failed. The
complex
allocatable memory required is approximately $3{{\mathbf{N}}}^{2}$.
7 Accuracy
For a normal matrix
$A$ (for which
${A}^{\mathrm{H}}A=A{A}^{\mathrm{H}}$), the Schur decomposition is diagonal and the algorithm reduces to evaluating the logarithm of the eigenvalues of
$A$ and then constructing
$\mathrm{log}\left(A\right)$ 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 details and further discussion.
For discussion of the condition of the matrix logarithm see Section 11.2 of
Higham (2008).
In particular, the condition number of the matrix logarithm at
$A$,
${\kappa}_{\mathrm{log}}\left(A\right)$, which is a measure of the sensitivity of the computed logarithm to perturbations in the matrix
$A$, satisfies
where
$\kappa \left(A\right)$ is the condition number of
$A$. Further, the sensitivity of the computation of
$\mathrm{log}\left(A\right)$ is worst when
$A$ has an eigenvalue of very small modulus, or has a complex conjugate pair of eigenvalues lying close to the negative real axis.
Up to $4{n}^{2}$ of
complex
allocatable memory may be required.
The cost of the algorithm is
$O\left({n}^{3}\right)$ floating point operations. The exact cost depends on the eigenvalue distribution of
$A$; see Algorithm 11.11 of
Higham (2008).
If estimates of the condition number of the matrix logarithm are required then
F01KAF should be used.
F01EJF can be used to find the principal logarithm of a real matrix.
9 Example
This example finds the principal matrix logarithm of the matrix
9.1 Program Text
Program Text (f01fjfe.f90)
9.2 Program Data
Program Data (f01fjfe.d)
9.3 Program Results
Program Results (f01fjfe.r)