Abstract
This paper presents a new iterative Newton-like method for solving nonlinear equations which is firstly compared with very recent results and we show that it reaches the solution in a lower number of iterations and with a lower total number of function evaluations, considering a variable length of the floating point arithmetic with multi-precision. Then, considering a fix length of the floating point arithmetic with multi-precision, we have compared it with other methods and we have obtained similar results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abbasbandy S (2003) Improving Newton–Raphson method for nonlinear equations by modified Adomian decomposition method. Appl Math Comput 145:887–893
Allahviranloo T, Otadi M, Mosleh M (2008) Iterative method for fuzzy equations. Soft Comput 12:935–939
Amat S, Busquier S, Gutierrez JM (2003) Geometric constructions of iterative functions to solve nonlinear equations. J Comput Appl Math 157:197–205
Argyrosa IK, Hilout S (2013) On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. J Comput Appl Math 245:1–9
Castiglione A, Gribaudo M, Iacono M, Palmieri F (2014) Exploiting mean field analysis to model performances of big data architectures. Future Gener Comput Syst 37:203–211
Chun C (2005) Iterative methods improving Newton’s method by the decomposition method. Comput Math Appl 50:1559–1568
Chun C, Kim Y-I (2010) Several new third-order iterative methods for solving nonlinear equations. Acta Appl Math 109:1053–1063
Darvishi MT, Barati A (2007) A third-order Newton-type method to solve systems of nonlinear equations. Appl Math Comput 187:630–635
Ezquerro JA, Grau-Sanchez M, Hernandez MA, Romero N (2010) Variants of a classic Traub’s result. Comput Math Appl 60:2899–2908
Ficco M, Avolio G, Palmieri F, Castiglione A (2015) An hla-based framework for simulation of large-scale critical systems. Concurr Comput: Pract Exp. doi:10.1002/cpe.3472
Frontini M, Sormani E (2003a) Modified newton’s method with third-order convergence. J Comput Appl Math 156:345–354
Frontini M, Sormani E (2003b) Some variants of newton’s method with third-order convergence. J Comput Appl Math 140:419–426
Grau-Sanchez M, Diaz-Barrero JL (2014) Note on improvements of order and efficiency in some iterative methods for solving nonlinear equations. Appl Math Lett 33:18–22
Homeier HHH (2004) On Newton-type methods with cubic convergence. J Comput Appl Math 176:425–432
Palmieri F, Fiore U, Ricciardi S, Castiglione A (2015) Grasp-based resource re-optimization for effective big data access in federated clouds. Future Gener Comput Syst. doi:10.1016/j.future.2015.01.017
Pap E (2002) Pseudo-analysis and nonlinear equations. Soft Comput 6:21–32
Potra FA, Ptak V (1984) Nondiscrete induction and iterative processes, vol 108. Pitman, Boston
Rigatos G, Siano P, Zervos N (2013) An approach to fault diagnosis of nonlinear systems using neural networks with invariance to fourier transform. J Ambient Intell Hum Comput 4:621–639
Simoes A, Costa F (2014) Prediction in evolutionary algorithms for dynamic environments. Soft Comput 18:1471–1497
Weerakoon S, Fernando TGI (2000) A variant of newton’s method with accelerated third-order convergence. Appl Math Lett 13:87–93
Acknowledgments
The work has been funded by the Sectoral Operational Programme Human Resources Development 2007-2013 of the Ministry of European Funds through the Financial Agreement POSDRU/159/1.5/S/134398.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Di Nola.
Rights and permissions
About this article
Cite this article
Popescu, P.G., Poenaru, R. & Pop, F. New third-order Newton-like method with lower iteration number and lower TNFE. Soft Comput 21, 459–466 (2017). https://doi.org/10.1007/s00500-015-1796-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1796-0