scholarly journals New Mono- and Biaccelerator Iterative Methods with Memory for Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
T. Lotfi ◽  
F. Soleymani ◽  
S. Shateyi ◽  
P. Assari ◽  
F. Khaksar Haghani
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Computational Efficiency ◽  
Acceleration Of Convergence ◽  
Convergence Orders ◽  
With Memory ◽  
High Computational Efficiency

Acceleration of convergence is discussed for some families of iterative methods in order to solve scalar nonlinear equations. In fact, we construct mono- and biparametric methods with memory and study their orders. It is shown that the convergence orders 12 and 14 can be attained using only 4 functional evaluations, which provides high computational efficiency indices. Some illustrations will also be given to reverify the theoretical discussions.

SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS

2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Type Method ◽  
New Methods ◽  
Hermite Interpolating Polynomial ◽  
With Memory ◽  
Theoretical Results ◽  
Very High ◽  
High Computational Efficiency

In this paper, we present some three-point Newton-type iterative methods without memory for solving nonlinear equations by using undetermined coefficients method. The order of convergence of the new methods without memory is eight requiring the evaluations of three functions and one first-order derivative in per full iteration. Hence, the new methods are optimal according to Kung and Traubs conjecture. Based on the presented methods without memory, we present two families of Newton-type iterative methods with memory. Further accelerations of convergence speed are obtained by using a self-accelerating parameter. This self-accelerating parameter is calculated by the Hermite interpolating polynomial and is applied to improve the order of convergence of the Newton-type method. The corresponding R-order of convergence is increased from 8 to 9, [Formula: see text] and 10. The increase of convergence order is attained without any additional calculations so that the two families of the methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm 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 class of efficient high‐order iterative methods with memory for nonlinear equations and their dynamics

2018 ◽  
Vol 41 (17) ◽  
pp. 7263-7282 ◽  
Author(s):  
Cory L. Howk ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Carles Teruel
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
High Order ◽  
With Memory ◽  
High Order Iterative Methods

scholarly journals A family of two-point methods with memory for solving nonlinear equations

2011 ◽  
Vol 5 (2) ◽  
pp. 298-317 ◽  
Author(s):  
Miodrag Petkovic ◽  
Jovana Dzunic ◽  
Ljiljana Petkovic
Keyword(s):  
Nonlinear Equations ◽  
Free Parameter ◽  
Convergence Order ◽  
Optimal Order ◽  
Additional Function ◽  
Numerical Examples ◽  
Derivative Free ◽  
With Memory ◽  
Theoretical Results ◽  
High Computational Efficiency

An efficient family of two-point derivative free methods with memory for solving nonlinear equations is presented. It is proved that the convergence order of the proposed family is increased from 4 to at least 2 + ?6 ? 4.45, 5, 1/2 (5 + ?33) ? 5.37 and 6, depending on the accelerating technique. The increase of convergence order is attained using a suitable accelerating technique by varying a free parameter in each iteration. The improvement of convergence rate is achieved without any additional function evaluations meaning that the proposed methods with memory are very efficient. Moreover, the presented methods are more efficient than all existing methods known in literature in the class of two-point methods and three-point methods of optimal order eight. Numerical examples and the comparison with the existing two-point methods are included to confirm theoretical results and high computational efficiency. 2010 Mathematics Subject Classification. 65H05

On the Construction of Fast Steffensen-Type Iterative Methods for Nonlinear Equations

2017 ◽  
Vol 15 (02) ◽  
pp. 1850002 ◽  
Author(s):  
Farshad Kiyoumarsi
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Computational Efficiency ◽  
Efficiency Index ◽  
Dynamical Behaviors ◽  
The Given

This paper aims at providing new modifications of Steffensen’s scheme for solving nonlinear equations. The new general approach is discussed in detail theoretically. It is observed that a super fast R-order along with an interesting computational efficiency index will be achieved. Dynamical behaviors of the schemes are given to show an enlarged radii of convergence. Some experiments are also brought forward to support the given theory.

scholarly journals Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mudassir Shams ◽  
Naila Rafiq ◽  
Nasreen Kausar ◽  
Praveen Agarwal ◽  
Choonkil Park ◽  
...  
Keyword(s):  
Iterative Methods ◽  
Computational Efficiency ◽  
Numerical Test ◽  
Polynomial Equation ◽  
Multiple Roots ◽  
Simultaneous Methods ◽  
Numerical Performance ◽  
Very High ◽  
High Computational Efficiency

AbstractTwo new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Convergence analysis shows that the orders of convergence of the newly constructed simultaneous methods are 10 and 12. At the end, numerical test examples are given to check the efficiency and numerical performance of these simultaneous methods.

Sign in / Sign up

Export Citation Format

Share Document