FAST AND STABLE ALGORITHMS FOR COMPUTING THE PRINCIPAL SQUARE ROOT OF A COMPLEX MATRIX.

被引：16

作者：

Shieh, Leang S. ^{[1
]}

Lian, Sui R. ^{[1
]}

McInnis, Bayliss C. ^{[1
]}

机构：

[1] Univ of Houston, TX, USA, Univ of Houston, TX, USA

来源：

IEEE Transactions on Automatic Control | 1987年 / AC-32卷 / 09期

关键词：

CONTROL SYSTEMS - Mathematical Models - SYSTEM STABILITY;

D O I：

10.1109/TAC.1987.1104721

中图分类号：

学科分类号：

摘要：

The authors present 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 fast and stable matrix sign algorithms, which are useful in developing applications to control system problems.

引用

页码：820 / 822