An Accelerated Iterative Method with Third-Order Convergence

2012 ◽  
Vol 220-223 ◽  
pp. 2658-2661
Author(s):  
Zhong Yong Hu ◽  
Liang Fang ◽  
Lian Zhong Li
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
New Method ◽  
Order Convergence ◽  
Third Order ◽  
Numerical Examples ◽  
Modified Newton’S Method ◽  
Jarratt Method

We present a new modified Newton's method with third-order convergence and compare it with the Jarratt method, which is of fourth-order. Based on this new method, we obtain a family of Newton-type methods, which converge cubically. Numerical examples show that the presented method can compete with Newton's method and other known third-order modifications of Newton's method.

scholarly journals A fourth order method for finding a simple root of univariate function

2015 ◽  
Vol 34 (2) ◽  
pp. 197-211
Author(s):  
D. Sbibih ◽  
Abdelhafid Serghini ◽  
A. Tijini ◽  
A. Zidna
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Simple Root ◽  
Newton's Method ◽  
Order Method ◽  
Numerical Examples ◽  
Quadratic Interpolation ◽  
Univariate Function ◽  
Fourth Order Method

In this paper, we describe an iterative method for approximating asimple zero $z$ of a real defined function. This method is aessentially based on the idea to extend Newton's method to be theinverse quadratic interpolation. We prove that for a sufficientlysmooth function $f$ in a neighborhood of $z$ the order of theconvergence is quartic. Using Mathematica with its high precisioncompatibility, we present some numerical examples to confirm thetheoretical results and to compare our method with the others givenin the literature.

scholarly journals Three New Optimal Fourth-Order Iterative Methods to Solve Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
Classical Method ◽  
Multiple Roots ◽  
Order Convergence ◽  
Numerical Examples ◽  
Optimal Methods

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.

Conversion between Cartesian and geodetic coordinates on a rotational ellipsoid by solving a system of nonlinear equations

2011 ◽  
Vol 60 (2) ◽  
pp. 145-159 ◽  
Author(s):  
Marcin Ligas ◽  
Piotr Banasik
Keyword(s):  
Nonlinear Equations ◽  
Newton’S Method ◽  
Newton's Method ◽  
System Of Nonlinear Equations ◽  
Order Convergence ◽  
Ellipsoidal Height ◽  
Third Order ◽  
The Third ◽  
Geodetic Coordinates ◽  
Modified Newton’S Method

Conversion between Cartesian and geodetic coordinates on a rotational ellipsoid by solving a system of nonlinear equationsA new method to transform from Cartesian to geodetic coordinates is presented. It is based on the solution of a system of nonlinear equations with respect to the coordinates of the point projected onto the ellipsoid along the normal. Newton's method and a modification of Newton's method were applied to give third-order convergence. The method developed was compared to some well known iterative techniques. All methods were tested on three ellipsoidal height ranges: namely, (-10 - 10 km) (terrestrial), (20 - 1000 km), and (1000 - 36000 km) (satellite). One iteration of the presented method, implemented with the third-order convergence modified Newton's method, is necessary to obtain a satisfactory level of accuracy for the geodetic latitude (σφ < 0.0004") and height (σh< 10-6km, i.e. less than a millimetre) for all the heights tested. The method is slightly slower than the method of Fukushima (2006) and Fukushima's (1999) fast implementation of Bowring's (1976) method.

scholarly journals A Newton Type Iterative Method with Fourth-order Convergence

2017 ◽  
Vol 12 (1) ◽  
pp. 87-95
Author(s):  
Jivandhar Jnawali
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Newton's Method ◽  
Second Order ◽  
Secant Method ◽  
Order Derivative ◽  
Single Variable ◽  
Order Convergence ◽  
Numerical Examples

The aim of this paper is to propose a fourth-order Newton type iterative method for solving nonlinear equations in a single variable. We obtained this method by combining the iterations of contra harmonic Newton’s method with secant method. The proposed method is free from second order derivative. Some numerical examples are given to illustrate the performance and to show this method’s advantage over other compared methods.Journal of the Institute of Engineering, 2016, 12 (1): 87-95

scholarly journals Eighteenth Order Convergent Method for Solving Non-Linear Equations

2017 ◽  
Vol 10 (1) ◽  
pp. 144-150 ◽  
Author(s):  
V.B Vatti ◽  
Ramadevi Sri ◽  
M.S Mylapalli
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Newton’S Method ◽  
Newton's Method ◽  
Linear Equations ◽  
Subject Classification ◽  
Order Convergence ◽  
Numerical Examples ◽  
Convergent Method ◽  
Non Linear Equations

In this paper, we suggest and discuss an iterative method for solving nonlinear equations of the type f(x)=0 having eighteenth order convergence. This new technique based on Newton’s method and extrapolated Newton’s method. This method is compared with the existing ones through some numerical examples to exhibit its superiority. AMS Subject Classification: 41A25, 65K05, 65H05.

scholarly journals Some novel Newton-type methods for solving nonlinear equations

2019 ◽  
Vol 38 (3) ◽  
pp. 111-123
Author(s):  
Morteza Bisheh-Niasar ◽  
Abbas Saadatmandi
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Basins Of Attraction ◽  
Sixth Order ◽  
New Method ◽  
Order Convergence ◽  
Cubic Convergence ◽  
Numerical Examples ◽  
Newton Iterative Method

The aim of this paper is to present a new nonstandard Newton iterative method for solving nonlinear equations. The convergence of the proposed method is proved and it is shown that the new method has cubic convergence. Furthermore, two new multi-point methods with sixth-order convergence, based on the introduced method, are presented. Also, we describe the basins of attraction for these methods. Finally, some numerical examples are given to show the performance of our methods by comparing with some other methods available in the literature

A New SPH Iterative Method for Solving Nonlinear Equations

2019 ◽  
Vol 17 (01) ◽  
pp. 1843005 ◽  
Author(s):  
Rahmatjan Imin ◽  
Ahmatjan Iminjan
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Basic Principle ◽  
Newton’S Method ◽  
Newton's Method ◽  
Quadratic Convergence ◽  
Taylor Series Expansion ◽  
Numerical Examples ◽  
First Order ◽  
Kernel Approximation

In this paper, based on the basic principle of the SPH method’s kernel approximation, a new kernel approximation was constructed to compute first-order derivative through Taylor series expansion. Derivative in Newton’s method was replaced to propose a new SPH iterative method for solving nonlinear equations. The advantage of this method is that it does not require any evaluation of derivatives, which overcame the shortcoming of Newton’s method. Quadratic convergence of new method was proved and a variety of numerical examples were given to illustrate that the method has the same computational efficiency as Newton’s method.

Sign in / Sign up

Export Citation Format

Share Document