scholarly journals A Family of Derivative Free Optimal Fourth Order Methods for Computing Multiple Roots

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 1969
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Lorentz Jäntschi
Keyword(s):  
Fourth Order ◽  
Nonlinear Problems ◽  
Multiple Root ◽  
Optimal Order ◽  
Multiple Roots ◽  
New Methods ◽  
Derivative Free ◽  
The Family ◽  
Derivative Free Method ◽  
Special Case

Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. But contrarily, derivative free optimal order techniques for multiple root are almost nonexistent. By this as an inspirational factor, here we present a family of optimal fourth order derivative-free techniques for computing multiple roots of nonlinear equations. At the beginning the convergence analysis is executed for particular values of multiplicity afterwards it concludes in general form. Behl et. al derivative-free method is seen as special case of the family. Moreover, the applicability and comparison is demonstrated on different nonlinear problems that certifies the efficient convergent nature of the new methods. Finally, we conclude that our new methods consume the lowest CPU time as compared to the existing ones. This illuminates the theoretical outcomes to a great extent of this study.

scholarly journals On a Class of Optimal Fourth Order Multiple Root Solvers without Using Derivatives

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1452 ◽  
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Lorentz Jäntschi
Keyword(s):  
Fourth Order ◽  
Multiple Root ◽  
Optimal Order ◽  
Test Problems ◽  
Multiple Roots ◽  
Motivational Factor ◽  
New Methods ◽  
Derivative Free ◽  
The Family ◽  
Theoretical Results

Many optimal order multiple root techniques involving derivatives have been proposed in literature. On the contrary, optimal order multiple root techniques without derivatives are almost nonexistent. With this as a motivational factor, here we develop a family of optimal fourth-order derivative-free iterative schemes for computing multiple roots. The procedure is based on two steps of which the first is Traub–Steffensen iteration and second is Traub–Steffensen-like iteration. Theoretical results proved for particular cases of the family are symmetric to each other. This feature leads us to prove the general result that shows the fourth-order convergence. Efficacy is demonstrated on different test problems that verifies the efficient convergent nature of the new methods. Moreover, the comparison of performance has proven the presented derivative-free techniques as good competitors to the existing optimal fourth-order methods that use derivatives.

An efficient class of fourth-order derivative-free method for multiple-roots

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Multiple Root ◽  
Second Step ◽  
Optimal Order ◽  
Multiple Roots ◽  
Nonlinear Functions ◽  
New Methods ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Derivative Free Method ◽  
Good Number

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.

scholarly journals On Derivative Free Multiple-Root Finders with Optimal Fourth Order Convergence

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1091 ◽  
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Lorentz Jäntschi
Keyword(s):  
Fourth Order ◽  
Multiple Root ◽  
Second Step ◽  
Optimal Order ◽  
Multiple Roots ◽  
Order Convergence ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Derivative Information

A number of optimal order multiple root techniques that require derivative evaluations in the formulas have been proposed in literature. However, derivative-free optimal techniques for multiple roots are seldom obtained. By considering this factor as motivational, here we present a class of optimal fourth order methods for computing multiple roots without using derivatives in the iteration. The iterative formula consists of two steps in which the first step is a well-known Traub–Steffensen scheme whereas second step is a Traub–Steffensen-like scheme. The Methodology is based on two steps of which the first is Traub–Steffensen iteration and the second is Traub–Steffensen-like iteration. Effectiveness is validated on different problems that shows the robust convergent behavior of the proposed methods. It has been proven that the new derivative-free methods are good competitors to their existing counterparts that need derivative information.

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
Keyword(s):  
Iterative Methods ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Real Life ◽  
Multiple Roots ◽  
Computational Results ◽  
Nonlinear Functions ◽  
First Order ◽  
Life Problems ◽  
Derivative Free

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.

scholarly journals A Two-Parameter Family of Fourth-Order Iterative Methods with Optimal Convergence for Multiple Zeros

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Numerical Experiments ◽  
Harmonic Mean ◽  
Optimal Order ◽  
Multiple Roots ◽  
Multiple Zeros ◽  
Asymptotic Error ◽  
Two Parameter

