Fast and stable algorithms for computing the principal square root of a complex matrix
From MaRDI portal
Publication:3030131
DOI10.1109/TAC.1987.1104721zbMath0626.65042MaRDI QIDQ3030131
Suiren Lian, Bayliss C. McInnis, Leang San Shieh
Publication date: 1987
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
recursive algorithmsmatrix Lyapunov and Riccati equationsmatrix sign algorithmsprincipal square root of a complex matrix
Numerical optimization and variational techniques (65K10) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Matrix equations and identities (15A24) Control/observation systems governed by ordinary differential equations (93C15)
Related Items
Modelling of multirate feedback systems using uniform-rate models ⋮ An alternative digital redesign of continuous-time suboptimal regulators for input time-delay systems ⋮ Digital modelling, ideal state reconstructor, and control for time-delay sampled-data systems ⋮ Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function ⋮ Block power method for computing solvent and spectral factors of matrix polynomials ⋮ Two-stage suboptimal discrete-time regulators for continuous-time stiff dynamic systems ⋮ A computer-aided method for solvents and spectral factors of matrix polynomials ⋮ Inversion free algorithms for computing the principal square root of a matrix ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ A parallel algorithm for principal \(n\)th roots of matrices
