On the guaranteed convergence of new two-point root-finding methods for polynomial zeros

DOI10.1007/s11075-013-9782-zzbMath1308.65069MaRDI QIDQ742856

Lidija Z. Rančić, Miodrag S. Petković

Publication date: 19 September 2014

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-013-9782-z

zbMATH Keywords

convergence; numerical example; iterative methods; polynomial zeros; root-finding methods; Ostrowski two-point method; Weierstrass correction

Mathematics Subject Classification ID

65H04: Numerical computation of roots of polynomial equations

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
• Unnamed Item
• A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations
• On the convergence order of accelerated root iterations
• Numerical methods for roots of polynomials. Part I
• Point estimation of root finding methods
• On Q-order and R-order of convergence
• An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
• Convergence conditions of some methods for the simultaneous computation of polynomial zero
• Improvement of a convergence condition for Durand-Kerner iteration
• Weierstrass formula and zero-finding methods
• The theory of Smale's point estimation and its applications
• On initial conditions for the convergence of simultaneous root finding methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• Higher-order iteration functions for simultaneously approximating polynomial zeros
• Approximate Zeros of Quadratically Convergent Algorithms
• 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 family of two-point methods with memory for solving nonlinear equations
• Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
• On a cubically convergent derivative-free root finding method
• Families of optimal multipoint methods for solving nonlinear equations: A survey