NASA NTRS · 19870065446
Fast and stable algorithms for computing the principal square root of a complex matrix
Abstract
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.
Keep this discovery
Explore connections, maps & timelines
Shieh, Leang S., Lian, Sui R., Mcinnis, Bayliss C.. 1987-09-01. Fast and stable algorithms for computing the principal square root of a complex matrix. https://ntrs.nasa.gov/citations/19870065446
Cite the original work for its findings. Save a collection to share your selection of sources.