NAG Library ManualKeyword Search:

NAG Library Routine Document

f01kjf (complex_gen_matrix_cond_log)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

▸▿ 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

f01kjf computes an estimate of the relative condition number

κ_{\log} (A)

of the logarithm of a complex

n

n

matrix

A

, in the

1

-norm. The principal matrix logarithm

\log (A)

is also returned.

2

Specification

Fortran Interface

Subroutine f01kjf (

n, a, lda, condla, ifail)

Integer, Intent (In)	::	n, lda
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (Out)	::	condla
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,*)

C Header Interface

#include nagmk26.h

void	f01kjf_ ( const Integer n, Complex a[], const Integer lda, double condla, Integer ifail)

3

Description

For a matrix with no eigenvalues on the closed negative real line, the principal matrix logarithm

\log (A)

is the unique logarithm whose spectrum lies in the strip

\{z : - π < Im (z) < π\}

The Fréchet derivative of the matrix logarithm of

A

is the unique linear mapping

E ⟼ L (A, E)

such that for any matrix

E

\log (A + E) - \log (A) - L (A, E) = o (‖E‖) .

The derivative describes the first order effect of perturbations in

A

on the logarithm

\log (A)

The relative condition number of the matrix logarithm can be defined by

κ_{\log} (A) = \frac{‖L (A)‖ ‖A‖}{‖\log (A)‖},

where

‖L (A)‖

is the norm of the Fréchet derivative of the matrix logarithm at

A

To obtain the estimate of

κ_{\log} (A)

, f01kjf first estimates

‖L (A)‖

by computing an estimate

γ

of a quantity

K \in [n^{- 1} {‖L (A)‖}_{1}, n {‖L (A)‖}_{1}]

, such that

γ \leq K

The algorithms used to compute

κ_{\log} (A)

and

\log (A)

are based on a Schur decomposition, the inverse scaling and squaring method and Padé approximants. Further details can be found in Al–Mohy and Higham (2011) and Al–Mohy et al. (2012).

A

is nonsingular but has negative real eigenvalues, the principal logarithm is not defined, but f01kjf will return a non-principal logarithm and its condition number.

4

References

Al–Mohy A H and Higham N J (2011) Improved inverse scaling and squaring algorithms for the matrix logarithm SIAM J. Sci. Comput. 34(4) C152–C169

Al–Mohy A H, Higham N J and Relton S D (2012) Computing the Fréchet derivative of the matrix logarithm and estimating the condition number SIAM J. Sci. Comput. 35(4) C394–C410

Higham N J (2008) Functions of Matrices: Theory and Computation SIAM, Philadelphia, PA, USA

5

Arguments

1: $n$ – IntegerInput: On entry: $n$ , the order of the matrix $A$ .

Constraint: $n \geq 0$ .
2: $a (lda *)$ – Complex (Kind=nag_wp) arrayInput/Output: Note: the second dimension of the array a must be at least $n$ .

On entry: the $n$ by $n$ matrix $A$ .

On exit: the $n$ by $n$ principal matrix logarithm, $\log (A)$ . Alternatively, if $ifail = 2$ , a non-principal logarithm is returned.
3: $lda$ – IntegerInput: On entry: the first dimension of the array a as declared in the (sub)program from which f01kjf is called.

Constraint: $lda \geq n$ .
4: $condla$ – Real (Kind=nag_wp)Output: On exit: with $ifail = 0$ , $2$ or $3$ , an estimate of the relative condition number of the matrix logarithm, $κ_{\log} (A)$ . Alternatively, if $ifail = 4$ , contains the absolute condition number of the matrix logarithm.
5: $ifail$ – IntegerInput/Output: On entry: ifail must be set to $0$ , $- 1 or 1$ . If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $- 1 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 argument, the recommended value is $0$ . When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit: $ifail = 0$ unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: $A$ is singular so the logarithm cannot be computed.

$ifail = 2$: $A$ has eigenvalues on the negative real line. The principal logarithm is not defined in this case, so a non-principal logarithm was returned.

$ifail = 3$: $\log (A)$ has been computed using an IEEE double precision Padé approximant, although the arithmetic precision is higher than IEEE double precision.

$ifail = 4$: The relative condition number is infinite. The absolute condition number was returned instead.

$ifail = 5$: An unexpected internal error occurred. This failure should not occur and suggests that the routine has been called incorrectly.

$ifail = - 1$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = - 3$: On entry, $lda = 〈value〉$ and $n = 〈value〉$ .
Constraint: $lda \geq n$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

f01kjf uses the norm estimation routine f04zdf to produce an estimate

γ

of a quantity

K \in [n^{- 1} {‖L (A)‖}_{1}, n {‖L (A)‖}_{1}]

, such that

γ \leq K

. For further details on the accuracy of norm estimation, see the documentation for f04zdf.

For a normal matrix

A

(for which

A^{H} A = A A^{H}

), the Schur decomposition is diagonal and the computation of the matrix logarithm reduces to evaluating the logarithm of the eigenvalues of

A

and then constructing

\log (A)

using the Schur vectors. This should give a very accurate result. In general, however, no error bounds are available for the algorithm. The sensitivity of the computation of

\log (A)

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. See Al–Mohy and Higham (2011) and Section 11.2 of Higham (2008) for details and further discussion.

8

Parallelism and Performance

f01kjf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f01kjf 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.

9

Further Comments

f01kaf uses a similar algorithm to f01kjf to compute an estimate of the absolute condition number (which is related to the relative condition number by a factor of

‖A‖ / ‖\log (A)‖

). However, the required Fréchet derivatives are computed in a more efficient and stable manner by f01kjf and so its use is recommended over f01kaf.

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 (n^{3})

floating-point operations; see Al–Mohy et al. (2012).

If the matrix logarithm alone is required, without an estimate of the condition number, then f01fjf should be used. If the Fréchet derivative of the matrix logarithm is required then f01kkf should be used. The real analogue of this routine is f01jjf.

10

Example

This example estimates the relative condition number of the matrix logarithm

\log (A)

, where

A = (\begin{matrix} 3 + 2 i & 1 & 1 & 1 + 2 i \\ 0 + 2 i & - 4 & 0 & 0 \\ 1 & - 2 & 3 + 2 i & 0 + i \\ 1 & i & 1 & 2 + 3 i \end{matrix}) .

NAG Library Routine Document

f01kjf (complex_gen_matrix_cond_log)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results