The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
analytic functions of matricesangle between subspacesblock diagonal scalingblock diagonalizationcondition numberequivalence transformationsill-conditionedoptimal condition numberspectral condition number
Conditioning of matrices (15A12) 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 eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
- On condition numbers and the distance to the nearest ill-posed problem
- Computing stable eigendecompositions of matrices
- Computing stable eigendecompositions of matrix pencils
- Pseudospectra of linear matrix pencils by block diagonalization
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Stable polefinding and rational least-squares fitting via eigenvalues
- Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: Theory, algorithms and software
- On a theorem of Feingold
- Pole placement preconditioning
- On the selection of poles in the single-input pole placement problem
- Rescaling the GSVD with application to ill-posed problems
- Approximation of pseudospectra of block triangular matrices
- A modified optimization method for robust partial quadratic eigenvalue assignment using receptances and system matrices
- Distributed weighted least-squares estimation with fast convergence for large-scale systems
- Sampling algebraic sets in local intrinsic coordinates
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- Perturbations of Triangular Matrix Factorizations
- Sylvester equations and polynomial separation of spectra
- Orthogonal polynomial expansions for the matrix exponential
- Optimal preconditioners of a given sparsity pattern
- Strong NP-completeness of a matrix similarity problem
- Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
- Global convergence of Hessenberg shifted QR. III: Approximate Ritz values via shifted inverse iteration
- Bounds for singular values based on the eigenvectors
- A note on optimal block-scaling of matrices
- Multiple eigenvalue sensitivity analysis
This page was built for publication: The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747457)
