The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
From MaRDI portal
Publication:1940317
DOI10.1016/j.laa.2011.10.035zbMath1269.65034arXiv1111.2974MaRDI QIDQ1940317
Vanni Noferini, Luca Gemignani
Publication date: 6 March 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.2974
eigenvalues; rank-structured matrix; Ehrlich-Aberth root-finding algorithm; palindromic matrix polynomials
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65H05: Numerical computation of solutions to single equations
15A16: Matrix exponential and similar functions of matrices
Related Items
CALCULATION OF THE NUMBER OF PALINDROMS IN A BINARY SYSTEM, Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method, Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials, Implicit QR for rank-structured matrix pencils, Symmetric polynomials in the symplectic alphabet and the change of variables \(z_j = x_j + x_j^{-1}\), Numerical Instability of Resultant Methods for Multidimensional Rootfinding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Palindromic companion forms for matrix polynomials of odd degree
- Numerical computation of polynomial zeros by means of Aberth's method
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- Smith forms of palindromic matrix polynomials
- A Hessenberg Reduction Algorithm for Rank Structured Matrices
- Linearization of matrix polynomials expressed in polynomial bases
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Jacobi-like Algorithms for the Indefinite Generalized Hermitian Eigenvalue Problem
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- The Derivative of a Determinant
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Vector Spaces of Linearizations for Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Numerical Methods for the Tridiagonal Hyperbolic Quadratic Eigenvalue Problem
- Symmetric Linearizations for Matrix Polynomials
- A modified Newton method for polynomials
- The Factorization of Matricial Spectral Densities
- How to find all roots of complex polynomials by Newton's method.
