Efficient Family of Sixth-Order Methods for Nonlinear Models with Its Dynamics

2019 ◽  
Vol 16 (05) ◽  
pp. 1840008
Author(s):  
Ramandeep Behl ◽  
Prashanth Maroju ◽  
S. S. Motsa
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Complex Dynamics ◽  
Nonlinear Models ◽  
Computational Cost ◽  
Sixth Order ◽  
System Of Nonlinear Equations ◽  
Van Der Pol ◽  
Numerical Work ◽  
The Family

In this study, we design a new efficient family of sixth-order iterative methods for solving scalar as well as system of nonlinear equations. The main beauty of the proposed family is that we have to calculate only one inverse of the Jacobian matrix in the case of nonlinear system which reduces the computational cost. The convergence properties are fully investigated along with two main theorems describing their order of convergence. By using complex dynamics tools, its stability is analyzed, showing stable members of the family. From this study, we intend to have more information about these methods in order to detect those with best stability properties. In addition, we also presented a numerical work which confirms the order of convergence of the proposed family is well deduced for scalar, as well as system of nonlinear equations. Further, we have also shown the implementation of the proposed techniques on real world problems like Van der Pol equation, Hammerstein integral equation, etc.

scholarly journals Modified Potra-Pták Multi-step Schemes with Accelerated Order of Convergence for Solving Systems of Nonlinear Equations

2018 ◽  
Vol 24 (1) ◽  
pp. 3
Author(s):  
Himani Arora ◽  
Juan Torregrosa ◽  
Alicia Cordero
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Sixth Order ◽  
Systems Of Nonlinear Equations ◽  
Order Method ◽  
Third Order ◽  
Boundary Problems ◽  
Newton Step ◽  
The Family ◽  
Efficiency And Reliability

In this study, an iterative scheme of sixth order of convergence for solving systems of nonlinear equations is presented. The scheme is composed of three steps, of which the first two steps are that of third order Potra-Pták method and last is weighted-Newton step. Furthermore, we generalize our work to derive a family of multi-step iterative methods with order of convergence 3 r + 6 , r = 0 , 1 , 2 , … . The sixth order method is the special case of this multi-step scheme for r = 0 . The family gives a four-step ninth order method for r = 1 . As much higher order methods are not used in practice, so we study sixth and ninth order methods in detail. Numerical examples are included to confirm theoretical results and to compare the methods with some existing ones. Different numerical tests, containing academical functions and systems resulting from the discretization of boundary problems, are introduced to show the efficiency and reliability of the proposed methods.

Higher Order Two-Point Efficient Family of Halley Type Methods for Simple Roots

2016 ◽  
Vol 13 (04) ◽  
pp. 1641016 ◽  
Author(s):  
Ramandeep Behl ◽  
S. S. Motsa
Keyword(s):  
Nonlinear Equations ◽  
Computational Cost ◽  
Basins Of Attraction ◽  
Higher Order ◽  
The Other ◽  
Sixth Order ◽  
Order Derivative ◽  
Initial Value ◽  
First Order ◽  
The Family

In this paper, we proposed a new highly efficient two-point sixth-order family of Halley type methods that do not require any second-order derivative evaluation for obtaining simple roots of nonlinear equations, numerically. In terms of computational cost, each member of the family requires two-function and two first-order derivative evaluations per iteration. On the account of the results obtained, it is found that our proposed methods are efficient and show better performance than existing sixth-order methods available in the literature. Further, it is also noted that larger basins of attraction belong to our methods as compared to the existing ones. On the other hand, the existing methods are slower and have darker basins while some of them are too sensitive upon the choice of the initial value.

scholarly journals Chaos and Stability in a New Iterative Family for Solving Nonlinear Equations

Algorithms ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 101
Author(s):  
Alicia Cordero ◽  
Marlon Moscoso-Martínez ◽  
Juan R. Torregrosa
Keyword(s):  
Fixed Points ◽  
Periodic Orbits ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Complex Dynamics ◽  
Convergence Properties ◽  
Parameter Spaces ◽  
Numerical Tests ◽  
The Family ◽  
Dynamics Stability

