Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils
From MaRDI portal
Publication:6587348
DOI10.1007/s10543-024-01033-wzbMATH Open1545.6516MaRDI QIDQ6587348
Bor Plestenjak, Daniel Kressner
Publication date: 14 August 2024
Published in: BIT (Search for Journal in Brave)
random matriceseigenvalue condition numbersingular pencilsingular generalized eigenvalue problemrandomized numerical method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Matrix pencils (15A22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to generate random matrices from the classical compact groups
- Kumaraswamy's distribution: a beta-type distribution with some tractability advantages
- The computation of Kronecker's canonical form of a singular pencil
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- First order spectral perturbation theory of square singular matrix pencils
- Kronecker's canonical form and the QZ algorithm
- Root polynomials and their role in the theory of matrix polynomials
- A method for computing all values \({\lambda}\) such that \(A + {\lambda}B\) has a multiple eigenvalue
- Singular quadratic eigenvalue problems: linearization and weak condition numbers
- Distance Problems for Linear Dynamical Systems
- Some Generalized Functions for the Size Distribution of Income
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Accuracy and Stability of Numerical Algorithms
- Staircase Failures Explained by Orthogonal Versal Forms
- Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation
This page was built for publication: Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils