On a general class of multipoint root-finding methods of high computational efficiency

DOI10.1137/090758763zbMATH Open1209.65053OpenAlexW2075341408MaRDI QIDQ3069077FDOQ3069077

Publication date: 24 January 2011

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090758763

Recommendations

On a general class of optimal order multipoint methods for solving nonlinear equations
A family of three-point methods of optimal order for solving nonlinear equations
On optimal multipoint methods for solving nonlinear equations
A class of multi-point iterative methods for nonlinear equations
Multipoint iterative method with cubic convergence

numerical examples computational efficiency Newton method nonlinear equation analytic function multipoint iterative methods optimal order of convergence Kung--Traub's conjecture

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cited In (51)

A new family of adaptive methods with memory for solving nonlinear equations
On optimal multipoint methods for solving nonlinear equations
An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
A common framework for modified regula falsi methods and new methods of this kind
On an application of Herzberger's matrix method to multipoint families of root-solvers
Extended high convergence compositions for solving nonlinear equations in Banach space
On a robust Aitken-Newton method based on the Hermite polynomial
A family of three-point methods of Ostrowski's type for solving nonlinear equations
Some novel optimal eighth order derivative-free root solvers and their basins of attraction
On generalized multipoint root-solvers with memory
On a general transformation of multipoint root-solvers
Derivative free two-point methods with and without memory for solving nonlinear equations
Families of third and fourth order methods for multiple roots of nonlinear equations
Iterative methods for solving nonlinear equations with finitely many roots in an interval
A class of three-point root-solvers of optimal order of convergence
Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
Construction of optimal order nonlinear solvers using inverse interpolation
Modified Jarratt method for computing multiple roots
Two optimal families of iterative methods for solving nonlinear equations
A class of multi-point iterative methods for nonlinear equations
Dynamical behaviors of some iterative methods for multiple roots of nonlinear equations
Convergence of a class of efficient quadrature-based predictor-corrector methods for root-finding
Improved Chebyshev-Halley methods with sixth and eighth order convergence
Algorithm for forming derivative-free optimal methods
Multipoint methods for solving nonlinear equations: a survey
Interpolatory multipoint methods with memory for solving nonlinear equations
Eighth order family of iterative methods for nonlinear equations and their basins of attraction
A new optimal method of order four of Hermite-Steffensen type
Revisit of Jarratt method for solving nonlinear equations
A new family of optimal eighth order methods with dynamics for nonlinear equations
New eighth-order iterative methods for solving nonlinear equations
Title not available (Why is that?)
Solving nonlinear equations by a new derivative free iterative method
A family of optimal sixteenth-order multipoint methods with a linear fraction plus a trivariate polynomial as the fourth-step weighting function
On generalized biparametric multipoint root finding methods with memory
Efficient Ostrowski-like methods of optimal eighth and sixteenth order convergence and their dynamics
Unifying fourth-order family of iterative methods
A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function
Remarks on ``On a general class of multipoint root-finding methods of high computational efficiency
On general families of multipoint iterations by inverse interpolation and their applications
Optimal eighth order convergent iteration scheme based on Lagrange interpolation
Computers in mathematical research: the study of three-point root-finding methods
On a general class of optimal order multipoint methods for solving nonlinear equations
Accurate fourteenth-order methods for solving nonlinear equations
Semilocal convergence of Steffensen-type algorithms for solving nonlinear equations
A class of efficient quadrature-based predictor-corrector methods for solving nonlinear systems
A fast and robust method for computing real roots of nonlinear equations
Title not available (Why is that?)
A study of the local convergence of a derivative free method in Banach spaces
A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
Construction and efficiency of multipoint root-ratio methods for finding multiple zeros

This page was built for publication: On a general class of multipoint root-finding methods of high computational efficiency

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