On the higher-order method for the solution of a nonlinear scalar equation
type: Item
instance of: scholarly article
title: On the higher-order method for the solution of a nonlinear scalar equation
zbMATH Open document ID: 1277.65030
author: Min Chen
author: T. S. Chang
published in: Journal of Optimization Theory and Applications
publication date: 2011-09-06T00:00:00Z
review text: The Newton method is the most popular method in numerical analysis for finding a simple root of a nonlinear scalar equation in one variable, i.e. for finding \(x^* \in \mathbb R\) such that \(f(x^*) = 0\). For a higher convergence rate, some algorithms were developed such as the Halley method [\textit{H. Bateman}, Am. Math. Mon. 45, 11--17 (1938; Zbl 0018.16103); \textit{M. A. Noor} et al., Appl. Math. Comput. 189, No. 2, 1268--1273 (2007; Zbl 1243.65053))] and the Chebyshev method [\textit{C. Chun}, Appl. Math. Comput. 189, No. 1, 597--601 (2007; Zbl 1122.65324)] and also generalized from time to time. A different method with higher order of convergence was developed by \textit{A. Germani} et al. [J. Optim. Theory Appl. 131, No. 3, 347--364 (2006; Zbl 1118.65034)] which is proved to be locally convergent with order \((m + 1)\), where \(m\) is the highest-order derivative used in the iterative formula. In this paper the authors generalise further by developing a new algorithm, which has a convergence rate with one order higher, i.e., \((m+2)\). Some numerical examples are used to demonstrate the new method.
reviewed by: C. L. Parihar
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65D15
zbMATH DE Number: 5945533
zbMATH Keywords: nonlinear equation
zbMATH Keywords: iterative method
zbMATH Keywords: simple root
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s10957-011-9796-4
OpenAlex ID: W2008604905
cites work: A new modified Halley method without second derivatives for nonlinear equation
cites work: Q5732060
cites work: Haley's Methods for Solving Equations
cites work: Certain improvements of Chebyshev-Halley methods with accelerated fourth-order convergence
cites work: Some variant of Newton's method with third-order convergence.
cites work: Iterative methods improving Newton's method by the decomposition method
cites work: Higher-order method for the solution of a nonlinear scalar equation
cites work: Q4060241
cites work: On Two Higher Order Enclosing Methods of J. W. Schmidt
cites work: On Enclosing Simple Roots of Nonlinear Equations
cites work: On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)
cites work: Q3343091
DOI: 10.1007/S10957-011-9796-4
description: scientific article; zbMATH DE number 5945533