Structured Condition Numbers for Invariant Subspaces
Authors:
- Ralph ByersRBRalph Byers
- Daniel KressnerDKDaniel Kressner
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 28 (2) , 326-347
Abstract
Invariant subspaces of structured matrices are sometimes better conditioned with respect to structured perturbations than with respect to general perturbations. Sometimes they are not. This paper proposes an appropriate condition number $c_{\S}$, for invariant subspaces subject to structured perturbations. Several examples compare $c_{\S}$ with the unstructured condition number. The examples include block cyclic, Hamiltonian, and orthogonal matrices. This approach extends naturally to structured generalized eigenvalue problems such as palindromic matrix pencils.
Keywords
This publication has 32 references indexed in Scilit:
- On the Condition of a Complex Eigenvalue under Real PerturbationsBIT Numerical Mathematics, 2004
- Perturbation Analysis for the Eigenvalue Problem of a Formal Product of MatricesBIT Numerical Mathematics, 2002
- Accuracy and Stability of Numerical Algorithms2002
- Structured Backward Error and Condition of Generalized Eigenvalue ProblemsSIAM Journal on Matrix Analysis and Applications, 1998
- Numerical solution of the discrete-time periodic Riccati equationIEEE Transactions on Automatic Control, 1994
- Computing stable eigendecompositions of matrix pencilsLinear Algebra and its Applications, 1987
- On the Singular “Vectors” of the Lyapunov OperatorSIAM Journal on Algebraic Discrete Methods, 1987
- Computing stable eigendecompositions of matricesLinear Algebra and its Applications, 1986
- A LINPACK-style condition estimator for the equationAX-XB^{T} = CIEEE Transactions on Automatic Control, 1984
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972