Computing the square roots of matrices with central symmetry

Abstract

For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were proposed by Bj¨ork and Hammarling [3], for square roots of general complex matrices, and by Higham [10], for real square roots of real matrices. In this paper we further consider (the computation of) the square roots of matrices with central symmetry. We first investigate the structure of the square roots of these matrices and then develop several algorithms for computing the square roots. We show that our algorithms ensure significant savings in computational costs as compared to the use of standard algorithms for arbitrary matrices.