Structured Condition Numbers for Invariant Subspaces
From MaRDI portal
Publication:3435001
DOI10.1137/050637601zbMath1116.65052OpenAlexW2000736912MaRDI QIDQ3435001
Publication date: 3 May 2007
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/165571
perturbation theoryHamiltonianinvariant subspacecondition numberorthogonaldeflating subspacepalindromicstructured eigenvalue problemblock cycling
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items (27)
On the Sylvester-like matrix equation \(AX+f(X)B=C\) ⋮ Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix ⋮ Computational Methods for Linear Matrix Equations ⋮ A note on Sylvester-type equations ⋮ On a relationship between the \(\operatorname{T}\)-congruence Sylvester equation and the Lyapunov equation ⋮ A structured condition number for self-adjoint polynomial matrix equations with applications in linear control ⋮ Skew-symmetric matrix polynomials and their Smith forms ⋮ The solution of the equation \(AX + X^{\star}B =0\) ⋮ Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation ⋮ Contour integral solutions of Sylvester-type matrix equations ⋮ On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\) ⋮ Verified error bounds for real eigenvalues of real symmetric and persymmetric matrices ⋮ Ralph Byers 1955--2007 ⋮ Preserving spectral properties of structured matrices under structured perturbations ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ Using permuted graph bases in \(\mathcal{H}_\infty\) control ⋮ Fast verified computation for the solution of the T-congruence Sylvester equation ⋮ Solvability and uniqueness criteria for generalized Sylvester-type equations ⋮ On solving periodic Riccati equations ⋮ Relation between the T-congruence Sylvester equation and the generalized Sylvester equation ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ Projection methods for large-scale T-Sylvester equations ⋮ Implicit QR algorithms for palindromic and even eigenvalue problems ⋮ Coupled Sylvester-type Matrix Equations and Block Diagonalization ⋮ On a transformation of the ∗-congruence Sylvester equation for the least squares optimization ⋮ Palindromic linearization and numerical solution of nonsymmetric algebraic \(T\)-Riccati equations ⋮ The solution of the equationAX + BX⋆ = 0
Uses Software
This page was built for publication: Structured Condition Numbers for Invariant Subspaces
