scholarly journals Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
T. Lotfi ◽  
F. Soleymani ◽  
S. Sharifi ◽  
S. Shateyi ◽  
F. Khaksar Haghani

Two new families of multipoint without memory iterative methods with eighth- and sixteenth-orders are constructed using the symbolic software Mathematica. The key idea in constructing such methods is based on producing some generic suitable functions to reduce the functional evaluations and increase the order of convergence along the computational efficiency. Again by applying Mathematica, we design a hybrid algorithm to capture all the simple real solutions of nonlinear equations in an interval. The application of the new schemes in producing fractal pictures is also furnished.

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum

We construct a biparametric family of fourth-order iterative methods to compute multiple roots of nonlinear equations. This method is verified to be optimally convergent. Various nonlinear equations confirm our proposed method with order of convergence of four and show that the computed asymptotic error constant agrees with the theoretical one.


2018 ◽  
Vol 14 (1) ◽  
pp. 179-187
Author(s):  
Jivandhar Jnawali ◽  
Chet Raj Bhatta

 The main purpose of this paper is to derive two higher order iterative methods for solving nonlinear equations as variants of Mir, Ayub and Rafiq method. These methods are free from higher order derivatives. We obtain these methods by amalgamating Mir, Ayub and Rafiq method with standard secant method and modified secant method given by Amat and Busquier. The order of convergence of new variants are four and six. Also, numerical examples are given to compare the performance of newly introduced methods with the similar existing methods. 2010 AMS Subject Classification: 65H05 Journal of the Institute of Engineering, 2018, 14(1): 179-187


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.


2021 ◽  
Vol 2 (1) ◽  
pp. 17-24
Author(s):  
Jivandhar Jnawali

In this work, we present two Newton type iterative methods for finding the solution of nonlinear equations of single variable. One is obtained as variant of McDougall and Wotherspoon method, and another is obtained by amalgamation of Potra and Pta’k method and our newly introduced method. The order of convergence of these methods are 1 + √2 and 3.5615. Some numerical examples are given to compare the performance of these methods with some similar existing methods.


2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
F. Soleymani

This paper contributes a very general class of two-point iterative methods without memory for solving nonlinear equations. The class of methods is developed using weight function approach. Per iteration, each method of the class includes two evaluations of the function and one of its first-order derivative. The analytical study of the main theorem is presented in detail to show the fourth order of convergence. Furthermore, it is discussed that many of the existing fourth-order methods without memory are members from this developed class. Finally, numerical examples are taken into account to manifest the accuracy of the derived methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Artidiello ◽  
A. Cordero ◽  
Juan R. Torregrosa ◽  
M. P. Vassileva

A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.


Sign in / Sign up

Export Citation Format

Share Document