In this paper, we present a new parametric family of three-step iterative for solving nonlinear equations. First, we design a fourth-order triparametric family that, by holding only one of its parameters, we get to accelerate its convergence and finally obtain a sixth-order uniparametric family. With this last family, we study its convergence, its complex dynamics (stability), and its numerical behavior. The parameter spaces and dynamical planes are presented showing the complexity of the family. From the parameter spaces, we have been able to determine different members of the family that have bad convergence properties, as attracting periodic orbits and attracting strange fixed points appear in their dynamical planes. Moreover, this same study has allowed us to detect family members with especially stable behavior and suitable for solving practical problems. Several numerical tests are performed to illustrate the efficiency and stability of the presented family.

scholarly journals On a New Method for Computing the Numerical Solution of Systems of Nonlinear Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
H. Montazeri ◽  
F. Soleymani ◽  
S. Shateyi ◽  
S. S. Motsa
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
The Other ◽  
Systems Of Nonlinear Equations ◽  
System Of Nonlinear Equations ◽  
Numerical Tests ◽  
Programming Package ◽  
New Iterative Method

We consider a system of nonlinear equationsF(x)=0. A new iterative method for solving this problem numerically is suggested. The analytical discussions of the method are provided to reveal its sixth order of convergence. A discussion on the efficiency index of the contribution with comparison to the other iterative methods is also given. Finally, numerical tests illustrate the theoretical aspects using the programming package Mathematica.

scholarly journals On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mudassir Shams ◽  
Naila Rafiq ◽  
Nasreen Kausar ◽  
Praveen Agarwal ◽  
Choonkil Park ◽  
...  
Keyword(s):  
Nonlinear Equation ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Basin Of Attraction ◽  
Numerical Test ◽  
Computational Cost ◽  
System Of Nonlinear Equations ◽  
Single Root ◽  
Root Finding

AbstractIn this article, we construct a family of iterative methods for finding a single root of nonlinear equation and then generalize this family of iterative methods for determining all roots of nonlinear equations simultaneously. Further we extend this family of root estimating methods for solving a system of nonlinear equations. Convergence analysis shows that the order of convergence is 3 in case of the single root finding method as well as for the system of nonlinear equations and is 5 for simultaneous determination of all distinct and multiple roots of a nonlinear equation. The computational cost, basin of attraction, efficiency, log of residual and numerical test examples show that the newly constructed methods are more efficient as compared to the existing methods in literature.

scholarly journals Chaotic numerical instabilities arising in the transition from differential to difference nonlinear equations

2000 ◽  
Vol 4 (1) ◽  
pp. 21-28
Author(s):  
Alicia Serfaty de Markus
Keyword(s):  
Differential Equation ◽  
Finite Difference ◽  
Difference Equation ◽  
Nonlinear Equations ◽  
Chaotic Dynamics ◽  
Nonlinear Models ◽  
Lorenz Equations ◽  
Van Der Pol ◽  
Complex Difference Equation ◽  
Numerical Instabilities

For computational purposes, a numerical algorithm maps a differential equation into an often complex difference equation whose structure and stability depends on the scheme used. When considering nonlinear models, standard and nonstandard integration routines can act invasively and numerical chaotic instabilities may arise. However, because nonstandard schemes offer a direct and generally simpler finite-difference representations, in this work nonstandard constructions were tested over three different systems: a photoconductor model, the Lorenz equations and the Van der Pol equations. Results showed that although some nonstandard constructions created a chaotic dynamics of their own, there was found a construction in every case that greatly reduced or successfully removed numerical chaotic instabilities. These improvements represent a valuable development to incorporate into more sophisticated algorithms.

scholarly journals A New High-Order and Efficient Family of Iterative Techniques for Nonlinear Models

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Ramandeep Behl ◽  
Eulalia Martínez
Keyword(s):  
Convergence Analysis ◽  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Free Parameter ◽  
Nonlinear Models ◽  
High Order ◽  
System Of Nonlinear Equations ◽  
Iterative Technique ◽  
Order Convergence ◽  
Validity And Reliability

