Finding polynomial roots: A fast algorithm convergent on the complex plane

DOI10.1002/CNM.1630010606MaRDI QIDQ3729924zbMATH OpenOpenAlexFDO

Authors Andrey V. Ivanisov, Vadim K. Polishchuk

Publication date 1985

Published in Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cnm.1630010606

zbMATH Keywords

global convergencelocal convergencepolynomial rootsroots of entire functions

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)

Recommendations

• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• An algorithm for computing the roots of a complex polynomial
• scientific article; zbMATH DE number 3909639
• A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
• A parallel algorithm for finding roots of a complex polynomial
• Simple algorithms for approximating all roots of a polynomial with real roots
• scientific article; zbMATH DE number 1263360
• ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
• A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
• Remark on Algorithms to Find Roots of Polynomials

Cited in

(19)

• Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
• A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm
• Quantum algorithm for the root-finding problem
• An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
• Accelerated approximation of the complex roots of a univariate polynomial
• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
• scientific article; zbMATH DE number 3886996 (Why is no real title available?)
• The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots
• scientific article; zbMATH DE number 3909639 (Why is no real title available?)
• scientific article; zbMATH DE number 4039137 (Why is no real title available?)
• scientific article; zbMATH DE number 4084864 (Why is no real title available?)
• A fitting algorithm for real coefficient polynomial rooting
• scientific article; zbMATH DE number 579389 (Why is no real title available?)
• An algorithm for computing the roots of a complex polynomial
• When Newton meets Descartes
• Finding the roots of polynomial equations: An algorithm with linear command
• Approximating roots by quadratic iteration
• Finding cactus roots in polynomial time
• Finding roots by deflated polynomial approximation

This page was built for publication: Finding polynomial roots: A fast algorithm convergent on the complex plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729924)