No 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.

No abstract

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n, with n ∈ N. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In the present work, we explain an iterative method that is created using the fractional calculus, which we will call the Fractional Newton-Raphson (F N-R) Method, which has the ability to enter the space of complex numbers given a real initial condition, which allows us to find both the real and complex roots of a polynomial unlike the classical Newton-Raphson method.

No abstract