A fast method for computing the principal \(n\)-th roots of complex matrices
From MaRDI portal
Publication:1085563
DOI10.1016/0024-3795(86)90223-5zbMath0607.65016OpenAlexW2007934969MaRDI QIDQ1085563
Yih T. Tsay, Leang San Shieh, Jason Sheng-Hong Tsai
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90223-5
numerical examplecontinued fraction methodblock circulant matricesprincipal n-th root of complex matrices
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Modelling of multirate feedback systems using uniform-rate models ⋮ On optimal symmetric orthogonalisation and square roots of a normal matrix ⋮ 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 ⋮ An Iterative Method for the Computation of a Matrix Inverse Square Root ⋮ On the computation of a matrix inverse square root ⋮ Numerical approximation of the product of the square root of a matrix with a vector ⋮ A computer-aided method for solvents and spectral factors of matrix polynomials ⋮ Multi-rate digital redesign of cascaded and dynamic output feedback systems ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ Algorithms for the matrix \(p\)th root
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral decomposition of a matrix using the generalized sign matrix
- The matrix sign function and computations in systems
- A faster, more stable method for comuting the pth roots of positive definite matrices
- Some properties of matrix sign functions derived from continued fractions
- A computer-aided method for the factorization of matrix polynomials†
- Block partial fraction expansion of a rational matrix
- Additional properties and applications of matrix continued fraction†
- A faster method of computing the square root of a matrix
- On covariance propagation using matrix continued fractions
- Irreducible divisors of A-matrices and their applications to multivariable control systems
This page was built for publication: A fast method for computing the principal \(n\)-th roots of complex matrices
