Integer type: int32 int64 nag_int show int32 show int32 show int64 show int64 show nag_int show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox

NAG Toolbox: nag_matop_complex_gen_matrix_cond_sqrt (f01kd)

▸▿ Contents

1 Purpose

2 Syntax

3 Description

4 References

▸▿ 5 Parameters

5.1 Compulsory Input Parameters

5.2 Optional Input Parameters

5.3 Output Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

Purpose

nag_matop_complex_gen_matrix_cond_sqrt (f01kd) computes an estimate of the relative condition number,

κ_{A^{1 / 2}}

, and a bound on the relative residual, in the Frobenius norm, for the square root of a complex

n

n

matrix

A

. The principal square root,

A^{1 / 2}

, of

A

is also returned.

Syntax

[a, alpha, condsa, ifail] = f01kd(a, 'n', n)

[a, alpha, condsa, ifail] = nag_matop_complex_gen_matrix_cond_sqrt(a, 'n', n)

Description

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

A^{1 / 2}

, of

A

is the unique square root with eigenvalues in the right half-plane.

The Fréchet derivative of a matrix function

A^{1 / 2}

in the direction of the matrix

E

is the linear function mapping

E

L (A, E)

such that

{(A + E)}^{1 / 2} - A^{1 / 2} - L (A, E) = o (‖A‖) .

The absolute condition number is given by the norm of the Fréchet derivative which is defined by

‖L (A)‖ := \max_{E \neq 0} \frac{‖L (A, E)‖}{‖E‖} .

The Fréchet derivative is linear in

E

and can therefore be written as

vec (L (A, E)) = K (A) vec (E),

where the

vec

operator stacks the columns of a matrix into one vector, so that

K (A)

n^{2} \times n^{2}

nag_matop_complex_gen_matrix_cond_sqrt (f01kd) uses Algorithm 3.20 from Higham (2008) to compute an estimate

γ

such that

γ \leq {‖K (X)‖}_{F}

. The quantity of

γ

provides a good approximation to

{‖L (A)‖}_{F}

. The relative condition number,

κ_{A^{1 / 2}}

, is then computed via

κ_{A^{1 / 2}} = \frac{{‖L (A)‖}_{F} {‖A‖}_{F}}{{‖A^{1 / 2}‖}_{F}} .

κ_{A^{1 / 2}}

is returned in the argument condsa.

A^{1 / 2}

is computed using the algorithm described in Higham (1987). This is a version of the algorithm of Björck and Hammarling (1983). In addition, a blocking scheme described in Deadman et al. (2013) is used.

The computed quantity

α

is a measure of the stability of the relative residual (see Accuracy). It is computed via

α = \frac{{‖A^{1 / 2}‖}_{F}^{2}}{{‖A‖}_{F}} .

References

Björck Å and Hammarling S (1983) A Schur method for the square root of a matrix Linear Algebra Appl. 52/53 127–140

Deadman E, Higham N J and Ralha R (2013) Blocked Schur Algorithms for Computing the Matrix Square Root Applied Parallel and Scientific Computing: 11th International Conference, (PARA 2012, Helsinki, Finland) P. Manninen and P. Öster, Eds Lecture Notes in Computer Science 7782 171–181 Springer–Verlag

Higham N J (1987) Computing real square roots of a real matrix Linear Algebra Appl. 88/89 405–430

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

Parameters

Compulsory Input Parameters

1: $a (lda :)$ – complex array: The first dimension of the array a must be at least $n$ .
The second dimension of the array a must be at least $n$ .

The $n$ by $n$ matrix $A$ .

Optional Input Parameters

1: $n$ – int64int32nag_int scalar: Default: the first dimension of the array a and the second dimension of the array a. (An error is raised if these dimensions are not equal.)
$n$ , the order of the matrix $A$ .

Constraint: $n \geq 0$ .

Output Parameters

1: $a (lda :)$ – complex array: The first dimension of the array a will be $n$ .
The second dimension of the array a will be $n$ .

