A real QZ algorithm for structured companion pencils
DOI10.1007/s10092-017-0231-6zbMath1382.65097arXiv1608.05395OpenAlexW2511175676MaRDI QIDQ1697282
Luca Gemignani, Yu.S.Eidel'man, Paola Boito
Publication date: 15 February 2018
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05395
complexitynumerical experimentsmatrix pencileigenvalue computationquasiseparable matrixreal QZ algorithmrank-structured matrixLagrange approximationpolynomial rootfinding
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix pencils (15A22) Numerical computation of roots of polynomial equations (65H04)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Completing a matrix when certain entries of its inverse are specified
- On a new class of structured matrices
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems
- Stability of rootfinding for barycentric Lagrange interpolants
- Implicit QR for companion-like pencils
- Robust Successive Computation of Eigenpairs for Nonlinear Eigenvalue Problems
- Fast Reduction of Generalized Companion Matrix Pairs for Barycentric Lagrange Interpolants
- Numerical Algorithms Based on Analytic Function Values at Roots of Unity
- NLEVP
- Principles for Testing Polynomial Zerofinding Programs
- Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
- The Matrix Eigenvalue Problem
This page was built for publication: A real QZ algorithm for structured companion pencils
