scholarly journals An Efficient Class of Traub-Steffensen-Like Seventh Order Multiple-Root Solvers with Applications

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 518 ◽  
Author(s):  
Janak Raj Sharma ◽  
Deepak Kumar ◽  
Ioannis K. Argyros
Keyword(s):  
Complex Geometry ◽  
Multiple Root ◽  
Basins Of Attraction ◽  
Higher Order ◽  
Simple Approach ◽  
New Family ◽  
Derivative Free ◽  
Seventh Order ◽  
Higher Order Derivative ◽  
The Stability

Many higher order multiple-root solvers that require derivative evaluations are available in literature. Contrary to this, higher order multiple-root solvers without derivatives are difficult to obtain, and therefore, such techniques are yet to be achieved. Motivated by this fact, we focus on developing a new family of higher order derivative-free solvers for computing multiple zeros by using a simple approach. The stability of the techniques is checked through complex geometry shown by drawing basins of attraction. Applicability is demonstrated on practical problems, which illustrates the efficient convergence behavior. Moreover, the comparison of numerical results shows that the proposed derivative-free techniques are good competitors of the existing techniques that require derivative evaluations in the iteration.

scholarly journals Optimal One-Point Iterative Function Free from Derivatives for Multiple Roots

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 709 ◽  
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Complex Geometry ◽  
Basins Of Attraction ◽  
Second Order ◽  
Multiple Roots ◽  
Single Variable ◽  
Optimal Method ◽  
Multiple Zeros ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
The Stability

We suggest a derivative-free optimal method of second order which is a new version of a modification of Newton’s method for achieving the multiple zeros of nonlinear single variable functions. Iterative methods without derivatives for multiple zeros are not easy to obtain, and hence such methods are rare in literature. Inspired by this fact, we worked on a family of optimal second order derivative-free methods for multiple zeros that require only two function evaluations per iteration. The stability of the methods was validated through complex geometry by drawing basins of attraction. Moreover, applicability of the methods is demonstrated herein on different functions. The study of numerical results shows that the new derivative-free methods are good alternatives to the existing optimal second-order techniques that require derivative calculations.

scholarly journals Convergence Ball and Complex Geometry of an Iteration Function of Higher Order

Mathematics ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 28 ◽  
Author(s):  
Deepak Kumar ◽  
Ioannis Argyros ◽  
Janak Sharma
Keyword(s):  
Complex Geometry ◽  
Basins Of Attraction ◽  
Higher Order ◽  
Order Method ◽  
Eighth Order ◽  
Science And Engineering ◽  
Convergence Ball ◽  
Convergence Results ◽  
Iteration Function ◽  
Derivatives Of

Higher-order derivatives are used to determine the convergence order of iterative methods. However, such derivatives are not present in the formulas. Therefore, the assumptions on the higher-order derivatives of the function restrict the applicability of methods. Our convergence analysis of an eighth-order method uses only the derivative of order one. The convergence results so obtained are applied to some real problems, which arise in science and engineering. Finally, stability of the method is checked through complex geometry shown by drawing basins of attraction of the solutions.

scholarly journals Some Real-Life Applications of a Newly Constructed Derivative Free Iterative Scheme

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 239 ◽  
Author(s):  
Ramandeep Behl ◽  
M. Salimi ◽  
M. Ferrara ◽  
S. Sharifi ◽  
Samaher Alharbi
Keyword(s):  
Iterative Methods ◽  
Chemical Engineering ◽  
Flame Temperature ◽  
Real Life ◽  
Chemical Reactor ◽  
Basins Of Attraction ◽  
Eighth Order ◽  
Present Scheme ◽  
New Family ◽  
Derivative Free

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.

scholarly journals Basins of Attraction for Various Steffensen-Type Methods

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Alicia Cordero ◽  
Fazlollah Soleymani ◽  
Juan R. Torregrosa ◽  
Stanford Shateyi
Keyword(s):  
Computer Algebra System ◽  
Dynamical Behavior ◽  
Basin Of Attraction ◽  
Basins Of Attraction ◽  
Numerical Tests ◽  
Derivative Free ◽  
Iteration Functions ◽  
The Stability ◽  
Programming Package ◽  
The Basin Of Attraction

The dynamical behavior of different Steffensen-type methods is analyzed. We check the chaotic behaviors alongside the convergence radii (understood as the wideness of the basin of attraction) needed by Steffensen-type methods, that is, derivative-free iteration functions, to converge to a root and compare the results using different numerical tests. We will conclude that the convergence radii (and the stability) of Steffensen-type methods are improved by increasing the convergence order. The computer programming package MATHEMATICAprovides a powerful but easy environment for all aspects of numerics. This paper puts on show one of the application of this computer algebra system in finding fixed points of iteration functions.

scholarly journals An Efficient Class of Weighted-Newton Multiple Root Solvers with Seventh Order Convergence

Symmetry ◽  
2019 ◽  
Vol 11 (8) ◽  
pp. 1054
Author(s):  
Janak Raj Sharma ◽  
Deepak Kumar ◽  
Carlo Cattani
Keyword(s):  
Nonlinear Function ◽  
Multiple Root ◽  
Basins Of Attraction ◽  
Stability And Convergence ◽  
Good Convergence ◽  
Cpu Time ◽  
Numerical Experimentation ◽  
Seventh Order ◽  
Graphical Technique ◽  
Analysis Stability

In this work, we construct a family of seventh order iterative methods for finding multiple roots of a nonlinear function. The scheme consists of three steps, of which the first is Newton’s step and last two are the weighted-Newton steps. Hence, the name of the scheme is ‘weighted-Newton methods’. Theoretical results are studied exhaustively along with the main theorem describing convergence analysis. Stability and convergence domain of the proposed class are also demonstrated by means of using a graphical technique, namely, basins of attraction. Boundaries of these basins are fractal like shapes through which basins are symmetric. Efficacy is demonstrated through numerical experimentation on variety of different functions that illustrates good convergence behavior. Moreover, the theoretical result concerning computational efficiency is verified by computing the elapsed CPU time. The overall comparison of numerical results including accuracy and CPU-time shows that the new methods are strong competitors for the existing methods.

scholarly journals An Efficient Class of Traub–Steffensen-Type Methods for Computing Multiple Zeros

Axioms ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 65 ◽  
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Clemente Cesarano
Keyword(s):  
Iterative Methods ◽  
Basins Of Attraction ◽  
Higher Order ◽  
Order Derivative ◽  
Third Order ◽  
Higher Order Methods ◽  
Multiple Zeros ◽  
Derivative Free ◽  
Graphical Tool ◽  
Numerical Experimentation

Numerous higher-order methods with derivative evaluations are accessible in the literature for computing multiple zeros. However, higher-order methods without derivatives are very rare for multiple zeros. Encouraged by this fact, we present a family of third-order derivative-free iterative methods for multiple zeros that require only evaluations of three functions per iteration. Convergence of the proposed class is demonstrated by means of using a graphical tool, namely basins of attraction. Applicability of the methods is demonstrated through numerical experimentation on different functions that illustrates the efficient behavior. Comparison of numerical results shows that the presented iterative methods are good competitors to the existing techniques.

Sign in / Sign up

Export Citation Format

Share Document