Fast and stable algorithms for computing the principal square root of a complex matrix
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 32 (9) , 820-822
- https://doi.org/10.1109/tac.1987.1104721
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- PrefaceLinear Algebra and its Applications, 1986
- Determining continuous-time state equations from discrete-time state equations via the principalqth root methodIEEE Transactions on Automatic Control, 1986
- Separation of matrix eigenvalues and structural decomposition of large-scale systemsIEE Proceedings D Control Theory and Applications, 1986
- A generalization of the matrix sign function solution for algebraic Riccati equationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Matrix sector functions and their applications to systems theoryIEE Proceedings D Control Theory and Applications, 1984
- Algebra-geometric approach for the model reduction of large-scale multivariable systemsIEE Proceedings D Control Theory and Applications, 1984
- Fast suboptimal state-space self-tuner for linear stochastic multivariable systemsIEE Proceedings D Control Theory and Applications, 1983
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†International Journal of Control, 1980
- A faster, more stable method for computing the pth roots of positive definite matricesLinear Algebra and its Applications, 1979
- A faster method of computing the square root of a matrixIEEE Transactions on Automatic Control, 1978