scholarly journals An Optimal Fourth Order Iterative Method for Solving Nonlinear Equations and Its Dynamics

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Rajni Sharma ◽  
Ashu Bahl
Keyword(s):  
Fourth Order ◽  
Dynamical Behavior ◽  
Computational Cost ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Optimal Order ◽  
Extraneous Fixed Points ◽  
Fourth Order Method ◽  
Jarratt Method ◽  
Better Than

We present a new fourth order method for finding simple roots of a nonlinear equation f(x)=0. In terms of computational cost, per iteration the method uses one evaluation of the function and two evaluations of its first derivative. Therefore, the method has optimal order with efficiency index 1.587 which is better than efficiency index 1.414 of Newton method and the same with Jarratt method and King’s family. Numerical examples are given to support that the method thus obtained is competitive with other similar robust methods. The conjugacy maps and extraneous fixed points of the presented method and other existing fourth order methods are discussed, and their basins of attraction are also given to demonstrate their dynamical behavior in the complex plane.

scholarly journals Optimal Fourth, Eighth and Sixteenth Order Methods by Using Divided Difference Techniques and Their Basins of Attraction and Its Application

Mathematics ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 322 ◽  
Author(s):  
Yanlin Tao ◽  
Kalyanasundaram Madhu
Keyword(s):  
Dynamical Behavior ◽  
Computational Cost ◽  
Basins Of Attraction ◽  
Order Method ◽  
Eighth Order ◽  
Projectile Motion ◽  
First Derivative ◽  
Iteration Functions ◽  
Optimal Launch Angle ◽  
Fourth Order Method

The principal objective of this work is to propose a fourth, eighth and sixteenth order scheme for solving a nonlinear equation. In terms of computational cost, per iteration, the fourth order method uses two evaluations of the function and one evaluation of the first derivative; the eighth order method uses three evaluations of the function and one evaluation of the first derivative; and sixteenth order method uses four evaluations of the function and one evaluation of the first derivative. So these all the methods have satisfied the Kung-Traub optimality conjecture. In addition, the theoretical convergence properties of our schemes are fully explored with the help of the main theorem that demonstrates the convergence order. The performance and effectiveness of our optimal iteration functions are compared with the existing competitors on some standard academic problems. The conjugacy maps of the presented method and other existing eighth order methods are discussed, and their basins of attraction are also given to demonstrate their dynamical behavior in the complex plane. We apply the new scheme to find the optimal launch angle in a projectile motion problem and Planck’s radiation law problem as an application.

scholarly journals A Novel Family of Efficient Weighted-Newton Multiple Root Iterations

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1494
Author(s):  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Lorentz Jăntschi
Keyword(s):  
Fourth Order ◽  
Nonlinear Function ◽  
Multiple Root ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Order Method ◽  
Graphical Tool ◽  
Seventh Order ◽  
Fourth Order Method ◽  
Local Convergence Analysis

We propose a novel family of seventh-order iterative methods for computing multiple zeros of a nonlinear function. The algorithm consists of three steps, of which the first two are the steps of recently developed Liu–Zhou fourth-order method, whereas the third step is based on a Newton-like step. The efficiency index of the proposed scheme is 1.627, which is better than the efficiency index 1.587 of the basic Liu–Zhou fourth-order method. In this sense, the proposed iteration is the modification over the Liu–Zhou iteration. Theoretical results are fully studied including the main theorem of local convergence analysis. Moreover, convergence domains are also assessed using the graphical tool, namely, basins of attraction which are symmetrical through the fractal like boundaries. Accuracy and computational efficiency are demonstrated by implementing the algorithms on different numerical problems. Comparison of numerical experiments shows that the new methods have an edge over the existing methods.

scholarly journals An optimal fourth-order family of modified Cauchy methods for finding solutions of nonlinear equations and their dynamical behavior

2019 ◽  
Vol 17 (1) ◽  
pp. 1567-1598
Author(s):  
Tianbao Liu ◽  
Xiwen Qin ◽  
Qiuyue Li
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Dynamical Behavior ◽  
Basins Of Attraction ◽  
Second Derivative ◽  
Third Order ◽  
Numerical Tests ◽  
The Family ◽  
Theoretical Results ◽  
High Computational Efficiency

Abstract In this paper, we derive and analyze a new one-parameter family of modified Cauchy method free from second derivative for obtaining simple roots of nonlinear equations by using Padé approximant. The convergence analysis of the family is also considered, and the methods have convergence order three. Based on the family of third-order method, in order to increase the order of the convergence, a new optimal fourth-order family of modified Cauchy methods is obtained by using weight function. We also perform some numerical tests and the comparison with existing optimal fourth-order methods to show the high computational efficiency of the proposed scheme, which confirm our theoretical results. The basins of attraction of this optimal fourth-order family and existing fourth-order methods are presented and compared to illustrate some elements of the proposed family have equal or better stable behavior in many aspects. Furthermore, from the fractal graphics, with the increase of the value m of the series in iterative methods, the chaotic behaviors of the methods become more and more complex, which also reflected in some existing fourth-order methods.

scholarly journals Further Acceleration of the Simpson Method for Solving Nonlinear Equations

2018 ◽  
Vol 14 (2) ◽  
pp. 7631-7639
Author(s):  
Rajinder Thukral
Keyword(s):  
Nonlinear Equation ◽  
Fourth Order ◽  
Efficiency Index ◽  
New Method ◽  
Order Method ◽  
Third Order ◽  
Type Method ◽  
New Formula ◽  
Order Four ◽  
Better Than

There are two aims of this paper, firstly, we present an improvement of the classical Simpson third-order method for finding zeros a nonlinear equation and secondly, we introduce a new formula for approximating second-order derivative. The new Simpson-type method is shown to converge of the order four.  Per iteration the new method requires same amount of evaluations of the function and therefore the new method has an efficiency index better than the classical Simpson method.  We examine the effectiveness of the new fourth-order Simpson-type method by approximating the simple root of a given nonlinear equation. Numerical comparisons is made with classical Simpson method to show the performance of the presented method.

scholarly journals An Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Rajni Sharma ◽  
Janak Raj Sharma
Keyword(s):  
Computational Cost ◽  
Efficiency Index ◽  
Optimal Order ◽  
Computational Results ◽  
Order Convergence ◽  
Eighth Order ◽  
Root Finding ◽  
First Derivative ◽  
The Family ◽  
Iteration Methods

We derive a family of eighth-order multipoint methods for the solution of nonlinear equations. In terms of computational cost, the family requires evaluations of only three functions and one first derivative per iteration. This implies that the efficiency index of the present methods is 1.682. Kung and Traub (1974) conjectured that multipoint iteration methods without memory based on n evaluations have optimal order . Thus, the family agrees with Kung-Traub conjecture for the case . Computational results demonstrate that the developed methods are efficient and robust as compared with many well-known 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 Geometric Construction of Eighth-Order Optimal Families of Ostrowski’s Method

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Ramandeep Behl ◽  
S. S. Motsa
Keyword(s):  
Fourth Order ◽  
Weighted Average ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Geometric Construction ◽  
The Other ◽  
Initial Value ◽  
Eighth Order ◽  
Numerical Examples ◽  
Ostrowski’S Method

Based on well-known fourth-order Ostrowski’s method, we proposed many new interesting optimal families of eighth-order multipoint methods without memory for obtaining simple roots. Its geometric construction consists in approximatingfn′atznin such a way that its average with the known tangent slopesfn′atxnandynis the same as the known weighted average of secant slopes and then we apply weight function approach. The adaptation of this strategy increases the convergence order of Ostrowski's method from four to eight and its efficiency index from 1.587 to 1.682. Finally, a number of numerical examples are also proposed to illustrate their accuracy by comparing them with the new existing optimal eighth-order methods available in the literature. It is found that they are very useful in high precision computations. Further, it is also noted that larger basins of attraction belong to our methods although the other methods are slow and have darker basins while some of the methods are too sensitive upon the choice of the initial value.

scholarly journals Higher-Order Derivative-Free Iterative Methods for Solving Nonlinear Equations and Their Basins of Attraction

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1052 ◽  
Author(s):  
Jian Li ◽  
Xiaomeng Wang ◽  
Kalyanasundaram Madhu
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Complex Plane ◽  
Dynamical Behavior ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Type Method ◽  
New Methods ◽  
Derivative Free ◽  
Higher Order Derivative

Based on the Steffensen-type method, we develop fourth-, eighth-, and sixteenth-order algorithms for solving one-variable equations. The new methods are fourth-, eighth-, and sixteenth-order converging and require at each iteration three, four, and five function evaluations, respectively. Therefore, all these algorithms are optimal in the sense of Kung–Traub conjecture; the new schemes have an efficiency index of 1.587, 1.682, and 1.741, respectively. We have given convergence analyses of the proposed methods and also given comparisons with already established known schemes having the same convergence order, demonstrating the efficiency of the present techniques numerically. We also studied basins of attraction to demonstrate their dynamical behavior in the complex plane.

scholarly journals Design and Complex Dynamics of Potra–Pták-Type Optimal Methods for Solving Nonlinear Equations and Its Applications

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 942 ◽  
Author(s):  
Prem B. Chand ◽  
Francisco I. Chicharro ◽  
Neus Garrido ◽  
Pankaj Jain
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Complex Dynamics ◽  
Basins Of Attraction ◽  
Weight Functions ◽  
Order Method ◽  
Eighth Order ◽  
Numerical Examples ◽  
Fourth Order Method ◽  
Cubic Polynomials

In this paper, using the idea of weight functions on the Potra–Pták method, an optimal fourth order method, a non optimal sixth order method, and a family of optimal eighth order methods are proposed. These methods are tested on some numerical examples, and the results are compared with some known methods of the corresponding order. It is proved that the results obtained from the proposed methods are compatible with other methods. The proposed methods are tested on some problems related to engineering and science. Furthermore, applying these methods on quadratic and cubic polynomials, their stability is analyzed by means of their basins of attraction.

Sign in / Sign up

Export Citation Format

Share Document