Coefficient-free adaptations of polynomial root-finders

DOI10.1016/j.camwa.2004.05.019zbMath1088.65044OpenAlexW1973211066MaRDI QIDQ814095

Pan, Victor Y.

Publication date: 2 February 2006

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

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.05.019

zbMATH Keywords

algorithmsAberth's methodDurand-Kerner's methodeigenvalues of a matrixquadratic and cubic local convergence

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Linear construction of companion matrices
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Improved initialization of the accelerated and robust QR-like polynomial root-finding
• A posteriori error bounds for the zeros of polynomials
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
• On Grau’s Method for Simultaneous Factorization of Polynomials
• Solving a Polynomial Equation: Some History and Recent Progress
• A Fast Algorithm for Trummer’s Problem
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• A modified Newton method for polynomials
• A fast algorithm for particle simulations