# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
A sixth order method for nonlinear equations. (English) Zbl 1154.65327
Summary: A sixth order method is developed by extending a third order method of S. Weerakoon and T. G. I. Fernando [Appl. Math. Lett. 13, No. 8, 87–93 (2000; Zbl 0973.65037)] for finding the real roots of nonlinear equations in $R$. Starting with a suitably chosen ${x}_{0}$, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. In terms of computational cost, it requires evaluations of only two functions and two first derivatives per iteration. This implies that efficiency index of our method is 1.565. Our method is comparable with the methods of B. Neta [Int. J. Comput. Math. 7, 158–161 (1979; Zbl 0397.65032)] and that of J. Kou and Y. Li [Appl. Math. Comput. 189, No. 2, 1816–1821 (2007; Zbl 1122.65338)]. It does not require the evaluation of the second order derivative of the given function as required in the family of Chebyshev-Halley type methods [J. Kou and X. Wang, Appl. Math. Comput. 190, No. 2, 1839–1843 (2007; Zbl 1122.65339); J. Kou, Appl. Math. Comput. 190, No. 1, 126–131 (2007; Zbl 1122.65334)]. The efficacy of the method is tested on a number of numerical examples. It is observed that our method takes less number of iterations than Newton’s method and the method of Weerakoon and Fernando. On comparison with the other sixth order methods, it behaves either similarly or better for the examples considered.
##### MSC:
 65H05 Single nonlinear equations (numerical methods)