Blocked Schur Algorithms for Computing the Matrix Square Root

Deadman, Edvin and Higham, Nicholas J. and Ralha, Rui (2013) Blocked Schur Algorithms for Computing the Matrix Square Root. Lecture Notes in Computer Science, 7782. pp. 171-182.

This is the latest version of this item.

[img] PDF
paper16.pdf

Download (281kB)

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 either standard blocking or recursive blocking 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. In parallel implementations, recursive blocking is found to provide better performance than standard blocking when the parallelism comes only from threaded BLAS, but the reverse is true when parallelism is explicitly expressed using OpenMP. The excellent numerical stability of the point algorithm is shown to be preserved by blocking. These results are extended to the real Schur method. Blocking is also shown to be effective for multiplying triangular matrices.

Item Type: Article
Additional Information: Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland
Uncontrolled Keywords: matrix function square root Schur recursive blocked
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: 11 Mar 2013
Last Modified: 20 Oct 2017 14:13
URI: http://eprints.maths.manchester.ac.uk/id/eprint/1951

Available Versions of this Item

Actions (login required)

View Item View Item