A family of composite fourth-order iterative methods for solving nonlinear equations

DOI10.1016/j.amc.2006.09.009zbMath1116.65054OpenAlexW2070251772MaRDI QIDQ883902

Changbum Chun

Publication date: 12 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.009

zbMATH Keywords

Newton's methodnumerical examplesiterative methodsnonlinear equationsorder of convergence

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (24)

An optimal fourth order iterative method for solving nonlinear equations and its dynamics ⋮ A family of three-point methods of optimal order for solving nonlinear equations ⋮ Certain improvements of Chebyshev-Halley methods with accelerated fourth-order convergence ⋮ A one-parameter fourth-order family of iterative methods for nonlinear equations ⋮ An efficient and straightforward numerical technique coupled to classical Newton's method for enhancing the accuracy of approximate solutions associated with scalar nonlinear equations ⋮ Derivative free two-point methods with and without memory for solving nonlinear equations ⋮ Construction of optimal order nonlinear solvers using inverse interpolation ⋮ Necessary and sufficient conditions for the convergence of two- and three-point Newton-type iterations ⋮ Family of Cubically Convergent Schemes Using Inverse Newton Function for Multiple Roots ⋮ An optimal fourth-order family of modified Cauchy methods for finding solutions of nonlinear equations and their dynamical behavior ⋮ Optimal eighth order convergent iteration scheme based on Lagrange interpolation ⋮ Zero-finder methods derived using Runge-Kutta techniques ⋮ Iterative methods for solving nonlinear equations with finitely many roots in an interval ⋮ A NEW APPROACH FOR CONVERGENCE ACCELERATION OF ITERATIVE METHODS IN STRUCTURAL ANALYSIS ⋮ Third order derivative free SPH iterative method for solving nonlinear systems ⋮ From third to fourth order variant of Newton's method for simple roots ⋮ A family of fast derivative-free fourth-order multipoint optimal methods for nonlinear equations ⋮ A class of three-point root-solvers of optimal order of convergence ⋮ Unifying fourth-order family of iterative methods ⋮ New highly efficient families of higher-order methods for simple roots, permitting \(f'(x_n)=0\) ⋮ A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs ⋮ Optimal fourth order methods with its multi-step version for nonlinear equation and their basins of attraction ⋮ Some sixth order zero-finding variants of Chebyshev-Halley methods ⋮ Adams-like techniques for zero-finder methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative methods improving Newton's method by the decomposition method
• A modification of Newton method with third-order convergence
• Some iterative schemes for nonlinear equations
• A composite fourth-order iterative method for solving nonlinear equations
• Fourth-order iterative methods free from second derivative
• The Jarratt method in Banach space setting
• A modified Newton method for rootfinding with cubic convergence.
• Some variant of Newton's method with third-order convergence.
• On Newton-type methods with cubic convergence
• A composite third order Newton-Steffensen method for solving nonlinear equations
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: A family of composite fourth-order iterative methods for solving nonlinear equations