Abstract
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.
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference28 articles.
1. Concise Numerical Mathematics;Plato,2003
2. Numerical Analysis;Burden,2002
3. Introduction to Numerical Analysis;Stoer,2013
4. Reduction of a nonlinear system and its numerical solution using a fractional iterative method;Torres-Hernandez;J. Math. Stat. Sci.,2020
5. Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlinear Systems
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献