Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials

DOI10.1090/mcom/3338zbMath1434.65030arXiv1611.10142OpenAlexW2644414355MaRDI QIDQ4683168

Jared Lee Aurentz, David S. Watkins, Leonardo Robol, Thomas Mach, Raf Vandebril

Publication date: 20 September 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

eigenvalue problemmatrix polynomialblock-companion matrixcore chasing algorithm

Mathematics Subject Classification ID

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

Related Items (10)

Structured backward errors in linearizations ⋮ On the stability radius for linear time-delay systems ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Factoring Block Fiedler Companion Matrices ⋮ Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ A note on generalized companion pencils in the monomial basis ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Orthogonal iterations on companion-like pencils

Uses Software

• NLEVP
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Designing rational filter functions for solving eigenvalue problems by contour integration
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
• Chebyshev interpolation for nonlinear eigenvalue problems
• Perturbation analysis for the eigenvalue problem of a formal product of matrices
• Block Kronecker linearizations of matrix polynomials and their backward errors
• An algorithm for computing the eigenvalues of block companion matrices
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• Backward error and condition of polynomial eigenvalue problems
• An extension of the \(QZ\) algorithm beyond the Hessenberg-upper triangular pencil
• On Deflations in Extended QR Algorithms
• A note on companion pencils
• Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
• NLEVP
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
• Polynomial Roots from Companion Matrix Eigenvalues
• Fast and Backward Stable Computation of Roots of Polynomials
• Product Eigenvalue Problems
• Matrix Polynomials
• Vector Spaces of Linearizations for Matrix Polynomials
• The Conditioning of Linearizations of Matrix Polynomials
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• The Matrix Eigenvalue Problem
• An Algorithm for Generalized Matrix Eigenvalue Problems

This page was built for publication: Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials