scholarly journals A New High-Order Jacobian-Free Iterative Method with Memory for Solving Nonlinear Systems

Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2122
Author(s):  
Ramandeep Behl ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
Sonia Bhalla
Keyword(s):  
Nonlinear Systems ◽  
Iterative Method ◽  
Order Of Convergence ◽  
Recent Literature ◽  
Basin Of Attraction ◽  
Qualitative Behavior ◽  
Order Convergence ◽  
Numerical Tests ◽  
Initial Scheme ◽  
With Memory

We used a Kurchatov-type accelerator to construct an iterative method with memory for solving nonlinear systems, with sixth-order convergence. It was developed from an initial scheme without memory, with order of convergence four. There exist few multidimensional schemes using more than one previous iterate in the very recent literature, mostly with low orders of convergence. The proposed scheme showed its efficiency and robustness in several numerical tests, where it was also compared with the existing procedures with high orders of convergence. These numerical tests included large nonlinear systems. In addition, we show that the proposed scheme has very stable qualitative behavior, by means of the analysis of an associated multidimensional, real rational function and also by means of a comparison of its basin of attraction with those of comparison methods.

scholarly journals Memory in a New Variant of King’s Family for Solving Nonlinear Systems

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1251
Author(s):  
Munish Kansal ◽  
Alicia Cordero ◽  
Sonia Bhalla ◽  
Juan R. Torregrosa
Keyword(s):  
Nonlinear Systems ◽  
Convergence Analysis ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Recent Literature ◽  
Divided Difference ◽  
Difference Operators ◽  
New Variant ◽  
Order Four ◽  
With Memory

In the recent literature, very few high-order Jacobian-free methods with memory for solving nonlinear systems appear. In this paper, we introduce a new variant of King’s family with order four to solve nonlinear systems along with its convergence analysis. The proposed family requires two divided difference operators and to compute only one inverse of a matrix per iteration. Furthermore, we have extended the proposed scheme up to the sixth-order of convergence with two additional functional evaluations. In addition, these schemes are further extended to methods with memory. We illustrate their applicability by performing numerical experiments on a wide variety of practical problems, even big-sized. It is observed that these methods produce approximations of greater accuracy and are more efficient in practice, compared with the existing methods.

scholarly journals Derivative-Free Iterative Methods with Some Kurchatov-Type Accelerating Parameters for Solving Nonlinear Systems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 943
Author(s):  
Xiaofeng Wang ◽  
Yingfanghua Jin ◽  
Yali Zhao
Keyword(s):  
Nonlinear Systems ◽  
Iterative Methods ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Nonlinear Ordinary Differential Equations ◽  
New Methods ◽  
Derivative Free ◽  
Initial Scheme ◽  
With Memory ◽  
Theoretical Results

Some Kurchatov-type accelerating parameters are used to construct some derivative-free iterative methods with memory for solving nonlinear systems. New iterative methods are developed from an initial scheme without memory with order of convergence three. New methods have the convergence order 2+5≈4.236 and 5, respectively. The application of new methods can solve standard nonlinear systems and nonlinear ordinary differential equations (ODEs) in numerical experiments. Numerical results support the theoretical results.

scholarly journals On Some Iterative Methods with Memory and High Efficiency Index for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Efficiency ◽  
Efficiency Index ◽  
Order Convergence ◽  
Eighth Order ◽  
Additional Function ◽  
Numerical Comparisons ◽  
With Memory

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.

scholarly journals A New Class of Iterative Processes for Solving Nonlinear Systems by Using One Divided Differences Operator

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 776 ◽  
Author(s):  
Alicia Cordero ◽  
Cristina Jordán ◽  
Esther Sanabria ◽  
Juan R. Torregrosa
Keyword(s):  
Nonlinear Systems ◽  
Boundary Problem ◽  
Fourth Order ◽  
Difference Operator ◽  
Divided Difference ◽  
Order Convergence ◽  
New Class ◽  
Numerical Tests ◽  
New Family ◽  
Theoretical Results

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.

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 Multipoint Fractional Iterative Methods with (2α + 1)th-Order of Convergence for Solving Nonlinear Problems

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 452
Author(s):  
Giro Candelario ◽  
Alicia Cordero ◽  
Juan R. Torregrosa
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Newton Method ◽  
Fractional Derivatives ◽  
Order Of Convergence ◽  
Recent Literature ◽  
Nonlinear Problems ◽  
Type Method ◽  
Numerical Tests ◽  
Multipoint Method

