A fourth order method for finding a simple root of univariate function
Abstract
In this paper, we describe an iterative method for approximating a simple zero $z$ of a real defined function. This method is a essentially based on the idea to extend Newton's method to be the inverse quadratic interpolation. We prove that for a sufficiently smooth function $f$ in a neighborhood of $z$ the order of the convergence is quartic. Using Mathematica with its high precision compatibility, we present some numerical examples to confirm the theoretical results and to compare our method with the others given in the literature.
Downloads
References
I.K. Argyros, D. Chen, Q. Qian, The Jarratt method in Banach space setting, J. Comput. Appl. Math. 51, 103–106, (1994).
R.G. Bartle, The Elements of Real Analysis, second ed., John Wiley and Sons, New York, 1976.
W. Cheney, D. Kincaid, Numerical Mathematics and Computing, Brooks/Cole Publishing Company, Monterey, California, 1980.
C. Chun, Iterative methods improving Newton’s method by the decomposition method, Comput. Math. Appl. 50, 1559–1568, (2005).
C. Chun, B. Neta, Certain improvements of Newton’s method with fourth-order convergence, Applied Mathematics and Computation 215, 821–828, (2009).
S. D. Conte, C. de Boor,Elementary Numerical Analysis, McGraw-Hill Inc., 1980.
M. Frontini, E. Sormani, Some variants of Newton’s method with third-order convergence, J. Comput. Appl. Math. 140, 419–426, (2004).
Y. H. Geum, The asymptotic error constant of leap-frogging Newton’s method locating a simple real zero, Applied Mathematics and Computation 189, 963–969, (2007).
H.H.H. Homeier, A modified Newton method with cubic convergence, J. Comput. Appl. Math. 157, 227–230, (2003).
H.H.H. Homeier, On Newton-type methods with cubic convergence, J. Comput. Appl. Math. 176, 425–432, (2005).
A. B. Kasturiarachi, Leap-frogging Newton’s Method, Int. J. Math. Education. Sci. Technol. 33 (4), 521–527, (2002).
A. R. Kenneth, Elementary Analysis, Springer-Verlag Inc., New York, 1980.
R. King, A family of fourth-order methods for nonlinear equations, SIAM J. Numer. Anal. 10 (5), 876–879, (1973).
J. Kou, L. Yitian, X. Wang, A composite fourth-order iterative method for solving non-linear equations, Appl. Math. Comput. 184, 471–475, (2007).
B. Neta, Several new schemes for solving equations, Int. J. Comput. Math. 23, 265–282, (1987).
F.A. Potra, V. Pta’k, Nondiscrete induction and iterative processes, Research Notes in Mathematics, vol. 103, Pitman, Boston, 1984.
A. Ralston, P. Rabinowitz, A First Course in Numerical Analysis, McGraw-Hill, 1978.
J.R. Sharma, A composite third order NewtonUSteffensen method for solving nonlinear equations, Appl. Math. Comput. 169, 242–246, (2005).
J. Stoer, R. Bulirsh, Introduction to Numerical Analysis, Springer-Verlag Inc., New York, 1980.
E. Süli, D. Mayers,An Introduction to Numerical Analysis, Cambridge University Press, 2003.
J. F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1964.
S. Weerakoon, G.I. Fernando, A variant of Newton’s method with accelerated third-order convergence, Appl. Math. Lett. 17, 87–93, (2000).
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
