NAG Library Routine Document

is computed using the algorithm described in Higham (1987). This is a real arithmetic 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 Section 7). It is computed via

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

4

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

5

Arguments

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

Constraint: $n \geq 0$ .
2: $a (lda *)$ – Real (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: contains, if $ifail = 0$ , 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$ .
3: $lda$ – IntegerInput: On entry: the first dimension of the array a as declared in the (sub)program from which f01jdf is called.

Constraint: $lda \geq n$ .
4: $alpha$ – Real (Kind=nag_wp)Output: On exit: 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, $α$ .
5: $condsa$ – Real (Kind=nag_wp)Output: On exit: 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}}$ .
6: $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$ has a 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$: $A$ has a negative real eigenvalue. The principal square root is not defined. f01kdf can be used to return a complex, non-principal square root.

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

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

$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

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}} ε

8

Parallelism and Performance

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

f01jdf 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

Approximately

3 \times n^{2}

of real allocatable memory is required by the routine.

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 f01enf to obtain the matrix square root alone. Condition estimates for the square root of a complex matrix can be obtained via f01kdf.

10

Example

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

A = (\begin{array}{r} - 5 & 2 & - 1 & 1 \\ - 2 & - 3 & 19 & 27 \\ - 9 & 0 & 15 & 24 \\ 7 & 8 & 11 & 16 \end{array}) .

NAG Library Routine Document

f01jdf (real_gen_matrix_cond_sqrt)

▸▿ 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

2

Specification

3

Description