The Matrix Sign Function Method and the Computation of Invariant Subspaces
From MaRDI portal
Publication:4339127
DOI10.1137/S0895479894277454zbMath0874.65031MaRDI QIDQ4339127
Volker Mehrmann, Ralph Byers, Chunyang He
Publication date: 5 June 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Related Items
Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic ⋮ The Complexity of Diagonalization ⋮ Factorized solution of the Lyapunov equation by using the hierarchical matrix arithmetic ⋮ Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time ⋮ Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction ⋮ A globally convergent variant of mid-point method for finding the matrix sign ⋮ Ralph Byers 1955--2007 ⋮ Constructing a high-order globally convergent iterative method for calculating the matrix sign function ⋮ Approximating the matrix sign function using a novel iterative method ⋮ Approximate iterations for structured matrices ⋮ A structured matrix approach to efficient calculation of LQG repetitive learning controllers in the lifted setting ⋮ A Padé family of iterations for the matrix sign function and related problems ⋮ A structure-preserving doubling algorithm for continuous-time algebraic Riccati equations ⋮ Convex invertible sets and matrix sign function ⋮ An arithmetic for matrix pencils: theory and new algorithms ⋮ A fourth-order method for computing the sign function of a matrix with application in the Yang-Baxter-like matrix equation ⋮ Error analysis of Padé iterations for computing matrix invariant subspaces ⋮ Convex invertible cones of matrices -- a unified framework for the equations of Sylvester, Lyapunov and Riccati
Uses Software
