Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function
Authors:
- J.S.H. TsaiJTJ.S.H. Tsai
- L.S. ShiehLSL.S. Shieh
- R.E. YatesRYR.E. Yates
- 1 January 1988
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 15 (11) , 903-913
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Determining continuous-time state equations from discrete-time state equations via the principalqth root methodIEEE Transactions on Automatic Control, 1986
- A fast method for computing the principal nth roots of complex matricesLinear Algebra and its Applications, 1986
- The Generalized Matrix Sector Function and the Separation of Matrix EigenvaluesIMA Journal of Mathematical Control and Information, 1985
- Computation of the principal nth roots of complex matricesIEEE Transactions on Automatic Control, 1985
- Computation of roots of real and complex matricesApplied Mathematics and Computation, 1985
- Roots of real matricesLinear Algebra and its Applications, 1981
- 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
- The matrix sign function and computations in systemsApplied Mathematics and Computation, 1976