The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils

DOI10.1137/0720040zbMath0509.65020OpenAlexW2036182269MaRDI QIDQ4747457

James W. Demmel

Publication date: 1983

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0720040

zbMATH Keywords

condition numberblock diagonalizationequivalence transformationsspectral condition numberill-conditionedangle between subspacesanalytic functions of matricesoptimal condition numberblock diagonal scaling

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Functional calculus for linear operators (47A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Related Items (26)

Pole placement preconditioning ⋮ On condition numbers and the distance to the nearest ill-posed problem ⋮ Computing stable eigendecompositions of matrices ⋮ Computing stable eigendecompositions of matrix pencils ⋮ Stable polefinding and rational least-squares fitting via eigenvalues ⋮ Pseudospectra of linear matrix pencils by block diagonalization ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Sampling algebraic sets in local intrinsic coordinates ⋮ Multiple eigenvalue sensitivity analysis ⋮ On the selection of poles in the single-input pole placement problem ⋮ A modified optimization method for robust partial quadratic eigenvalue assignment using receptances and system matrices ⋮ Strong NP-completeness of a matrix similarity problem ⋮ Orthogonal polynomial expansions for the matrix exponential ⋮ Rescaling the GSVD with application to ill-posed problems ⋮ Optimal preconditioners of a given sparsity pattern ⋮ Approximation of pseudospectra of block triangular matrices ⋮ Sylvester equations and polynomial separation of spectra ⋮ A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions ⋮ Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software ⋮ Perturbations of Triangular Matrix Factorizations ⋮ Bounds for singular values based on the eigenvectors ⋮ On a theorem of Feingold ⋮ Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices ⋮ A note on optimal block-scaling of matrices ⋮ Distributed weighted least-squares estimation with fast convergence for large-scale systems ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian

This page was built for publication: The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils