Optimal Algorithms for Nonlinear Equations with Applications and Their Dynamics

Amir Naseem, M. A. Rehman, Nasr Al Din Ide and Shanmugam Lakshmanan

Complexity, 2022, vol. 2022, 1-19

Abstract: In the present work, we introduce two novel root-finding algorithms for nonlinear scalar equations. Among these algorithms, the second one is optimal according to Kung-Traub’s conjecture. It is established that the newly proposed algorithms bear the fourth- and sixth-order of convergence. To show the effectiveness of the suggested methods, we provide several real-life problems associated with engineering sciences. These problems have been solved through the suggested methods, and their numerical results proved the superiority of these methods over the other ones. Finally, we study the dynamics of the proposed methods using polynomiographs created with the help of a computer program using six cubic-degree polynomials and then give a detailed graphical comparison with similar existing methods which shows the supremacy of the presented iteration schemes with respect to convergence speed and other dynamical aspects.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2022/9705690.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2022/9705690.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9705690

DOI: 10.1155/2022/9705690

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().