scholarly journals Fractional Newton–Raphson Method Accelerated with Aitken’s Method

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 47
Author(s):  
A. Torres-Hernandez ◽  
F. Brambila-Paz ◽  
U. Iturrarán-Viveros ◽  
R. Caballero-Cruz

In the following paper, we present a way to accelerate the speed of convergence of the fractional Newton–Raphson (F N–R) method, which seems to have an order of convergence at least linearly for the case in which the order α of the derivative is different from one. A simplified way of constructing the Riemann–Liouville (R–L) fractional operators, fractional integral and fractional derivative is presented along with examples of its application on different functions. Furthermore, an introduction to Aitken’s method is made and it is explained why it has the ability to accelerate the convergence of the iterative methods, in order to finally present the results that were obtained when implementing Aitken’s method in the F N–R method, where it is shown that F N–R with Aitken’s method converges faster than the simple F N–R.

2021 ◽  
Vol 23 (07) ◽  
pp. 858-866
Author(s):  
Gauri Thakur ◽  
◽  
J.K. Saini ◽  

In numerical analysis, methods for finding roots play a pivotal role in the field of many real and practical applications. The efficiency of numerical methods depends upon the convergence rate (how fast the particular method converges). The objective of this study is to compare the Bisection method, Newton-Raphson method, and False Position Method with their limitations and also analyze them to know which of them is more preferred. Limitations of these methods have allowed presenting the latest research in the area of iterative processes for solving non-linear equations. This paper analyzes the field of iterative methods which are developed in recent years with their future scope.


2020 ◽  
Vol 12 (6) ◽  
pp. 50
Author(s):  
Christian Vanhille

We propose an iterative method to evaluate the roots of nonlinear equations. This Secant-based technique approximates the derivatives of the function numerically through a constant discretization step h disassociated from the iterative progression. The algorithm is developed, implemented, and tested. Its order of convergence is found to be h-dependent. The results obtained corroborate the theoretical deductions and evidence its excellent behavior. For infinitesimal h-values, the algorithm accelerates the convergence of the Secant method to order 2 (the one of the Newton-Raphson method) with no need for analytic expression of derivatives (the advantage of the Secant method).


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Mohammed Al-Refai

AbstractIn this paper, we define the weighted Atangana–Baleanu fractional operators of Caputo sense. We obtain the solution of a related linear fractional differential equation in a closed form, and use the result to define the weighted Atangana–Baleanu fractional integral. We then express the weighted Atangana–Baleanu fractional derivative in a convergent series of Riemann–Liouville fractional integrals, and establish commutative results of the weighted Atangana–Baleanu fractional operators.


Author(s):  
Dr. Roopa K M ◽  
◽  
Venkatesha P ◽  

The aim of this article is to present a brief review and a numerical comparison of iterative methods applied to solve the polynomial equations with real coefficients. In this paper, four numerical methods are compared, namely: Horner’s method, Synthetic division with Chebyshev method (Proposed Method), Synthetic division with Modified Newton Raphson method and Birge-Vieta method which will helpful to the readers to understand the importance and usefulness of these methods.


Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1058
Author(s):  
Leonid Moroz ◽  
Volodymyr Samotyy ◽  
Cezary J. Walczyk ◽  
Jan L. Cieśliński

We develop a bit manipulation technique for single precision floating point numbers which leads to new algorithms for fast computation of the cube root and inverse cube root. It uses the modified iterative Newton–Raphson method (the first order of convergence) and Householder method (the second order of convergence) to increase the accuracy of the results. The proposed algorithms demonstrate high efficiency and reduce error several times in the first iteration in comparison with known algorithms. After two iterations 22.84 correct bits were obtained for single precision. Experimental tests showed that our novel algorithm is faster and more accurate than library functions for microcontrollers.


1952 ◽  
Vol 48 (2) ◽  
pp. 255-270 ◽  
Author(s):  
R. A. Brooker

AbstractThis paper is an account of the methods that have been used with the EDSAC for the solution of algebraic equations. Three repetitive or iterative methods are examined: Bernoulli's method, the root-squaring method, and the Newton-Raphson method. Experience with the EDSAC has shown that, as in hand computing, quadratically convergent methods are to be preferred to those less rapidly convergent. In particular, the Newton-Raphson method has proved the most useful. Several examples are given in the appendix.


2010 ◽  
Vol 7 ◽  
pp. 182-190
Author(s):  
I.Sh. Nasibullayev ◽  
E.Sh. Nasibullaeva

In this paper the investigation of the axisymmetric flow of a liquid with a boundary perpendicular to the flow is considered. Analytical equations are derived for the radial and axial velocity and pressure components of fluid flow in a pipe of finite length with a movable right boundary, and boundary conditions on the moving boundary are also defined. A numerical solution of the problem on a finite-difference grid by the iterative Newton-Raphson method for various velocities of the boundary motion is obtained.


1983 ◽  
Vol 23 (05) ◽  
pp. 727-742 ◽  
Author(s):  
Larry C. Young ◽  
Robert E. Stephenson

A procedure for solving compositional model equations is described. The procedure is based on the Newton Raphson iteration method. The equations and unknowns in the algorithm are ordered in such a way that different fluid property correlations can be accommodated leadily. Three different correlations have been implemented with the method. These include simplified correlations as well as a Redlich-Kwong equation of state (EOS). The example problems considered area conventional waterflood problem,displacement of oil by CO, andthe displacement of a gas condensate by nitrogen. These examples illustrate the utility of the different fluid-property correlations. The computing times reported are at least as low as for other methods that are specialized for a narrower class of problems. Introduction Black-oil models are used to study conventional recovery techniques in reservoirs for which fluid properties can be expressed as a function of pressure and bubble-point pressure. Compositional models are used when either the pressure. Compositional models are used when either the in-place or injected fluid causes fluid properties to be dependent on composition also. Examples of problems generally requiring compositional models are primary production or injection processes (such as primary production or injection processes (such as nitrogen injection) into gas condensate and volatile oil reservoirs and (2) enhanced recovery from oil reservoirs by CO or enriched gas injection. With deeper drilling, the frequency of gas condensate and volatile oil reservoir discoveries is increasing. The drive to increase domestic oil production has increased the importance of enhanced recovery by gas injection. These two factors suggest an increased need for compositional reservoir modeling. Conventional reservoir modeling is also likely to remain important for some time. In the past, two separate simulators have been developed and maintained for studying these two classes of problems. This result was dictated by the fact that compositional models have generally required substantially greater computing time than black-oil models. This paper describes a compositional modeling approach paper describes a compositional modeling approach useful for simulating both black-oil and compositional problems. The approach is based on the use of explicit problems. The approach is based on the use of explicit flow coefficients. For compositional modeling, two basic methods of solution have been proposed. We call these methods "Newton-Raphson" and "non-Newton-Raphson" methods. These methods differ in the manner in which a pressure equation is formed. In the Newton-Raphson method the iterative technique specifies how the pressure equation is formed. In the non-Newton-Raphson method, the composition dependence of certain ten-ns is neglected to form the pressure equation. With the non-Newton-Raphson pressure equation. With the non-Newton-Raphson methods, three to eight iterations have been reported per time step. Our experience with the Newton-Raphson method indicates that one to three iterations per tune step normally is sufficient. In the present study a Newton-Raphson iteration sequence is used. The calculations are organized in a manner which is both efficient and for which different fluid property descriptions can be accommodated readily. Early compositional simulators were based on K-values that were expressed as a function of pressure and convergence pressure. A number of potential difficulties are inherent in this approach. More recently, cubic equations of state such as the Redlich-Kwong, or Peng-Robinson appear to be more popular for the correlation Peng-Robinson appear to be more popular for the correlation of fluid properties. SPEJ p. 727


Sign in / Sign up

Export Citation Format

Share Document