An iterated eigenvalue algorithm for approximating roots of univariate polynomials
From MaRDI portal
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)
The author studies an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. A few interesting examples including ill-conditioned polynomials are carefully implemented for the algorithms.
Recommendations
- Polynomial root finding using iterated eigenvalue computation
- Real and complex polynomial root-finding by means of eigen-solving
- Structured matrix methods for polynomial root-finding
- Faulty sets of Boolean formulas and ukasiewicz logic
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
Cites work
- A bibliography on roots of polynomials
- A composite polynomial zerofinding matrix algorithm
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1256676 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- On condition numbers and the distance to the nearest ill-posed problem
- Polynomial root finding using iterated eigenvalue computation
- Polynomial Roots from Companion Matrix Eigenvalues
- Polynomial zerofinding iterative matrix algorithms
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Solving a Polynomial Equation: Some History and Recent Progress
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
Cited in
(34)- Efficient isolation of polynomial's real roots.
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- An adaptive subdivision method for root finding of univariate polynomials
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A bound on the spectral radius of graphs in terms of their Zagreb indices
- Solving secular and polynomial equations: a multiprecision algorithm
- A note on generalized companion pencils in the monomial basis
- Real polynomial root-finding by means of matrix and polynomial iterations
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Additive preconditioning and aggregation in matrix computations
- Root-squaring with DPR1 matrices
- An experimental investigation of the normality of irrational algebraic numbers
- On applications of iteration algorithms and Skorobagatko's branching fractions to approximation of roots of polynomials in Banach algebras
- Polynomial root finding using iterated eigenvalue computation
- Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities
- Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- scientific article; zbMATH DE number 1262456 (Why is no real title available?)
- Remark on Algorithms to Find Roots of Polynomials
- Computing multiple roots of inexact polynomials
- scientific article; zbMATH DE number 953013 (Why is no real title available?)
- Computing real roots of real polynomials
- Global optimality conditions and optimization methods for polynomial programming problems
- Analyticity of the Ising susceptibility: an interpretation
- Iterative algorithms and branching fractions for factoring polynomials in numerical fields and Banach algebras
- New progress in real and complex polynomial root-finding
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
- Approximating roots by quadratic iteration
- Matrix approach to solve polynomial equations
- Root-finding by expansion with independent constraints
- Additive preconditioning, eigenspaces, and the inverse iteration
This page was built for publication: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697487)
