The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs

DOI10.1137/17M1139941zbMath1409.65021arXiv1706.06025WikidataQ128425099 ScholiaQ128425099MaRDI QIDQ3119536

Diego Armentano, Carlos Beltran

Publication date: 12 March 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

condition numbergeneralized eigenvalue problempolynomial eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (9)

Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems ⋮ Efficient sampling in spectrahedra and volume approximation ⋮ The limit empirical spectral distribution of complex matrix polynomials ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ The limit empirical spectral distribution of Gaussian monic complex matrix polynomials ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Algebraic linearizations of matrix polynomials ⋮ The real polynomial eigenvalue problem is well conditioned on the average ⋮ Minimal height companion matrices for Euclid polynomials

Uses Software

• quadeig

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for analyzing nonlinear eigenproblems and parametrized linear systems
• Fast linear homotopy to find approximate zeros of polynomial systems
• A fast implicit QR eigenvalue algorithm for companion matrices
• Stochastic perturbations and smooth condition numbers
• Implicit double shift \(QR\)-algorithm for companion matrices
• On condition numbers and the distance to the nearest ill-posed problem
• A stable, polynomial-time algorithm for the eigenpair problem
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular 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
• A facility location formulation for stable polynomials and elliptic Fekete points
• A randomized homotopy for the Hermitian eigenpair problem
• On the condition of the zeros of characteristic polynomials
• Backward stability of polynomial root-finding using Fiedler companion matrices
• On the Inverse Symmetric Quadratic Eigenvalue Problem
• An algorithm for the complete solution of quadratic eigenvalue problems
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Eigenvalues and Condition Numbers of Random Matrices
• Complexity of Bezout's Theorem I: Geometric Aspects
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
• Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• The Conditioning of Linearizations of Matrix Polynomials
• Condition Numbers of Gaussian Random Matrices

This page was built for publication: The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs