Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
From MaRDI portal
(Redirected from Publication:827005)
Abstract: We propose a new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theory fail to predict the observed accuracy of computed solutions. To motivate our ideas, we present examples of problems that are discontinuous at a given input and have infinite classical and stochastic condition number, but where the solution is still computed to machine precision without relying on structured algorithms. Stimulated by the failure of classical and stochastic perturbation theory in capturing such phenomena, we define and analyse a weak worst-case and a weak stochastic condition number. This new theory is a more powerful predictor of the accuracy of computations than existing tools, especially when the worst-case and the expected sensitivity of a problem to perturbations of the input is not finite. We apply our analysis to the computation of simple eigenvalues of matrix polynomials, including the more difficult case of singular matrix polynomials. In addition, we show how the weak condition numbers can be estimated in practice.
Recommendations
- Singular quadratic eigenvalue problems: linearization and weak condition numbers
- On condition numbers of polynomial eigenvalue problems
- scientific article; zbMATH DE number 1210851
- The Probability That a Numerical Analysis Problem is Difficult
- A comparison of eigenvalue condition numbers for matrix polynomials
Cites work
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- A New Approach to Probabilistic Rounding Error Analysis
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Average condition number for solving linear equations
- Average-case complexity without the black swans
- Backward error and condition of polynomial eigenvalue problems
- Complexity theory of numerical linear algebra
- Concentration inequalities. A nonasymptotic theory of independence
- Condition. The geometry of numerical algorithms
- Eigenvalues and Condition Numbers of Random Matrices
- First order spectral perturbation theory of square singular matrix polynomials
- Functions of Matrices
- Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
- How to generate random matrices from the classical compact groups
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Log-gases and random matrices.
- Mathematical aspects of computer science smoothed analysis of condition numbers
- Matrix Polynomials
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Numerical Inverting of Matrices of High Order. II
- Numerical inverting of matrices of high order
- Numerical methods for the computation of the confluent and Gauss hypergeometric functions
- On condition numbers and the distance to the nearest ill-posed problem
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Perturbation theory for matrix equations
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Random matrix theory
- Root polynomials and their role in the theory of matrix polynomials
- Sensitivity analysis of nonlinear eigenproblems
- Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
- Statistical Ensembles of Complex, Quaternion, and Real Matrices
- Stochastic Perturbation Theory
- Stochastic perturbations and smooth condition numbers
- Structured eigenvalue condition numbers and linearizations for matrix polynomials
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- The Probability That a Numerical Analysis Problem is Difficult
- The Threefold Way. Algebraic Structure of Symmetry Groups and Ensembles in Quantum Mechanics
- The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
- The computation of Kronecker's canonical form of a singular pencil
- The fundamental theorem of algebra and complexity theory
- The real polynomial eigenvalue problem is well conditioned on the average
Cited in
(13)- Root vectors of polynomial and rational matrices: theory and computation
- Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation
- Singular quadratic eigenvalue problems: linearization and weak condition numbers
- The limit empirical spectral distribution of complex matrix polynomials
- scientific article; zbMATH DE number 440635 (Why is no real title available?)
- Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils
- Invertible bases and root vectors for analytic matrix-valued functions
- On computing root polynomials and minimal bases of matrix pencils
- A Theory of Quantum Subspace Diagonalization
- Randomized Joint Diagonalization of Symmetric Matrices
- A Riemannian optimization method to compute the nearest singular pencil
- The limit empirical spectral distribution of Gaussian monic complex matrix polynomials
- The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials
This page was built for publication: Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827005)