In this paper, we want to construct a new high-order and efficient iterative technique for solving a system of nonlinear equations. For this purpose, we extend the earlier scalar scheme [16] to a system of nonlinear equations preserving the same convergence order. Moreover, by adding one more additional step, we obtain minimum 5th-order convergence for every value of a free parameter, θ∈ℝ, and for θ=−1, the method reaches maximum 6-order convergence. We present an extensive convergence analysis of our scheme. The analytical discussion of the work is upheld by performing numerical experiments on some applied science problems and a large system of nonlinear equations. Furthermore, numerical results demonstrate the validity and reliability of the suggested methods.

scholarly journals Efficient Two-Step Fifth-Order and Its Higher-Order Algorithms for Solving Nonlinear Systems with Applications

Axioms ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 37
Author(s):  
Parimala Sivakumar ◽  
Jayakumar Jayaraman
Keyword(s):  
Order Of Convergence ◽  
Computational Cost ◽  
Convergence Order ◽  
Function Evaluation ◽  
Test Problems ◽  
System Of Nonlinear Equations ◽  
Numerical Implementation ◽  
Step Algorithm ◽  
Fifth Order ◽  
Better Than

This manuscript presents a new two-step weighted Newton’s algorithm with convergence order five for approximating solutions of system of nonlinear equations. This algorithm needs evaluation of two vector functions and two Frechet derivatives per iteration. Furthermore, it is improved into a general multi-step algorithm with one more vector function evaluation per step, with convergence order 3 k + 5 , k ≥ 1 . Error analysis providing order of convergence of the algorithms and their computational efficiency are discussed based on the computational cost. Numerical implementation through some test problems are included, and comparison with well-known equivalent algorithms are presented. To verify the applicability of the proposed algorithms, we have implemented them on 1-D and 2-D Bratu problems. The presented algorithms perform better than many existing algorithms and are equivalent to a few available algorithms.

scholarly journals A New Sixth Order Method for Nonlinear Equations inR

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Sukhjit Singh ◽  
D. K. Gupta
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Performance Measure ◽  
Sixth Order ◽  
Order Method ◽  
Numerical Examples ◽  
Real Roots ◽  
New Iterative Method ◽  
Number Of Iterations

A new iterative method is described for finding the real roots of nonlinear equations inR. Starting with a suitably chosenx0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. The number of iterations and the total number of function evaluations used to get a simple root are taken as performance measure of our method. The efficacy of the method is tested on a number of numerical examples and the results obtained are summarized in tables. It is observed that our method is superior to Newton’s method and other sixth order methods considered.

scholarly journals Multi-Step Preconditioned Newton Methods for Solving Systems of Nonlinear Equations

2017 ◽  
Author(s):  
Fayyaz Ahmad ◽  
Malik Zaka Ullah ◽  
Ali Saleh Alshomrani ◽  
Shamshad Ahmad ◽  
Aisha M. Alqahtani ◽  
...  
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Numerical Stability ◽  
Order Of Convergence ◽  
Convergence Order ◽  
Systems Of Nonlinear Equations ◽  
System Of Nonlinear Equations ◽  
Newton Methods ◽  
Rapid Convergence ◽  
Base Method

The study of different forms of preconditioners for solving a system of nonlinear equations, by using Newton’s method, is presented. The preconditioners provide numerical stability and rapid convergence with reasonable computation cost, whenever chosen accurately. Different families of iterative methods can be constructed by using a different kind of preconditioners. The multi-step iterative method consists of a base method and multi-step part. The convergence order of base method is quadratic and each multi-step add an additive factor of one in the previously achieved convergence order. Hence the convergence of order of an m-step iterative method is m + 1. Numerical simulations confirm the claimed convergence order by calculating the computational order of convergence. Finally, the numerical results clearly show the benefit of preconditioning for solving system of nonlinear equations.

Sign in / Sign up

Export Citation Format

Share Document