Fast and Stable Algorithms for Computing the Principal Square Root of a Complex Matrix

摘要

This note presents recursive algorithms that are rapidly convergent and more stable for finding the principle 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.