Computation of the principal nth roots of complex matrices
From MaRDI portal
Publication:5185908
DOI10.1109/TAC.1985.1103991zbMath0559.65025MaRDI QIDQ5185908
R. E. Yates, Yih T. Tsay, Leang San Shieh
Publication date: 1985
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Riccati equationsNewton-Raphson algorithmprincipal nth roots of complex matricesrecursive solution of a block discrete state equation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Fast and stable recursive algorithms for continuous-time and discrete- time model conversions ⋮ Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function ⋮ Hybrid suboptimal control of multi-rate multi-loop sampled-data systems ⋮ Rectangular and polar representations of a complex matrix ⋮ A computer-aided method for solvents and spectral factors of matrix polynomials ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ Algorithms for the matrix \(p\)th root
This page was built for publication: Computation of the principal nth roots of complex matrices
