The convergence of a family of parallel zero-finding methods

DOI10.1016/J.CAMWA.2004.01.010zbMATH Open1069.65052OpenAlexW113723831MaRDI QIDQ1767950FDOQ1767950

Authors: M. S. Petković, Snežana Ilić, Lidija Z. Rančić 

Publication date: 8 March 2005

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

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

Recommendations

• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• Point estimation of a family of simultaneous zero-finding methods
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• On the guaranteed convergence of the Japanese zero-finding method
• A new fourth-order family of simultaneous methods for finding polynomial zeros

zbMATH Keywords

convergencesimultaneous methodszeros of polynomialscircular complex arithmetic

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) Interval and finite arithmetic (65G30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cites Work

• Title not available (Why is that?)
• Convergence of Newton’s method and inverse function theorem in Banach space
• Title not available (Why is that?)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials
• A family of root finding methods
• Parallel Laguerre iterations: The complex case
• Title not available (Why is that?)
• The fundamental theorem of algebra and complexity theory
• Approximate Zeros of Quadratically Convergent Algorithms
• The theory of Smale's point estimation and its applications
• Title not available (Why is that?)
• Weierstrass formula and zero-finding methods
• On zero finding methods of higher order from data at one point
• Improvement of a convergence condition for Durand-Kerner iteration
• On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
• Title not available (Why is that?)
• A high-order iterative formula for simultaneous determination of zeros of a polynomial
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• Title not available (Why is that?)
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• On some simultaneous methods based on Weierstrass' correction
• Point estimation of a family of simultaneous zero-finding methods

Cited In (8)

• An effective implementation of a modified Laguerre method for the roots of a polynomial
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• On initial conditions for the convergence of simultaneous root finding methods
• On the guaranteed convergence of the Japanese zero-finding method
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
• An efficient higher order family of root finders

This page was built for publication: The convergence of a family of parallel zero-finding methods

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