On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros

DOI10.1145/22721.8932zbMath0623.65055OpenAlexW2064253402WikidataQ115058826 ScholiaQ115058826MaRDI QIDQ3761579

Gradimir V. Milovanović, Miodrag S. Petković

Publication date: 1986

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1986-12/

zbMATH Keywords

iterative methodscomputational efficiencypolynomial zerosR-order of convergence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Related Items (17)

On comparison of annuli containing all the zeros of a polynomial ⋮ On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ A highly efficient root-solver of very fast convergence ⋮ Modified Newton method in circular interval arithmetic ⋮ A Neural Root Finder of Polynomials Based on Root Moments ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ On the efficiency of some combined methods for polynomial complex zeros ⋮ On region containing all the zeros of a polynomial ⋮ Annular bounds for the zeros of a polynomial ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ On Geometry of the Zeros of a Polynomial ⋮ On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros ⋮ Iteration functions re-visited ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ The Scientific Work of Gradimir V. Milovanović ⋮ On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros ⋮ The self-validated method for polynomial zeros of high efficiency

This page was built for publication: On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros