scholarly journals An Efficient Family of Traub-Steffensen-Type Methods for Solving Systems of Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Janak Raj Sharma ◽  
Puneet Gupta

Based on Traub-Steffensen method, we present a derivative free three-step family of sixth-order methods for solving systems of nonlinear equations. The local convergence order of the family is determined using first-order divided difference operator for functions of several variables and direct computation by Taylor's expansion. Computational efficiency is discussed, and a comparison between the efficiencies of the proposed techniques with the existing ones is made. Numerical tests are performed to compare the methods of the proposed family with the existing methods and to confirm the theoretical results. It is shown that the new family is especially efficient in solving large systems.

2013 ◽  
Vol 7 (2) ◽  
pp. 390-403 ◽  
Author(s):  
Janak Sharma ◽  
Himani Arora

We present a derivative free method of fourth order convergence for solving systems of nonlinear equations. The method consists of two steps of which first step is the well-known Traub's method. First-order divided difference operator for functions of several variables and direct computation by Taylor's expansion are used to prove the local convergence order. Computational efficiency of new method in its general form is discussed and is compared with existing methods of similar nature. It is proved that for large systems the new method is more efficient. Some numerical tests are performed to compare proposed method with existing methods and to confirm the theoretical results.


2019 ◽  
Vol 17 (1) ◽  
pp. 1567-1598
Author(s):  
Tianbao Liu ◽  
Xiwen Qin ◽  
Qiuyue Li

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.


2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Janak Raj Sharma ◽  
Puneet Gupta

We present iterative methods of convergence order three, five, and six for solving systems of nonlinear equations. Third-order method is composed of two steps, namely, Newton iteration as the first step and weighted-Newton iteration as the second step. Fifth and sixth-order methods are composed of three steps of which the first two steps are same as that of the third-order method whereas the third is again a weighted-Newton step. Computational efficiency in its general form is discussed and a comparison between the efficiencies of proposed techniques with existing ones is made. The performance is tested through numerical examples. Moreover, theoretical results concerning order of convergence and computational efficiency are verified in the examples. It is shown that the present methods have an edge over similar existing methods, particularly when applied to large systems of equations.


2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Moin-ud-Din Junjua ◽  
Saima Akram ◽  
Nusrat Yasmin ◽  
Fiza Zafar

Solving systems of nonlinear equations plays a major role in engineering problems. We present a new family of optimal fourth-order Jarratt-type methods for solving nonlinear equations and extend these methods to solve system of nonlinear equations. Convergence analysis is given for both cases to show that the order of the new methods is four. Cost of computations, numerical tests, and basins of attraction are presented which illustrate the new methods as better alternates to previous methods. We also give an application of the proposed methods to well-known Burger's equation.


Algorithms ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 101
Author(s):  
Alicia Cordero ◽  
Marlon Moscoso-Martínez ◽  
Juan R. Torregrosa

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.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Alicia Cordero ◽  
Moin-ud-Din Junjua ◽  
Juan R. Torregrosa ◽  
Nusrat Yasmin ◽  
Fiza Zafar

We construct a family of derivative-free optimal iterative methods without memory to approximate a simple zero of a nonlinear function. Error analysis demonstrates that the without-memory class has eighth-order convergence and is extendable to with-memory class. The extension of new family to the with-memory one is also presented which attains the convergence order 15.5156 and a very high efficiency index 15.51561/4≈1.9847. Some particular schemes of the with-memory family are also described. Numerical examples and some dynamical aspects of the new schemes are given to support theoretical results.


Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 776 ◽  
Author(s):  
Alicia Cordero ◽  
Cristina Jordán ◽  
Esther Sanabria ◽  
Juan R. Torregrosa

In this manuscript, a new family of Jacobian-free iterative methods for solving nonlinear systems is presented. The fourth-order convergence for all the elements of the class is established, proving, in addition, that one element of this family has order five. The proposed methods have four steps and, in all of them, the same divided difference operator appears. Numerical problems, including systems of academic interest and the system resulting from the discretization of the boundary problem described by Fisher’s equation, are shown to compare the performance of the proposed schemes with other known ones. The numerical tests are in concordance with the theoretical results.


2018 ◽  
Vol 24 (1) ◽  
pp. 3
Author(s):  
Himani Arora ◽  
Juan Torregrosa ◽  
Alicia Cordero

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.


Sign in / Sign up

Export Citation Format

Share Document