Optimal Newton-secant like methods without memory for solving nonlinear equations with its dynamics

From MaRDI portal
Publication:3174858

DOI10.1080/00207160.2016.1227800zbMATH Open1391.65135arXiv1410.5097OpenAlexW2591588317MaRDI QIDQ3174858FDOQ3174858

T. Lotfi, S. Siegmund, Somayeh Sharifi, Mehdi Salimi

Publication date: 18 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Abstract: We construct two optimal Newton-Secant like iterative methods for solving non-linear equations. The proposed classes have convergence order four and eight and cost only three and four function evaluations per iteration, respectively. These methods support the Kung and Traub conjecture and possess a high computational efficiency. The new methods are illustrated by numerical experiments and a comparison with some existing optimal methods. We conclude with an investigation of the basins of attraction of the solutions in the complex plane.


Full work available at URL: https://arxiv.org/abs/1410.5097




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Optimal Newton-secant like methods without memory for solving nonlinear equations with its dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174858)