Optimal eighth-order iterative methods for approximating multiple zeros of nonlinear functions

Author(s):  
Fiza Zafar ◽  
Alicia Cordero ◽  
Moin-Ud-Din Junjua ◽  
Juan R. Torregrosa
Author(s):  
Munish Kansal ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
Sonia Bhalla

AbstractThere have appeared in the literature a lot of optimal eighth-order iterative methods for approximating simple zeros of nonlinear functions. Although, the similar ideas can be extended for the case of multiple zeros but the main drawback is that the order of convergence and computational efficiency reduce dramatically. Therefore, in order to retain the accuracy and convergence order, several optimal and non-optimal modifications have been proposed in the literature. But, as far as we know, there are limited number of optimal eighth-order methods that can handle the case of multiple zeros. With this aim, a wide general class of optimal eighth-order methods for multiple zeros with known multiplicity is brought forward, which is based on weight function technique involving function-to-function ratio. An extensive convergence analysis is demonstrated to establish the eighth-order of the developed methods. The numerical experiments considered the superiority of the new methods for solving concrete variety of real life problems coming from different disciplines such as trajectory of an electron in the air gap between two parallel plates, the fractional conversion in a chemical reactor, continuous stirred tank reactor problem, Planck’s radiation law problem, which calculates the energy density within an isothermal blackbody and the problem arising from global carbon dioxide model in ocean chemistry, in comparison with methods of similar characteristics appeared in the literature.


Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 766 ◽  
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Ioannis K. Argyros

A number of higher order iterative methods with derivative evaluations are developed in literature for computing multiple zeros. However, higher order methods without derivative for multiple zeros are difficult to obtain and hence such methods are rare in literature. Motivated by this fact, we present a family of eighth order derivative-free methods for computing multiple zeros. Per iteration the methods require only four function evaluations, therefore, these are optimal in the sense of Kung-Traub conjecture. Stability of the proposed class is demonstrated by means of using a graphical tool, namely, basins of attraction. Boundaries of the basins are fractal like shapes through which basins are symmetric. Applicability of the methods is demonstrated on different nonlinear functions which illustrates the efficient convergence behavior. Comparison of the numerical results shows that the new derivative-free methods are good competitors to the existing optimal eighth-order techniques which require derivative evaluations.


Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1242
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Eulalia Martínez ◽  
Majed Aali Alsulami

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots (m≥2). In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Alicia Cordero ◽  
Moin-ud-Din Junjua ◽  
Juan R. Torregrosa ◽  
Nusrat Yasmin ◽  
Fiza Zafar

We construct a family of derivative-free optimal iterative methods without memory to approximate a simple zero of a nonlinear function. Error analysis demonstrates that the without-memory class has eighth-order convergence and is extendable to with-memory class. The extension of new family to the with-memory one is also presented which attains the convergence order 15.5156 and a very high efficiency index 15.51561/4≈1.9847. Some particular schemes of the with-memory family are also described. Numerical examples and some dynamical aspects of the new schemes are given to support theoretical results.


Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 1947
Author(s):  
Deepak Kumar ◽  
Sunil Kumar ◽  
Janak Raj Sharma ◽  
Matteo d’Amore

There are a few optimal eighth order methods in literature for computing multiple zeros of a nonlinear function. Therefore, in this work our main focus is on developing a new family of optimal eighth order iterative methods for multiple zeros. The applicability of proposed methods is demonstrated on some real life and academic problems that illustrate the efficient convergence behavior. It is shown that the newly developed schemes are able to compete with other methods in terms of numerical error, convergence and computational time. Stability is also demonstrated by means of a pictorial tool, namely, basins of attraction that have the fractal-like shapes along the borders through which basins are symmetric.


Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 260 ◽  
Author(s):  
Janak Sharma ◽  
Ioannis Argyros ◽  
Sunil Kumar

The convergence order of numerous iterative methods is obtained using derivatives of a higher order, although these derivatives are not involved in the methods. Therefore, these methods cannot be used to solve equations with functions that do not have such high-order derivatives, since their convergence is not guaranteed. The convergence in this paper is shown, relying only on the first derivative. That is how we expand the applicability of some popular methods.


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 239 ◽  
Author(s):  
Ramandeep Behl ◽  
M. Salimi ◽  
M. Ferrara ◽  
S. Sharifi ◽  
Samaher Alharbi

In this study, we present a new higher-order scheme without memory for simple zeros which has two major advantages. The first one is that each member of our scheme is derivative free and the second one is that the present scheme is capable of producing many new optimal family of eighth-order methods from every 4-order optimal derivative free scheme (available in the literature) whose first substep employs a Steffensen or a Steffensen-like method. In addition, the theoretical and computational properties of the present scheme are fully investigated along with the main theorem, which demonstrates the convergence order and asymptotic error constant. Moreover, the effectiveness of our scheme is tested on several real-life problems like Van der Waal’s, fractional transformation in a chemical reactor, chemical engineering, adiabatic flame temperature, etc. In comparison with the existing robust techniques, the iterative methods in the new family perform better in the considered test examples. The study of dynamics on the proposed iterative methods also confirms this fact via basins of attraction applied to a number of test functions.


Sign in / Sign up

Export Citation Format

Share Document