A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations

DOI10.1016/j.camwa.2011.12.037zbMath1247.65062OpenAlexW2073739555MaRDI QIDQ453847

Gyurhan H. Nedzhibov

Publication date: 30 September 2012

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

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

zbMATH Keywords

nonlinear equationsorder of convergenceroot-finding methodssimultaneous methods

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (3)

On the guaranteed convergence of new two-point root-finding methods for polynomial zeros ⋮ On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method ⋮ Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations

Cites Work

• Sixth order derivative free family of iterative methods
• Derivative free algorithm for solving nonlinear equations
• On new higher order families of simultaneous methods for finding polynomial zeros
• On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
• On the R-order of convergence of a family of methods for simultaneous extraction of part of all roots of algebraic polynomials
• An efficient higher order family of root finders
• An acceleration of iterative processes for solving nonlinear equations
• Constructing third-order derivative-free iterative methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations