scholarly journals On Constructing Two-Point Optimal Fourth-Order Multiple-Root Finders with a Generic Error Corrector and Illustrating Their Dynamics

2015 ◽  
Vol 2015 ◽  
pp. 1-12
Author(s):  
Young Ik Kim ◽  
Young Hee Geum
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Numerical Experiments ◽  
Multiple Root ◽  
Optimal Order ◽  
Convergence Behavior ◽  
Principal Branch ◽  
Basins Of Attractions ◽  
Made In

With an error corrector via principal branch of themth root of a function-to-function ratio, we propose optimal quartic-order multiple-root finders for nonlinear equations. The relevant optimal order satisfies Kung-Traub conjecture made in 1974. Numerical experiments performed for various test equations demonstrate convergence behavior agreeing with theory and the basins of attractions for several examples are presented.

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 On generalized Halley-like methods for solving nonlinear equations

2019 ◽  
Vol 13 (2) ◽  
pp. 399-422
Author(s):  
Miodrag Petkovic ◽  
Ljiljana Petkovic ◽  
Beny Neta
Keyword(s):  
Computer Graphics ◽  
Nonlinear Equation ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Numerical Experiments ◽  
Multiple Root ◽  
Basins Of Attraction ◽  
Third Order ◽  
Numerical Examples ◽  
Theoretical Results

Generalized Halley-like one-parameter families of order three and four for finding multiple root of a nonlinear equation are constructed and studied. This presentation is, actually, a mixture of theoretical results, algorithmic aspects, numerical experiments, and computer graphics. Starting from the proposed class of third order methods and using an accelerating procedure, we construct a new fourth order family of Halley's type. To analyze convergence behavior of two presented families, we have used two methodologies: (i) testing by numerical examples and (ii) dynamic study using basins of attraction.

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.

scholarly journals Four-Point Optimal Sixteenth-Order Iterative Method for Solving Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Malik Zaka Ullah ◽  
A. S. Al-Fhaid ◽  
Fayyaz Ahmad
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Iterative Scheme ◽  
Optimal Order ◽  
Optimal Order Of Convergence

We present an iterative method for solving nonlinear equations. The proposed iterative method has optimal order of convergence sixteen in the sense of Kung-Traub conjecture (Kung and Traub, 1974); it means that the iterative scheme uses five functional evaluations to achieve 16(=25-1) order of convergence. The proposed iterative method utilizes one derivative and four function evaluations. Numerical experiments are made to demonstrate the convergence and validation of the iterative method.

scholarly journals Novel Computational Iterative Methods with Optimal Order for Nonlinear Equations

2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
F. Soleymani
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
General Class ◽  
Analytical Study ◽  
Order Of Convergence ◽  
Optimal Order ◽  
Numerical Examples ◽  
First Order

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.

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.

scholarly journals Ball Comparison for Some Efficient Fourth Order Iterative Methods Under Weak Conditions

Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 89
Author(s):  
Ioannis Argyros ◽  
Ramandeep Behl
Keyword(s):  
Banach Space ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Numerical Experiments ◽  
Order Derivative ◽  
First Derivative

We provide a ball comparison between some 4-order methods to solve nonlinear equations involving Banach space valued operators. We only use hypotheses on the first derivative, as compared to the earlier works where they considered conditions reaching up to 5-order derivative, although these derivatives do not appear in the methods. Hence, we expand the applicability of them. Numerical experiments are used to compare the radii of convergence of these methods.

scholarly journals A new family of fourth-order methods for multiple roots of nonlinear equations

2013 ◽  
Vol 18 (2) ◽  
pp. 143-152 ◽  
Author(s):  
Baoqing Liu ◽  
Xiaojian Zhou
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
Optimal Order ◽  
Multiple Roots ◽  
First Derivative ◽  
New Family ◽  
Modified Newton’S Method

Recently, some optimal fourth-order iterative methods for multiple roots of nonlinear equations are presented when the multiplicity m of the root is known. Different from these optimal iterative methods known already, this paper presents a new family of iterative methods using the modified Newton’s method as its first step. The new family, requiring one evaluation of the function and two evaluations of its first derivative, is of optimal order. Numerical examples are given to suggest that the new family can be competitive with other fourth-order methods and the modified Newton’s method for multiple roots.

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.

Sign in / Sign up

Export Citation Format

Share Document