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 Development of Optimal Eighth Order Derivative-Free Methods for Multiple Roots of Nonlinear Equations

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 766 ◽  
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Ioannis K. Argyros
Keyword(s):  
Basins Of Attraction ◽  
Higher Order ◽  
Order Derivative ◽  
Multiple Roots ◽  
Nonlinear Functions ◽  
Eighth Order ◽  
Multiple Zeros ◽  
Derivative Free ◽  
Graphical Tool ◽  
Derivative Free Methods

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.

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.

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 Generating Optimal Eighth Order Methods for Computing Multiple Roots

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 1947
Author(s):  
Deepak Kumar ◽  
Sunil Kumar ◽  
Janak Raj Sharma ◽  
Matteo d’Amore
Keyword(s):  
Real Life ◽  
Nonlinear Function ◽  
Basins Of Attraction ◽  
Computational Time ◽  
Multiple Roots ◽  
Time Stability ◽  
Academic Problems ◽  
Eighth Order ◽  
Multiple Zeros ◽  
New Family

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.

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 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.

scholarly journals Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 919
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Lorentz Jäntschi
Keyword(s):  
Convergence Analysis ◽  
Complex Geometry ◽  
Basins Of Attraction ◽  
Convergence Domain ◽  
Derivative Free ◽  
Visual Approach ◽  
Higher Derivatives ◽  
Fifth Order ◽  
Local Convergence Analysis ◽  
Theoretical Results

To locate a locally-unique solution of a nonlinear equation, the local convergence analysis of a derivative-free fifth order method is studied in Banach space. This approach provides radius of convergence and error bounds under the hypotheses based on the first Fréchet-derivative only. Such estimates are not introduced in the earlier procedures employing Taylor’s expansion of higher derivatives that may not exist or may be expensive to compute. The convergence domain of the method is also shown by a visual approach, namely basins of attraction. Theoretical results are endorsed via numerical experiments that show the cases where earlier results cannot be applicable.

scholarly journals One Parameter Optimal Derivative-Free Family to Find the Multiple Roots of Algebraic Nonlinear Equations

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2223
Author(s):  
Munish Kansal ◽  
Ali Saleh Alshomrani ◽  
Sonia Bhalla ◽  
Ramandeep Behl ◽  
Mehdi Salimi
Keyword(s):  
Basin Of Attraction ◽  
Nonlinear Function ◽  
Second Order ◽  
Function Evaluation ◽  
Multiple Roots ◽  
Derivative Free ◽  
The One ◽  
Special Case ◽  
The Basin Of Attraction ◽  
Taylor’S Series

In this study, we construct the one parameter optimal derivative-free iterative family to find the multiple roots of an algebraic nonlinear function. Many researchers developed the higher order iterative techniques by the use of the new function evaluation or the first-order or second-order derivative of functions to evaluate the multiple roots of a nonlinear equation. However, the evaluation of the derivative at each iteration is a cumbersome task. With this motivation, we design the second-order family without the utilization of the derivative of a function and without the evaluation of the new function. The proposed family is optimal as it satisfies the convergence order of Kung and Traub’s conjecture. Here, we use one parameter a for the construction of the scheme, and for a=1, the modified Traub method is its a special case. The order of convergence is analyzed by Taylor’s series expansion. Further, the efficiency of the suggested family is explored with some numerical tests. The obtained results are found to be more efficient than earlier schemes. Moreover, the basin of attraction of the proposed and earlier schemes is also analyzed.

scholarly journals Some Iterative Methods Free from Derivatives and Their Basins of Attraction for Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Farahnaz Soleimani ◽  
Fazlollah Soleymani ◽  
Stanford Shateyi
Keyword(s):  
Nonlinear Equations ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Free Form ◽  
Optimal Method ◽  
Nonlinear Solvers ◽  
Derivative Free ◽  
The Family ◽  
Derivative Free Method ◽  
Attraction Basins

First, we make the Jain's derivative-free method optimal and subsequently increase its efficiency index from 1.442 to 1.587. Then, a novel three-step computational family of iterative schemes for solving single variable nonlinear equations is given. The schemes are free from derivative calculation per full iteration. The optimal family is constructed by applying the weight function approach alongside an approximation for the first derivative of the function in the last step in which the first two steps are the optimized derivative-free form of Jain's method. The convergence rate of the proposed optimal method and the optimal family is studied. The efficiency index for each method of the family is 1.682. The superiority of the proposed contributions is illustrated by solving numerical examples and comparing them with some of the existing methods in the literature. In the end, we provide the basins of attraction for some methods to observe the beauty of iterative nonlinear solvers in providing fractals and also choose the best method in case of larger attraction basins.

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.

Sign in / Sign up

Export Citation Format

Share Document