A modified two-step optimal iterative method for solving nonlinear models in one and higher dimensions

19Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Iterative methods are essential tools in computational science, particularly for addressing nonlinear models. This study introduces a novel two-step optimal iterative root-finding method designed to solve nonlinear equations and systems of nonlinear equations. The proposed method exhibits the optimal convergence, adhering to the Kung-Traub conjecture, and necessitates only three function evaluations per iteration to achieve a fourth-order optimal iterative process. The development of this method involves the amalgamation of two well-established third-order iterative techniques. Comprehensive local and semilocal convergence analyses are conducted, accompanied by a stability investigation of the proposed approach. This method marks a substantial enhancement over existing optimal iterative methods, as evidenced by its performance in various nonlinear models. Extensive testing demonstrates that the proposed method consistently yields accurate and efficient results, surpassing existing algorithms in both speed and accuracy. Numerical simulations, including real-world models such as boundary value problems and integral equations, indicate that the proposed optimal method outperforms several contemporary optimal iterative techniques.

Cite

CITATION STYLE

APA

Chang, C. W., Qureshi, S., Argyros, I. K., Chicharro, F. I., & Soomro, A. (2025). A modified two-step optimal iterative method for solving nonlinear models in one and higher dimensions. Mathematics and Computers in Simulation, 229, 448–467. https://doi.org/10.1016/j.matcom.2024.09.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free