scholarly journals Memorizing Schröder’s Method as an Efficient Strategy for Estimating Roots of Unknown Multiplicity

Mathematics ◽  
2021 ◽  
Vol 9 (20) ◽  
pp. 2570
Author(s):  
Alicia Cordero ◽  
Beny Neta ◽  
Juan R. Torregrosa
Keyword(s):  
Order Of Convergence ◽  
Iterative Scheme ◽  
Basins Of Attraction ◽  
Higher Order ◽  
Multiple Roots ◽  
Higher Order Methods ◽  
Efficient Strategy ◽  
Schröder’S Method ◽  
With Memory

In this paper, we propose, to the best of our knowledge, the first iterative scheme with memory for finding roots whose multiplicity is unknown existing in the literature. It improves the efficiency of a similar procedure without memory due to Schröder and can be considered as a seed to generate higher order methods with similar characteristics. Once its order of convergence is studied, its stability is analyzed showing its good properties, and it is compared numerically in terms of their basins of attraction with similar schemes without memory for finding multiple roots.

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 Impact on Stability by the Use of Memory in Traub-Type Schemes

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 274
Author(s):  
Francisco I. Chicharro ◽  
Alicia Cordero ◽  
Neus Garrido ◽  
Juan R. Torregrosa
Keyword(s):  
Order Of Convergence ◽  
Nonlinear Problems ◽  
Higher Order ◽  
Lower Number ◽  
Dynamical Analysis ◽  
The Real ◽  
Original Scheme ◽  
Interpolation Polynomials ◽  
With Memory ◽  
Number Of Iterations

In this work, two Traub-type methods with memory are introduced using accelerating parameters. To obtain schemes with memory, after the inclusion of these parameters in Traub’s method, they have been designed using linear approximations or the Newton’s interpolation polynomials. In both cases, the parameters use information from the current and the previous iterations, so they define a method with memory. Moreover, they achieve higher order of convergence than Traub’s scheme without any additional functional evaluations. The real dynamical analysis verifies that the proposed methods with memory not only converge faster, but they are also more stable than the original scheme. The methods selected by means of this analysis can be applied for solving nonlinear problems with a wider set of initial estimations than their original partners. This fact also involves a lower number of iterations in the process.

scholarly journals Modification of Newton-Househölder Method for Determining Multiple Roots of Unknown Multiplicity of Nonlinear Equations

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1020
Author(s):  
Syahmi Afandi Sariman ◽  
Ishak Hashim ◽  
Faieza Samat ◽  
Mohammed Alshbool
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Accuracy ◽  
Basins Of Attraction ◽  
Convergence Order ◽  
Multiple Roots ◽  
Eighth Order ◽  
Numerical Examples

In this study, we propose an extension of the modified Newton-Househölder methods to find multiple roots with unknown multiplicity of nonlinear equations. With four functional evaluations per iteration, the proposed method achieves an optimal eighth order of convergence. The higher the convergence order, the quicker we get to the root with a high accuracy. The numerical examples have shown that this scheme can compete with the existing methods. This scheme is also stable across all of the functions tested based on the graphical basins of attraction.

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 On a Novel Fourth-Order Algorithm for Solving Systems of Nonlinear Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Diyashvir K. R. Babajee ◽  
Alicia Cordero ◽  
Fazlollah Soleymani ◽  
Juan R. Torregrosa
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Iterative Scheme ◽  
Higher Order ◽  
Numerical Results ◽  
Systems Of Nonlinear Equations ◽  
Frechet Derivatives ◽  
Fréchet Derivatives ◽  
Order Algorithm

This paper focuses on solving systems of nonlinear equations numerically. We propose an efficient iterative scheme including two steps and fourth order of convergence. The proposed method does not require the evaluation of second or higher order Frechet derivatives per iteration to proceed and reach fourth order of convergence. Finally, numerical results illustrate the efficiency of the method.

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 Higher Order Methods for Nonlinear Equations and Their Basins of Attraction

Mathematics ◽  
2016 ◽  
Vol 4 (2) ◽  
pp. 22 ◽  
Author(s):  
Kalyanasundaram Madhu ◽  
Jayakumar Jayaraman
Keyword(s):  
Nonlinear Equations ◽  
Basins Of Attraction ◽  
Higher Order ◽  
Higher Order Methods
Sign in / Sign up

Export Citation Format

Share Document