F01 Chapter Contents
F01 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF01FNF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F01FNF computes the principal matrix square root, ${A}^{1/2}$, of a complex $n$ by $n$ matrix $A$.

## 2  Specification

 SUBROUTINE F01FNF ( N, A, LDA, IFAIL)
 INTEGER N, LDA, IFAIL COMPLEX (KIND=nag_wp) A(LDA,*)

## 3  Description

A square root of a matrix $A$ is a solution $X$ to the equation ${X}^{2}=A$. A nonsingular matrix has multiple square roots. For a matrix with no eigenvalues on the closed negative real line, the principal square root, denoted by ${A}^{1/2}$, is the unique square root whose eigenvalues lie in the open right half-plane.
${A}^{1/2}$ is computed using the algorithm described in Björck and Hammarling (1983). In addition a blocking scheme described in Deadman et al. (2013) is used.

## 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 (2008) Functions of Matrices: Theory and Computation SIAM, Philadelphia, PA, USA

## 5  Parameters

1:     $\mathrm{N}$ – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
2:     $\mathrm{A}\left({\mathbf{LDA}},*\right)$ – 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: contains, if ${\mathbf{IFAIL}}={\mathbf{0}}$, the $n$ by $n$ principal matrix square root, ${A}^{1/2}$. Alternatively, if ${\mathbf{IFAIL}}={\mathbf{1}}$, contains an $n$ by $n$ non-principal square root of $A$.
3:     $\mathrm{LDA}$ – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F01FNF is called.
Constraint: ${\mathbf{LDA}}\ge {\mathbf{N}}$.
4:     $\mathrm{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$ has a negative or semisimple vanishing eigenvalue. A non-principal square root is returned.
${\mathbf{IFAIL}}=2$
$A$ has a defective vanishing eigenvalue. The square root cannot be found in this case.
${\mathbf{IFAIL}}=3$
An internal error occurred. It is likely that the routine was called incorrectly.
${\mathbf{IFAIL}}=-1$
On entry, ${\mathbf{N}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{N}}\ge 0$.
${\mathbf{IFAIL}}=-3$
On entry, ${\mathbf{LDA}}=〈\mathit{\text{value}}〉$ and ${\mathbf{N}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{LDA}}\ge {\mathbf{N}}$.
${\mathbf{IFAIL}}=-99$
See Section 3.8 in the Essential Introduction for further information.
${\mathbf{IFAIL}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.
${\mathbf{IFAIL}}=-999$
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

## 7  Accuracy

The computed square root $\stackrel{^}{X}$ satisfies ${\stackrel{^}{X}}^{2}=A+\Delta A$, where ${‖\Delta A‖}_{F}\approx O\left(\epsilon \right){n}^{3}{‖\stackrel{^}{X}‖}_{F}^{2}$, where $\epsilon$ is machine precision.

## 8  Parallelism and Performance

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

The cost of the algorithm is $85{n}^{3}/3$ complex floating-point operations; see Algorithm 6.3 in Higham (2008). $O\left(2×{n}^{2}\right)$ of complex allocatable memory is required by the routine.
If condition number and residual bound estimates are required, then F01KDF should be used. For further discussion of the condition of the matrix square root see Section 6.1 of Higham (2008).

## 10  Example

This example finds the principal matrix square root of the matrix
 $A = 105+121i -21+157i 42+18i -4-02i 174+072i 28+236i 51+31i 16-06i 176+052i 37+177i 23+27i 25+13i -9+125i -111+067i -8+30i 08i .$

### 10.1  Program Text

Program Text (f01fnfe.f90)

### 10.2  Program Data

Program Data (f01fnfe.d)

### 10.3  Program Results

Program Results (f01fnfe.r)