The $n$ by $n$ principal matrix square root $A^{1 / 2}$ . Alternatively, if $ifail = 1$ , contains an $n$ by $n$ non-principal square root of $A$ .
2: $alpha$ – double scalar: An estimate of the stability of the relative residual for the computed principal (if $ifail = 0$ ) or non-principal (if $ifail = 1$ ) matrix square root, $α$ .
3: $condsa$ – double scalar: An estimate of the relative condition number, in the Frobenius norm, of the principal (if $ifail = 0$ ) or non-principal (if $ifail = 1$ ) matrix square root at $A$ , $κ_{A^{1 / 2}}$ .
4: $ifail$ – int64int32nag_int scalar: $ifail = 0$ unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:

$ifail = 1$: $A$ has a negative or semisimple vanishing eigenvalue. A non-principal square root was returned.

$ifail = 2$: $A$ has a defective vanishing eigenvalue. The square root and condition number cannot be found in this case.

$ifail = 3$: An error occurred when computing the matrix square root. Consequently, alpha and condsa could not be computed. It is likely that the function was called incorrectly.

$ifail = 4$: An error occurred when computing the condition number. The matrix square root was still returned but you should use nag_matop_complex_gen_matrix_sqrt (f01fn) to check if it is the principal matrix square root.

$ifail = - 1$: Constraint: $n \geq 0$ .

$ifail = - 3$: Constraint: $lda \geq n$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.

$ifail = - 999$: Dynamic memory allocation failed.

Accuracy

If the computed square root is

\tilde{X}

, then the relative residual

\frac{{‖A - {\tilde{X}}^{2}‖}_{F}}{{‖A‖}_{F}},

is bounded approximately by

n α ε

, where

ε

is machine precision. The relative error in

\tilde{X}

is bounded approximately by

n α κ_{A^{1 / 2}} ε

Further Comments

Approximately

3 \times n^{2}

of complex allocatable memory is required by the function.

The cost of computing the matrix square root is

85 n^{3} / 3

floating-point operations. The cost of computing the condition number depends on how fast the algorithm converges. It typically takes over twice as long as computing the matrix square root.

If condition estimates are not required then it is more efficient to use nag_matop_complex_gen_matrix_sqrt (f01fn) to obtain the matrix square root alone. Condition estimates for the square root of a real matrix can be obtained via nag_matop_real_gen_matrix_cond_sqrt (f01jd).

Example

This example estimates the matrix square root and condition number of the matrix

A = (\begin{array}{r} 29 + 35 i & 31 + 61 i & - 38 + 49 i & - 17 - 6 i \\ 52 - 59 i & 58 - 29 i & 97 + 39 i & - 32 + 15 i \\ 20 - 31 i & 44 - i & 37 + 19 i & - 26 + 19 i \\ - 70 + 72 i & - 90 + 8 i & - 87 - 43 i & 47 - 5 i \end{array}) .

Open in the MATLAB editor: f01kd_example

function f01kd_example


fprintf('f01kd example results\n\n');

% Principal square root and conditioning of complex matrix A 

a = [ 29+35i  31+61i -38+49i -17- 6i;
      52-59i  58-29i  97+39i -32+15i;
      20-31i  44- 1i  37+19i -26+19i;
     -70+72i -90+ 8i -87-43i  47- 5i];

[as, alpha, condsa, ifail] = f01kd(a);

disp('Square root of A:');
disp(as);

fprintf('\nEstimated relative condition number is       : %6.2f\n', condsa);

fprintf('Condition number for the relative residual is: %6.2f\n', alpha)

f01kd example results

Square root of A:
   2.0000 + 3.0000i   1.0000 + 8.0000i  -2.0000 - 0.0000i  -2.0000 + 1.0000i
   5.0000 - 4.0000i   7.0000 - 6.0000i   7.0000 + 6.0000i   0.0000 + 0.0000i
   1.0000 - 2.0000i   2.0000 + 1.0000i   4.0000 + 1.0000i  -2.0000 + 2.0000i
  -3.0000 + 7.0000i  -2.0000 + 2.0000i  -7.0000 - 1.0000i   6.0000 + 2.0000i


Estimated relative condition number is       :  21.17
Condition number for the relative residual is:   1.86

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox