Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
type: Item
instance of: scholarly article
title: Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
zbMATH Open document ID: 1328.65117
author: Xiaofeng Wang
author: Tie Zhang
published in: Numerical Algorithms
publication date: 2015-10-19T00:00:00Z
review text: A new family of \(n\)-point derivative-free iterative methods with and without memory for solving nonlinear equations is proposed. The convergence order of the new \(n\)-point derivative-free methods with memory is \((2^{n+1} - 1 + \sqrt{2^{2(n+1)} + 1}) /2\). The computational efficiency of the new \(n\)-point methods with memory is very high. Numerical results are given.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6495735
zbMATH Keywords: multipoint iterative methods
zbMATH Keywords: computational efficiency
zbMATH Keywords: nonlinear equations
zbMATH Keywords: root-finding methods
zbMATH Keywords: derivative-free
zbMATH Keywords: convergence order
zbMATH Keywords: numerical result
reviewed by: Anton Iliev
MaRDI profile type: Publication
full work available at URL: s11075-014-9951-8
OpenAlex ID: W2078532150
cites work: Q5652137
cites work: Optimal Order of One-Point and Multipoint Iteration
cites work: On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
cites work: A new family of higher order methods for solving equations
cites work: An optimal Steffensen-type family for solving nonlinear equations
cites work: Q4752897
cites work: A new sixth-order scheme for nonlinear equations
cites work: Some eighth-order root-finding three-step methods
cites work: A new family of modified Ostrowski's methods with accelerated eighth order convergence
cites work: Three-step iterative methods with eighth-order convergence for solving nonlinear equations
cites work: A family of three-point methods of optimal order for solving nonlinear equations
cites work: Iterative methods based on the signum function approach for solving nonlinear equations
cites work: Optimal Steffensen-type methods with eighth order of convergence
cites work: A class of two-step Steffensen type methods with fourth-order convergence
cites work: A family of Steffensen type methods with seventh-order convergence
cites work: On an efficient family of derivative free three-point methods for solving nonlinear equations
cites work: A new family of Newton-type iterative methods with and without memory for solving nonlinear equations
cites work: SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS
cites work: Q4979465
cites work: Derivative free two-point methods with and without memory for solving nonlinear equations
cites work: Interpolatory multipoint methods with memory for solving nonlinear equations
cites work: Three-point methods with and without memory for solving nonlinear equations
cites work: On generalized multipoint root-solvers with memory
cites work: On efficient two-parameter methods for solving nonlinear equations
cites work: On generalized biparametric multipoint root finding methods with memory
cites work: Variants of Newton's method using fifth-order quadrature formulas
DOI: 10.1007/S11075-014-9951-8
description: scientific article; zbMATH DE number 6495735