Computation of the principal nth roots of complex matrices
- 1 June 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 30 (6) , 606-608
- https://doi.org/10.1109/tac.1985.1103991
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Block-diagonalization and block-triangularization of a matrix via the matrix sign functionInternational Journal of Systems Science, 1984
- Algebra-geometric approach for the model reduction of large-scale multivariable systemsIEE Proceedings D Control Theory and Applications, 1984
- State-feedback decomposition of multivariable systems via block-pole placementIEEE Transactions on Automatic Control, 1983
- Some properties of matrix sign functions derived from continued fractionsIEE Proceedings D Control Theory and Applications, 1983
- Block modal matrices and their applications to multivariable control systemsIEE Proceedings D Control Theory and Applications, 1982
- Roots of real matricesLinear Algebra and its Applications, 1981
- A computer-aided method for the factorization of matrix polynomials†International Journal of Systems Science, 1981
- A faster, more stable method for computing the pth roots of positive definite matricesLinear Algebra and its Applications, 1979
- On covariance propagation using matrix continued fractionsInternational Journal of Systems Science, 1979
- A faster method of computing the square root of a matrixIEEE Transactions on Automatic Control, 1978