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 Further development on Traub’s method for solving system of nonlinear equations and ODE’s

2020 ◽  
Author(s):  
Kalyanasundaram Madhu ◽  
Mo'tassem Al-arydah
Keyword(s):  
Nonlinear Equation ◽  
Dynamical Behavior ◽  
Basins Of Attraction ◽  
System Of Nonlinear Equations ◽  
Functional Evaluation ◽  
Order Method ◽  
Eighth Order ◽  
Numerical Examples ◽  
First Derivative ◽  
Iteration Methods

Abstract The foremost objective of this work is to propose a eighth and sixteenth order scheme for handling a nonlinear equation. The eighth order method uses three evaluations of the function and one assessment of the first derivative and sixteenth order method uses four evaluations of the function and one appraisal of the first derivative. Kung-Traub conjecture is satisfied, theoretical analysis of the methods are presented and numerical examples are added to confirm the order of convergence. The performance and efficiency of our iteration methods are compared with the equivalent existing methods on some standard academic problems. We tested projectile motion problem, Planck’s radiation law problem as an application. The basins of attraction are also given to demonstrate their dynamical behavior in the complex plane. Further, we attempt to proposed a sixteenth order iterative method for solving system of nonlinear equation with four functional evaluation, namely two F and two F 0 and only one inverse of Jacobian. The theoretical proof of the method is given and numerical examples are included to confirm the convergence order of the presented methods. We apply the new scheme to find solution on 1-D bratu problem. The performance and efficiency of our iteration methods are compared.

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

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 Local Convergence of an Efficient Multipoint Iterative Method in Banach Space

Algorithms ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 25
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Ioannis K. Argyros
Keyword(s):  
Banach Space ◽  
Iterative Method ◽  
Local Convergence ◽  
Numerical Experiments ◽  
Order Method ◽  
Eighth Order ◽  
First Derivative ◽  
Taylor Expansions ◽  
Derivative Free ◽  
Class Of Functions

We discuss the local convergence of a derivative-free eighth order method in a Banach space setting. The present study provides the radius of convergence and bounds on errors under the hypothesis based on the first Fréchet-derivative only. The approaches of using Taylor expansions, containing higher order derivatives, do not provide such estimates since the derivatives may be nonexistent or costly to compute. By using only first derivative, the method can be applied to a wider class of functions and hence its applications are expanded. Numerical experiments show that the present results are applicable to the cases wherein previous results cannot be applied.

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 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 A New Optimized Runge-Kutta Pair for the Numerical Solution of the Radial Schrödinger Equation

2012 ◽  
Vol 2012 ◽  
pp. 1-15
Author(s):  
Yonglei Fang ◽  
Qinghong Li ◽  
Qinghe Ming ◽  
Kaimin Wang
Keyword(s):  
Schrödinger Equation ◽  
Schrodinger Equation ◽  
Phase Lag ◽  
Order Method ◽  
First Derivative ◽  
New Methods ◽  
Radial Schrödinger Equation ◽  
Runge Kutta ◽  
Fourth Order Method ◽  
Fifth Order

A new embedded pair of explicit modified Runge-Kutta (RK) methods for the numerical integration of the radial Schrödinger equation is presented. The two RK methods in the pair have algebraic orders five and four, respectively. The two methods of the embedded pair are derived by nullifying the phase lag, the first derivative of the phase lag of the fifth-order method, and the phase lag of the fourth-order method. Nu merical experiments show the efficiency and robustness of our new methods compared with some well-known integrators in the literature.

scholarly journals Local Convergence Analysis of an Efficient Fourth Order Weighted-Newton Method under Weak Conditions

2018 ◽  
Vol 56 (1) ◽  
pp. 23-34
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Convergence Analysis ◽  
Newton Method ◽  
Fourth Order ◽  
Local Convergence ◽  
Systems Of Nonlinear Equations ◽  
Order Method ◽  
First Derivative ◽  
Fourth Order Method ◽  
Order Four ◽  
Local Convergence Analysis

Abstract Local convergence analysis of a fourth order method considered by Sharma et. al in [19] for solving systems of nonlinear equations. Using conditions on derivatives upto the order five, they proved that the method is of order four. In this study using conditions only on the first derivative, we prove the convergence of the method in [19]. This way we extended the applicability of the method. Numerical example which do not satisfy earlier conditions but satisfy our conditions are presented in this study.

Sign in / Sign up

Export Citation Format

Share Document