Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-25T21:42:52.024Z Has data issue: false hasContentIssue false

Quadrature Based Optimal Iterative Methods with Applications in High-Precision Computing

Published online by Cambridge University Press:  28 May 2015

Sanjay Kumar Khattri*
Affiliation:
Stord/Haugesund University College, Department of Engineering, Haugesund, Norway
*
*Corresponding author.Email address:sanjay.khattri@hsh.no
Get access

Abstract

We present a simple yet effective and applicable scheme, based on quadrature, for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on n + 1 evaluations could achieve a maximum convergence order of 2n. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can further be applied to develop iterative methods of even higher orders. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Argyros, I. K. and Hilout, S., On Newton’s method for solving nonlinear equations and function splitting, Numer. Math. Theor. Meth. Appl., 4 (2011), pp. 5367.Google Scholar
[2]Weerakoon, S. and Fernando, T. G. I., A variant of Newton’s method with accelerated third-order convergence, Appl. Math. Lett., 13 (2000), pp. 8793.CrossRefGoogle Scholar
[3]Soleymani, F., Khattri, S. K. and Vanani, S. K., Two new classes of optimal Jarratt-type fourth-order methods, Appl. Math. Lett., 25(5), (2012), pp. 847853CrossRefGoogle Scholar
[4]Soleymani, F., Sharifi, M. and Mousavi, B. S., An improvement of Ostrowski’s and King’s techniques with optimal convergence order eight, J. Optim. Theory Appl., 153(1), (2012), pp. 225236CrossRefGoogle Scholar
[5]Petkovic, M. S., Dzunic, J. and Milosevic, M. R., Traub’s accelerating generator of iterative root-finding methods, Appl. Math. Lett., 24 (2011), pp. 14431448.CrossRefGoogle Scholar
[6]Dzunic, J., Petkovic, M. S. and Petkovic, L. D., A family of optimal three-point methods for solving nonlinear equations using two parametric functions, Appl. Math. Comput., 217 (2011), pp. 76127619.Google Scholar
[7]Petkovic, M. S., Dzunic, J. and Neta, B., Interpolatory multipoint methods with memory for solving nonlinear equations, Appl. Math. Comput., 218 (2011), pp. 25332541.Google Scholar
[8]Heydari, M., Hosseini, S. M. and Loghmani, G. B., On two new families of iterative methods for solving nonlinear equations with optimal order, Appl. Anal. Discrete Math., 5 (2011), pp. 93109.CrossRefGoogle Scholar
[9]Frontini, M. and Sormani, E., Some variant of Newton’s method with third-order convergence, Appl. Math. Comput., 140 (2003), pp. 419426.Google Scholar
[10]Homeier, H. H. H., On Newton-type methods with cubic convergence, J. Comput. Appl. Math., 176 (2005), pp. 425–432.CrossRefGoogle Scholar
[11]Homeier, H. H. H., A modified Newton method for rootfinding with cubic convergence, J. Comput. Appl. Math., 157 (2003), pp. 227–230.CrossRefGoogle Scholar
[12]Kung, H. T. and Traub, J. F., Optimal order of one-point and multipoint iteration, J. Assoc. Comput. Math., 21 (1974), pp. 634–651.CrossRefGoogle Scholar
[13]Jarratt, P., Some fourth order multipoint iterative methods for solving equations, Math. Comp., 20 (1996), pp. 434–437.Google Scholar
[14]Chun, C., Some fourth-order iterative methods for solving nonlinear equations, Appl. Math. Comput., 195 (2008), pp. 454–459.Google Scholar
[15]Maheshwari, A. K., A fourth-order iterative method for solving nonlinear equations, Appl. Math. Comput., 211 (2009), pp. 383–391.Google Scholar
[16]Traub, J. F., Iterative Methods for the Solution of Equations, Prentice Hall, New York, 1964.Google Scholar
[17]Ostrowski, A. M., Solution of Equations and Systems of Equations, Academic Press, New York London, 1966.Google Scholar
[18]Kou, J., Li, Y. and Wang, X., A composite fourth-order iterative method, Appl. Math. Comput., 184 (2007), pp. 471–475.Google Scholar
[19]King, R., A family of fourth order methods for nonlinear equations, SIAM J. Numer. Anal., 10 (1973), pp. 876–879.CrossRefGoogle Scholar
[20]Petkovicć, M. S., On a general class of multipoint root-finding methods of high computational efficiency, SIAM. J. Numer. Anal., 47 (2010), pp. 4402–4414.CrossRefGoogle Scholar
[21]Khattri, S. K., Altered Jacobian Newton iterative method for nonlinear elliptic problems, IAENG Int. J. Appl. Math., 38 (2008).Google Scholar
[22]Khattri, S. K. and Log, T., Derivative free algorithm for solving nonlinear equations, Computing, 92(2), (2011), pp. 169–179.CrossRefGoogle Scholar
[23]Khattri, S. K. and Log, T., Constructing third-order derivative-free iterative methods, Int. J. Comput. Math., 88, (2011), pp. 1509–1518.CrossRefGoogle Scholar
[24]Kanwar, V. and Tomar, S. K., Modified families of Newton, Halley and Chebyshev methods, Appl. Math. Comput., 192 (2007), pp. 20–26.Google Scholar
[25]Li, X., Mu, C., Ma, J. and Wang, C., Sixteenth order method for nonlinear equations, Appl. Math. Comput., 215 (2009), pp. 3769–4054.Google Scholar
[26]Ren, H., Wu, Q. and Bi, W., New variants of Jarratts method with sixth-order convergence, Numer. Algorithms, 52 (2009), pp. 585603.CrossRefGoogle Scholar
[27]Wang, X., Kou, J. and Li, Y., A variant of Jarratt method with sixth-order convergence, Appl. Math. Comput., 190 (2008), pp. 14–19.Google Scholar
[28]Sharma, J. R. and Guha, R. K., A family of modified Ostrowski methods with accelerated sixth order convergence, Appl. Math. Comput., 190 (2007), pp. 111–115.Google Scholar
[29]Neta, B., A sixth-order family of methods for nonlinear equations, Int. J. Comput. Math., 7 (1979), pp. 157–161.CrossRefGoogle Scholar
[30]Chun, C. and Ham, Y., Some sixth-order variants of Ostrowski root-finding methods, Appl. Math. Comput., 193 (2003), pp. 389–394.Google Scholar