We develop a family of fourth-order iterative methods using the weighted harmonic mean of two derivative functions to compute approximate multiple roots of nonlinear equations. They are proved to be optimally convergent in the sense of Kung-Traub’s optimal order. Numerical experiments for various test equations confirm well the validity of convergence and asymptotic error constants for the developed methods.

scholarly journals A New Biparametric Family of Two-Point Optimal Fourth-Order Multiple-Root Finders

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Multiple Root ◽  
Multiple Roots ◽  
Asymptotic Error ◽  
Error Constant ◽  
Asymptotic Error Constant

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.

Derivative-Free Optimal Iterative Methods

2010 ◽  
Vol 10 (4) ◽  
pp. 368-375 ◽  
Author(s):  
S.K. Khattri ◽  
R.P. Agarwal
Keyword(s):  
Convergence Analysis ◽  
Iterative Methods ◽  
Newton Method ◽  
Fourth Order ◽  
Free Parameter ◽  
Convergence Order ◽  
Derivative Free ◽  
The Family ◽  
Optimal Value

AbstractIn this study, we develop an optimal family of derivative-free iterative methods. Convergence analysis shows that the methods are fourth order convergent, which is also verified numerically. The methods require three functional evaluations during each iteration. Though the methods are independent of derivatives, computa- tional results demonstrate that the family of methods are efficient and demonstrate equal or better performance as compared with many well-known methods and the clas- sical Newton method. Through optimization we derive an optimal value for the free parameter and implement it adaptively, which enhances the convergence order without increasing functional evaluations.

scholarly journals An Optimal Fourth Order Derivative-Free Numerical Algorithm for Multiple Roots

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1038 ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Clemente Cesarano ◽  
Praveen Agarwal ◽  
...  
Keyword(s):  
Iterative Methods ◽  
Numerical Algorithm ◽  
Fourth Order ◽  
Iterative Scheme ◽  
Higher Order ◽  
New Technique ◽  
Multiple Roots ◽  
Order Convergence ◽  
Higher Order Methods ◽  
Derivative Free

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.

scholarly journals Optimal Methods for Finding Simple and Multiple Roots of Nonlinear Equations and their Basins of Attraction

2020 ◽  
Vol 37 (1-2) ◽  
pp. 14-29
Author(s):  
Prem Bahadur Chand
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Multiple Root ◽  
Basins Of Attraction ◽  
Weight Functions ◽  
Multiple Roots ◽  
Order Method ◽  
Numerical Examples ◽  
Fourth Order Method ◽  
Simple And Multiple Roots

In this paper, using the variant of Frontini-Sormani method, some higher order methods for finding the roots (simple and multiple) of nonlinear equations are proposed. In particular, we have constructed an optimal fourth order method and a family of sixth order method for finding a simple root. Further, an optimal fourth order method for finding a multiple root of a nonlinear equation is also proposed. We have used different weight functions to a cubically convergent For ntini-Sormani method for the construction of these methods. The proposed methods are tested on numerical examples and compare the results with some existing methods. Further, we have presented the basins of attraction of these methods to understand their dynamics visually.

Design and Analysis of a New Class of Derivative-Free Optimal Order Methods for Nonlinear Equations

2018 ◽  
Vol 15 (03) ◽  
pp. 1850010 ◽  
Author(s):  
Janak Raj Sharma ◽  
Ioannis K. Argyros ◽  
Deepak Kumar
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Optimal Order ◽  
Optimal Order Of Convergence ◽  
Numerical Examples ◽  
New Class ◽  
New Methods ◽  
Derivative Free ◽  
Local Convergence Analysis ◽  
Theoretical Results

We develop a general class of derivative free iterative methods with optimal order of convergence in the sense of Kung–Traub hypothesis for solving nonlinear equations. The methods possess very simple design, which makes them easy to remember and hence easy to implement. The Methodology is based on quadratically convergent Traub–Steffensen scheme and further developed by using Padé approximation. Local convergence analysis is provided to show that the iterations are locally well defined and convergent. Numerical examples are provided to confirm the theoretical results and to show the good performance of new methods.

Sign in / Sign up

Export Citation Format

Share Document