DocumentCode :
856772
Title :
Fast and stable algorithms for computing the principal square root of a complex matrix
Author :
Shieh, Leang S. ; Lian, Sui R. ; McInnis, Bayliss C.
Author_Institution :
University of Houston, Houston, TX, USA
Volume :
32
Issue :
9
fYear :
1987
fDate :
9/1/1987 12:00:00 AM
Firstpage :
820
Lastpage :
822
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.
Keywords :
Matrices; Recursive estimation; Square-rooting; Control systems; Convergence; Digital control; Eigenvalues and eigenfunctions; Large-scale systems; Matrix decomposition; Optimal control; Reduced order systems; Riccati equations; Stability;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.1987.1104721
Filename :
1104721
Link To Document :
بازگشت