Some higher-order methods for the simultaneous approximation of multiple polynomial zeros

DOI10.1016/0898-1221(86)90020-9zbMath0618.65032OpenAlexW2120630779WikidataQ115058830 ScholiaQ115058830MaRDI QIDQ4728106

Gradimir V. Milovanović, Miodrag S. Petković, Lidija V. Stefanović

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0898-1221(86)90020-9

zbMATH Keywords

Newton methodacceleration of convergenceR-order of convergenceHalley methodmultiple zeros of a polynomialmethods of higher order

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)

Related Items (10)

On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros ⋮ A family of simultaneous zero finding methods ⋮ On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity ⋮ On using symmetric polynomials for constructing root finding methods ⋮ Higher-order iterative methods for approximating zeros of analytic functions ⋮ A class of simultaneous methods for the zeros of analytic functions ⋮ On the \(R\)-order of some accelerated methods for the simultaneous finding of 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some improvements of square root iteration for polynomial complex zeros
• On the convergence order of accelerated root iterations
• Parallel square-root iterations for multiple roots
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• A family of root finding methods
• A posteriori error bounds for the zeros of polynomials
• Circular arithmetic and the determination of polynomial zeros
• Simultaneous inclusion of the zeros of a polynomial
• Zur iterativen Auflösung algebraischer Gleichungen
• Higher-order iteration functions for simultaneously approximating polynomial zeros
• Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
• Über Simultanverfahren zur Bestimmung reeller Polynomwurzeln
• An Exact Method for Finding the Roots of a Complex Polynomial
• An algorithm for the total, or partial, factorization of a polynomial
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• A modified Newton method for polynomials
• A Generalization of a Theorem of Bôcher
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Methods of Search for Solving Polynomial Equations

This page was built for publication: Some higher-order methods for the simultaneous approximation of multiple polynomial zeros