New third-order Newton-like method with lower iteration number and lower TNFE
- 18 July 2015
- journal article
- Published by Springer Nature in Soft Computing
- Vol. 21 (2) , 459-466
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Exploiting mean field analysis to model performances of big data architecturesFuture Generation Computer Systems, 2014
- Variants of a classic Traub’s resultComputers & Mathematics with Applications, 2010
- Iterative method for fuzzy equationsSoft Computing, 2007
- A third-order Newton-type method to solve systems of nonlinear equationsApplied Mathematics and Computation, 2007
- Iterative methods improving newton's method by the decomposition methodComputers & Mathematics with Applications, 2005
- Improving Newton–Raphson method for nonlinear equations by modified Adomian decomposition methodApplied Mathematics and Computation, 2003
- Geometric constructions of iterative functions to solve nonlinear equationsJournal of Computational and Applied Mathematics, 2003
- Some variant of Newton’s method with third-order convergenceApplied Mathematics and Computation, 2003
- Modified Newton's method with third-order convergence and multiple rootsJournal of Computational and Applied Mathematics, 2003
- A variant of Newton's method with accelerated third-order convergenceApplied Mathematics Letters, 2000