Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils

DOI10.1007/S10543-024-01033-WMaRDI QIDQ6587348zbMATHFDO

Authors Daniel Kressner, Bor Plestenjak

Publication date 14 August 2024

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

random matriceseigenvalue condition numbersingular pencilsingular generalized eigenvalue problemrandomized numerical method

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix pencils (15A22)

Recommendations

• Singular quadratic eigenvalue problems: linearization and weak condition numbers
• Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
• Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation
• On condition numbers of a nondefective multiple eigenvalue of a nonsymmetric matrix pencil

Cites work

• scientific article; zbMATH DE number 3886886 (Why is no real title available?)
• scientific article; zbMATH DE number 3818965 (Why is no real title available?)
• scientific article; zbMATH DE number 3942782 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 1235881 (Why is no real title available?)
• scientific article; zbMATH DE number 1406958 (Why is no real title available?)
• A method for computing all values \({\lambda}\) such that \(A + {\lambda}B\) has a multiple eigenvalue
• Accuracy and Stability of Numerical Algorithms
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Distance problems for linear dynamical systems
• Estimating Extremal Eigenvalues and Condition Numbers of Matrices
• First order spectral perturbation theory of square singular matrix pencils
• How to generate random matrices from the classical compact groups
• Kronecker's canonical form and the QZ algorithm
• Kumaraswamy's distribution: a beta-type distribution with some tractability advantages
• Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
• Root polynomials and their role in the theory of matrix polynomials
• Singular quadratic eigenvalue problems: linearization and weak condition numbers
• Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
• Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation
• Some Generalized Functions for the Size Distribution of Income
• Staircase Failures Explained by Orthogonal Versal Forms
• Structured Backward Error and Condition of Generalized Eigenvalue Problems
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• The computation of Kronecker's canonical form of a singular pencil
• 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
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems

This page was built for publication: Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587348)