A splitting method to solve a single nonlinear equation with derivative-free iterative schemes

Author(s):  
Chein-Shan Liu ◽  
Hong-Ki Hong ◽  
Tsung-Lin Lee
2014 ◽  
Vol 8 ◽  
pp. 4425-4431
Author(s):  
Rika Intan ◽  
M. Imran ◽  
M. D. H. Gamal

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 164
Author(s):  
Moin-ud-Din Junjua ◽  
Fiza Zafar ◽  
Nusrat Yasmin

Finding a simple root for a nonlinear equation f ( x ) = 0 , f : I ⊆ R → R has always been of much interest due to its wide applications in many fields of science and engineering. Newton’s method is usually applied to solve this kind of problems. In this paper, for such problems, we present a family of optimal derivative-free root finding methods of arbitrary high order based on inverse interpolation and modify it by using a transformation of first order derivative. Convergence analysis of the modified methods confirms that the optimal order of convergence is preserved according to the Kung-Traub conjecture. To examine the effectiveness and significance of the newly developed methods numerically, several nonlinear equations including the van der Waals equation are tested.


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

Based on iterative method proposed by Basto et al. (2006), we present a new derivative-free iterative method for solving nonlinear equations. The aim of this paper is to develop a new method to find the approximation of the root α of the nonlinear equation f(x)=0. This method has the efficiency index which equals 61/4=1.5651. The benefit of this method is that this method does not need to calculate any derivative. Several examples illustrate that the efficiency of the new method is better than that of previous methods.


Mathematics ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 583
Author(s):  
Beny Neta

A new high-order derivative-free method for the solution of a nonlinear equation is developed. The novelty is the use of Traub’s method as a first step. The order is proven and demonstrated. It is also shown that the method has much fewer divergent points and runs faster than an optimal eighth-order derivative-free method.


2021 ◽  
Vol 1115 (1) ◽  
pp. 012002
Author(s):  
A U Omesa ◽  
I M Sulaiman ◽  
M Mamat ◽  
M Y Waziri ◽  
A Shadi ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Ahmed Elmoasry ◽  
Mudassir Shams ◽  
Naveed Yaqoob ◽  
Nasreen Kausar ◽  
Yaé Ulrich Gaba ◽  
...  

In this research article, we propose efficient numerical iterative methods for estimating roots of interval-valued trapezoidal fuzzy nonlinear equations. Convergence analysis proves that the order of convergence of numerical schemes is 3. Some real-life applications are considered from optimization as numerical test problems which contain interval-valued trapezoidal fuzzy quantities in parametric form. Numerical illustrations are given to show the dominance efficiency of the newly constructed iterative schemes as compared to existing methods in literature.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
F. I. Chicharro ◽  
A. Cordero ◽  
J. R. Torregrosa ◽  
M. P. Vassileva

A biparametric family of derivative-free optimal iterative methods of order four, for solving nonlinear equations, is presented. From the error equation of this class, different families of iterative schemes with memory can be designed increasing the order of convergence up to six. The real stability analysis of the biparametric family without memory is made on quadratic polynomials, finding areas in the parametric plane with good performance. Moreover, in order to study the real behavior of the parametric class with memory, we associate it with a discrete multidimensional dynamical system. By analyzing the fixed and critical points of its vectorial rational function, we can select those methods with best stability properties.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Mudassir Shams ◽  
Naila Rafiq ◽  
Nasreen Kausar ◽  
Praveen Agarwal ◽  
Choonkil Park ◽  
...  

AbstractA highly efficient new three-step derivative-free family of numerical iterative schemes for estimating all roots of polynomial equations is presented. Convergence analysis proved that the proposed simultaneous iterative method possesses 12th-order convergence locally. Numerical examples and computational cost are given to demonstrate the capability of the method presented.


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

We construct a new general class of derivative freen-point iterative methods of optimal order of convergence2n-1using rational interpolant. The special cases of this class are obtained. These methods do not need Newton’s iterate in the…first step of their iterative schemes. Numerical computations are presented to show that the new methods are efficient and can be seen as better alternates.


Sign in / Sign up

Export Citation Format

Share Document