In the recent literature, some fractional one-point Newton-type methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper, we introduce a new fractional Newton-type method with order of convergence α + 1 and compare it with the existing fractional Newton method with order 2 α . Moreover, we also introduce a multipoint fractional Traub-type method with order 2 α + 1 and compare its performance with that of its first step. Some numerical tests and analysis of the dependence on the initial estimations are made for each case, including a comparison with classical Newton ( α = 1 of the first step of the class) and classical Traub’s scheme ( α = 1 of fractional proposed multipoint method). In this comparison, some cases are found where classical Newton and Traub’s methods do not converge and the proposed methods do, among other advantages.

scholarly journals Generalized High-Order Classes for Solving Nonlinear Systems and Their Applications

Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1194 ◽  
Author(s):  
Francisco I. Chicharro ◽  
Alicia Cordero ◽  
Neus Garrido ◽  
Juan R. Torregrosa
Keyword(s):  
Nonlinear Systems ◽  
Iterative Method ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Divided Difference ◽  
High Order ◽  
Weight Functions ◽  
Systems Of Equations ◽  
Nonlinear Systems Of Equations ◽  
New Methods

A generalized high-order class for approximating the solution of nonlinear systems of equations is introduced. First, from a fourth-order iterative family for solving nonlinear equations, we propose an extension to nonlinear systems of equations holding the same order of convergence but replacing the Jacobian by a divided difference in the weight functions for systems. The proposed GH family of methods is designed from this fourth-order family using both the composition and the weight functions technique. The resulting family has order of convergence 9. The performance of a particular iterative method of both families is analyzed for solving different test systems and also for the Fisher’s problem, showing the good performance of the new methods.

scholarly journals Potra-Pták Iterative Method with Memory

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Taher Lotfi ◽  
Stanford Shateyi ◽  
Sommayeh Hadadi
Keyword(s):  
Iterative Method ◽  
Free Parameter ◽  
Order Of Convergence ◽  
The Third ◽  
With Memory ◽  
Interpolatory Polynomial

The problem is to extend the method proposed by Soleymani et al. (2012) to a method with memory. Following this aim, a free parameter is calculated using Newton’s interpolatory polynomial of the third degree. So the R-order of convergence is increased from 4 to 6 without any new function evaluations. Numerically the extended method is examined along with comparison to some existing methods with the similar properties.

Fast Root-Finding of Nonlinear Equations in Geometric Computation

2013 ◽  
Vol 756-759 ◽  
pp. 2808-2812
Author(s):  
Chang Chun Geng ◽  
Zhong Li ◽  
Tian He Zhou ◽  
Bin Yang
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Divided Difference ◽  
Order Convergence ◽  
Root Finding ◽  
Geometric Problems ◽  
New Family ◽  
Seventh Order ◽  
Roots Of Polynomials

Computing the roots of polynomials is an important issue in various geometric problems. In this paper, we introduce a new family of iterative methods with sixth and seventh order convergence for nonlinear equations (or polynomials). The new method is obtained by combining a different fourth-order iterative method with Newtons method and using the approximation based on the divided difference to replace the derivative. It can improve the order of convergence and reduce the required number of functional evaluations per step. Numerical comparisons demonstrate the performance of the presented methods.

scholarly journals Two Bi-Accelerator Improved with Memory Schemes for Solving Nonlinear Equations

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
J. P. Jaiswal
Keyword(s):  
Theoretical Result ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Order Convergence ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Memory Schemes ◽  
With Memory ◽  
Interpolatory Polynomial

The present paper is devoted to the improvement of theR-order convergence of with memory derivative free methods presented by Lotfi et al. (2014) without doing any new evaluation. To achieve this aim one more self-accelerating parameter is inserted, which is calculated with the help of Newton’s interpolatory polynomial. First theoretically it is proved that theR-order of convergence of the proposed schemes is increased from 6 to 7 and 12 to 14, respectively, without adding any extra evaluation. Smooth as well as nonsmooth examples are discussed to confirm theoretical result and superiority of the proposed schemes.

Sign in / Sign up

Export Citation Format

Share Document