scholarly journals Derivative-Free King’s Scheme for Multiple Zeros of Nonlinear Functions

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-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum

We construct a biparametric family of fourth-order iterative methods to compute multiple roots of nonlinear equations. This method is verified to be optimally convergent. Various nonlinear equations confirm our proposed method with order of convergence of four and show that the computed asymptotic error constant agrees with the theoretical one.


2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
F. Soleymani

This paper contributes a very general class of two-point iterative methods without memory for solving nonlinear equations. The class of methods is developed using weight function approach. Per iteration, each method of the class includes two evaluations of the function and one of its first-order derivative. The analytical study of the main theorem is presented in detail to show the fourth order of convergence. Furthermore, it is discussed that many of the existing fourth-order methods without memory are members from this developed class. Finally, numerical examples are taken into account to manifest the accuracy of the derived methods.


Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1038 ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Clemente Cesarano ◽  
Praveen Agarwal ◽  
...  

A plethora of higher order iterative methods, involving derivatives in algorithms, are available in the literature for finding multiple roots. Contrary to this fact, the higher order methods without derivatives in the iteration are difficult to construct, and hence, such methods are almost non-existent. This motivated us to explore a derivative-free iterative scheme with optimal fourth order convergence. The applicability of the new scheme is shown by testing on different functions, which illustrates the excellent convergence. Moreover, the comparison of the performance shows that the new technique is a good competitor to existing optimal fourth order Newton-like techniques.


Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1809 ◽  
Author(s):  
Ramandeep Behl ◽  
Samaher Khalaf Alharbi ◽  
Fouad Othman Mallawi ◽  
Mehdi Salimi

Finding higher-order optimal derivative-free methods for multiple roots (m≥2) of nonlinear expressions is one of the most fascinating and difficult problems in the area of numerical analysis and Computational mathematics. In this study, we introduce a new fourth order optimal family of Ostrowski’s method without derivatives for multiple roots of nonlinear equations. Initially the convergence analysis is performed for particular values of multiple roots—afterwards it concludes in general form. Moreover, the applicability and comparison demonstrated on three real life problems (e.g., Continuous stirred tank reactor (CSTR), Plank’s radiation and Van der Waals equation of state) and two standard academic examples that contain the clustering of roots and higher-order multiplicity (m=100) problems, with existing methods. Finally, we observe from the computational results that our methods consume the lowest CPU timing as compared to the existing ones. This illustrates the theoretical outcomes to a great extent of this study.


Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 546
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Ángel Alberto Magreñán ◽  
Alejandro Moysi

In this manuscript, we introduce the higher-order optimal derivative-free family of Chebyshev–Halley’s iterative technique to solve the nonlinear equation having the multiple roots. The designed scheme makes use of the weight function and one parameter α to achieve the fourth-order of convergence. Initially, the convergence analysis is performed for particular values of multiple roots. Afterward, it concludes in general. Moreover, the effectiveness of the presented methods are certified on some applications of nonlinear equations and compared with the earlier derivative and derivative-free schemes. The obtained results depict better performance than the existing methods.


Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros

Abstract Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.


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.


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 246 ◽  
Author(s):  
Nizam Ghawadri ◽  
Norazak Senu ◽  
Firas Fawzi ◽  
Fudziah Ismail ◽  
Zarina Ibrahim

The primary contribution of this work is to develop direct processes of explicit Runge-Kutta type (RKT) as solutions for any fourth-order ordinary differential equation (ODEs) of the structure u ( 4 ) = f ( x , u , u ′ , u ′ ′ ) and denoted as RKTF method. We presented the associated B-series and quad-colored tree theory with the aim of deriving the prerequisites of the said order. Depending on the order conditions, the method with algebraic order four with a three-stage and order five with a four-stage denoted as RKTF4 and RKTF5 are discussed, respectively. Numerical outcomes are offered to interpret the accuracy and efficacy of the new techniques via comparisons with various currently available RK techniques after converting the problems into a system of first-order ODE systems. Application of the new methods in real-life problems in ship dynamics is discussed.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.


2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Alicia Cordero ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Juan R. Torregrosa

A family of derivative-free methods of seventh-order convergence for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.6266. Also, numerical examples are used to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other derivative-free methods, including some optimal fourth-order ones, in the sense of Kung-Traub’s conjecture.


Sign in / Sign up

Export Citation Format

Share Document