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
2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
S. Amat ◽  
C. Bermúdez ◽  
S. Busquier ◽  
M. J. Legaz ◽  
S. Plaza

This paper is devoted to the study of a class of high-order iterative methods for nonlinear equations on Banach spaces. An analysis of the convergence under Kantorovich-type conditions is proposed. Some numerical experiments, where the analyzed methods present better behavior than some classical schemes, are presented. These applications include the approximation of some quadratic and integral equations.


2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Isaac Fried

The asymptotic form of the Taylor-Lagrange remainder is used to derive some new, efficient, high-order methods to iteratively locate the root, simple or multiple, of a nonlinear function. Also derived are superquadratic methods that converge contrarily and superlinear and supercubic methods that converge alternatingly, enabling us not only to approach, but also to bracket the root.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari

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.


2010 ◽  
Vol 43 (3) ◽  
Author(s):  
Le Thi Phuong Ngoc ◽  
Le Xuan Truong ◽  
Nguyen Thanh Long

2018 ◽  
Vol 22 ◽  
pp. 01002
Author(s):  
Suzan Cival Buranay ◽  
Ovgu Cidar Iyikal

The motivation of the present work is to propose high order iterative methods with a recurrence formula for approximate matrix inversion and provide regularized solution of Fredholm integral equation of first kind with noisy data by an algorithm using the proposed methods. From the given family of methods of orders p = 7,11,15,19 are applied to solve problems of Fredholm integral equation of first kind. From the literature, iterative methods of same orders are used to solve the considered problems and numerical comparisons are shown through tables and figures.


2015 ◽  
Vol 22 (4) ◽  
pp. 585-595 ◽  
Author(s):  
S. Amat ◽  
J. A. Ezquerro ◽  
M. A. Hernández-Verón

2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG

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.


Sign in / Sign up

Export Citation Format

Share Document