A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root

Deadman, Edvin and Higham, Nicholas J. and Ralha, Rui (2012) A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root. [MIMS Preprint]

Warning
There is a more recent version of this item available.
[thumbnail of PARA2012ExtendedAbstract.pdf] PDF
PARA2012ExtendedAbstract.pdf
Download (213kB)

Abstract

The Schur method for computing a matrix square root reduces the matrix to the Schur triangular form and then computes a square root of the triangular matrix. We show that by using a recursive blocking technique the computation of the square root of the triangular matrix can be made rich in matrix multiplication. Numerical experiments making appropriate use of level 3 BLAS show significant speedups over the point algorithm, both in the square root phase and in the algorithm as a whole. The excellent numerical stability of the point algorithm is shown to be preserved by recursive blocking. These results are extended to the real Schur method. Recursive blocking is also shown to be effective for multiplying triangular matrices.

Item Type: MIMS Preprint
Uncontrolled Keywords: matrix function square root Schur recursive
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory
MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
Depositing User: Dr Edvin Deadman
Date Deposited: 30 Jan 2012
Last Modified: 08 Nov 2017 18:18
URI: https://eprints.maths.manchester.ac.uk/id/eprint/1775

Available Versions of this Item

Actions (login required)

View Item View Item