Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function

DOI10.1016/0898-1221(88)90034-XzbMath0653.65031MaRDI QIDQ1107951

Jason Sheng-Hong Tsai, R. E. Yates, Leang San Shieh

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

numerical stability; matrix sector function; fast and stable recursive algorithms; principal n-th root of a complex matrix

Mathematics Subject Classification ID

Related Items

Implementation of state-feedback control law for singular systems via an input-output feedback structure, Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root, Continuous to discrete model conversion for the system with a singular system matrix based on matrix sign function, Residual methods for the large-scale matrix \(p\)th root and some related problems, Two-stage suboptimal discrete-time regulators for continuous-time stiff dynamic systems, Block power method for computing solvent and spectral factors of matrix polynomials, A computer-aided method for solvents and spectral factors of matrix polynomials, An alternative digital redesign of continuous-time suboptimal regulators for input time-delay systems, Model conversion and digital redesign of singular systems, Digital modelling, ideal state reconstructor, and control for time-delay sampled-data systems, Two-dimensional discrete-continuous model conversion, Modelling of multirate feedback systems using uniform-rate models, Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite, Algorithms for the matrix \(p\)th root, Linear quadratic Nash game-based tracker for multiparameter singularly perturbed sampled-data systems: digital redesign approach, Hybrid suboptimal control of multi-rate multi-loop sampled-data systems

Cites Work

• Computation of roots of real and complex matrices
• A fast method for computing the principal \(n\)-th roots of complex matrices
• Roots of real matrices
• The matrix sign function and computations in systems
• A faster, more stable method for comuting the pth roots of positive definite matrices
• Fast and stable algorithms for computing the principal square root of a complex matrix
• Fast suboptimal state-space self-tuner for linear stochastic multivariable systems
• Some properties of matrix sign functions derived from continued fractions
• Matrix sector functions and their applications to systems theory
• The Generalized Matrix Sector Function and the Separation of Matrix Eigenvalues
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• A faster method of computing the square root of a matrix
• Newton's Method for the Matrix Square Root
• Computation of the principal nth roots of complex matrices