Fast and stable algorithms for computing the principal square root of a complex matrix
Leang San Shieh, Sui Lian, Bayliss C. McInnis · IEEE Transactions on Automatic Control · 1987
This note presents recursive algorithms that are rapidly convergent and more stable for finding the principal square root of a complex matrix. Also, the developed algorithms are utilized to derive the fast and stable matrix sign algorithms which are useful in developing applications to control system problems.