Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems

DOI10.1007/s10208-020-09455-yzbMath1455.65056arXiv1905.05466OpenAlexW3011046458MaRDI QIDQ827005

Vanni Noferini, Martin Lotz

Publication date: 6 January 2021

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05466

zbMATH Keywords

condition numberpolynomial eigenvalue problemsingular matrix polynomialstochastic perturbation theoryweak condition number

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Random matrices (algebraic aspects) (15B52) Stochastic analysis (60H99)

Related Items (10)

The limit empirical spectral distribution of complex matrix polynomials ⋮ A Theory of Quantum Subspace Diagonalization ⋮ The limit empirical spectral distribution of Gaussian monic complex matrix polynomials ⋮ The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials ⋮ Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation ⋮ Randomized Joint Diagonalization of Symmetric Matrices ⋮ Singular quadratic eigenvalue problems: linearization and weak condition numbers ⋮ Invertible bases and root vectors for analytic matrix-valued functions ⋮ Root vectors of polynomial and rational matrices: theory and computation ⋮ On computing root polynomials and minimal bases of matrix pencils

Uses Software

• mctoolbox
• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to generate random matrices from the classical compact groups
• Numerical methods for the computation of the confluent and Gauss hypergeometric functions
• Structured eigenvalue condition numbers and linearizations for matrix polynomials
• The computation of Kronecker's canonical form of a singular pencil
• First order spectral perturbation theory of square singular matrix polynomials
• Stochastic perturbations and smooth condition numbers
• On condition numbers and the distance to the nearest ill-posed problem
• Average condition number for solving linear equations
• Complexity theory of numerical linear algebra
• Perturbation theory for matrix equations
• Perturbation theory for homogeneous polynomial eigenvalue problems
• Backward error and condition of polynomial eigenvalue problems
• The real polynomial eigenvalue problem is well conditioned on the average
• Root polynomials and their role in the theory of matrix polynomials
• Average-case complexity without the black swans
• Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
• Condition
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
• The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
• Stochastic Perturbation Theory
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Random matrix theory
• The Probability That a Numerical Analysis Problem is Difficult
• Eigenvalues and Condition Numbers of Random Matrices
• The fundamental theorem of algebra and complexity theory
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• Sensitivity Analysis of Nonlinear Eigenproblems
• Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
• A New Approach to Probabilistic Rounding Error Analysis
• Matrix Polynomials
• Statistical Ensembles of Complex, Quaternion, and Real Matrices
• The Threefold Way. Algebraic Structure of Symmetry Groups and Ensembles in Quantum Mechanics
• Functions of Matrices
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Numerical inverting of matrices of high order
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Numerical Inverting of Matrices of High Order. II

This page was built for publication: Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems