Inverse power and Durand-Kerner iterations for univariate polynomial root-finding

DOI10.1016/S0898-1221(04)90037-5zbMath1054.65046OpenAlexW1995134626MaRDI QIDQ1433125

Pan, Victor Y., Luca Gemignani, Dario Andrea Bini

Publication date: 15 June 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(04)90037-5

zbMATH Keywords

algorithmeigenvaluematrix methodsnumerical experimentspolynomial root-findinginverse power iterationgeneralized companion matrixWeierstrass (Durand-Kerner) algorithm

Mathematics Subject Classification ID

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 solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items

The amended DSeSC power method for polynomial root-finding, Global optimality conditions and optimization methods for constrained polynomial programming problems, Matrix computations and polynomial root-finding with preprocessing, Additive preconditioning and aggregation in matrix computations, Efficient polynomial root-refiners: a survey and new record efficiency estimates, On using symmetric polynomials for constructing root finding methods, Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, Root-squaring with DPR1 matrices, Global optimality conditions and optimization methods for polynomial programming problems, Eigen-solving via reduction to DPR1 matrices, Linking the TPR1, DPR1 and arrow-head matrix structures, Additive preconditioning, eigenspaces, and the inverse iteration, Solving secular and polynomial equations: a multiprecision algorithm, Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations, Randomized preprocessing of homogeneous linear systems of equations, New progress in real and complex polynomial root-finding, A QR-method for computing the singular values via semiseparable matrices, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form, The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Coefficient-free adaptations of polynomial root-finders

Uses Software

• mctoolbox
• na20
• na10

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A supplementary bibliography: on roots of polynomials
• Numerical computation of polynomial zeros by means of Aberth's method
• Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Linear construction of companion matrices
• Inclusion of the roots of a polynomial based on Gerschgorin's theorem
• Congenial matrices
• Safe convergence of simultaneous methods for polynomial zeros
• A bibliography on roots of polynomials
• Pseudozeros of polynomials and pseudospectra of companion matrices
• Polynomial zerofinding iterative matrix algorithms
• Computations with infinite Toeplitz matrices and polynomials
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• A composite polynomial zerofinding matrix algorithm
• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• Polynomial root finding using iterated Eigenvalue computation
• Univariate polynomials
• On Grau’s Method for Simultaneous Factorization of Polynomials
• Polynomial Root-Finding Algorithms and Branched Covers
• Solving a Polynomial Equation: Some History and Recent Progress
• Accuracy and Stability of Numerical Algorithms
• Polynomial Roots from Companion Matrix Eigenvalues
• How to find all roots of complex polynomials by Newton's method.