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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Advanced Micro Devices, Inc., Numerical Algorithms Group Ltd. AMD Core Math Library (ACML), 4.1.0 edn. (2008)
Al-Mohy, A.H., Higham, N.J.: Improved inverse scaling and squaring algorithms for the matrix logarithm. SIAM J. Sci. Comput. 34(4), C153–C169 (2012)
Al-Mohy, A.H., Higham, N.J., Relton, S.D.: Computing the Fréchet derivative of the matrix logarithm and estimating the condition number. MIMS EPrint 2012.72. Manchester Institute for Mathematical Sciences. The University of Manchester, UK (2012)
Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. Society for Industrial and Applied Mathematics. Philadelphia, PA (1999)
Bini, D.A., Higham, N.J., Meini, B.: Algorithms for the matrix pth root. Numer. Algorithms 39(4), 349–378 (2005)
Björck, Å., Hammarling, S.: A Schur method for the square root of a matrix. Linear Algebra Appl. 52/53, 127–140 (1983)
Du Croz, J.J., Higham, N.J.: Stability methods for matrix inversion. IMA J. Numer. Anal. 12(1), 1–19 (1992)
Guo, C.-H., Higham, N.J.: A Schur–Newton method for the matrix pth root and its inverse. SIAM J. Matrix Anal. Appl. 28(3), 788–804 (2006)
Higham, N.J.: The Matrix Function Toolbox, http://www.ma.man.ac.uk/~higham/mftoolbox
Higham, N.J.: Computing real square roots of a real matrix. Linear Algebra Appl. 88/89, 405–430 (1987)
Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM (2002)
Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM (2008)
Higham, N.J., Lin, L.: A Schur–Padé algorithm for fractional powers of a matrix. SIAM J. Matrix Anal. Appl. 32(3), 1056–1078 (2011)
Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems - part I: One-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Software 28(4), 392–415 (2002)
Numerical Algorithms Group. The NAG Fortran Library, http://www.nag.co.uk
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deadman, E., Higham, N.J., Ralha, R. (2013). Blocked Schur Algorithms for Computing the Matrix Square Root. In: Manninen, P., Öster, P. (eds) Applied Parallel and Scientific Computing. PARA 2012. Lecture Notes in Computer Science, vol 7782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36803-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-36803-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36802-8
Online ISBN: 978-3-642-36803-5
eBook Packages: Computer ScienceComputer Science (R0)