Skip to main content
Article thumbnail
Location of Repository

Computing real square roots of a real matrix

By Nicholas J. Higham, In James and H. Wiikinson

Abstract

Bjiirck and Hammarling [l] describe a fast, stable Schur method for computing a square root X of a matrix A (X2 = A). We present an extension of their method which enables real arithmetic to be used throughout when computing a real square root of a real matrix. For a nonsingular real matrix A conditions are given for the existence of a real square root, and for the existence of a real square root which is a polynomial in A; the number of square roots of the latter type is determined. The conditioning of matrix square roots is investigated, and an algorithm is given for the computation of a well-conditioned square root. 1

Year: 1987
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.8834
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.maths.man.ac.uk/~na... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.