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.
31 March 2020 in Applied Mathematics and Sciences An International Journal (MathSJ)
Considering the large number of fractional operators that exist, and since it does not seem that their number will stop increasing soon at the time of writing this paper, it is presented for the first time, as far as the authors know, a simple and compact method to work the fractional calculus through the classification of fractional operators using sets. This new method of working with fractional operators, which may be called fractional calculus of sets, allows generalizing objects of conventional calculus, such as tensor operators, the Taylor series of a vector-valued function, and the fixed-point method, in several variables, which allows generating the method known as the fractional fixed-point method. Furthermore, it is also shown that each fractional fixed-point method that generates a convergent sequence has the ability to generate an uncountable family of fractional fixed-point methods that generate convergent sequences. So, it is presented a method to estimate numerically in a region the mean order of convergence of any fractional fixed-point method, and it is shown how to construct a hybrid fractional iterative method to determine the critical points of a scalar function. Finally, considering that the proposed method to classify fractional operators through sets allows generalizing the existing results of the fractional calculus, some examples are shown of how to define families of fractional operators that satisfy some property to ensure the validity of the results to be generalized.
In this paper an approximation to the zeros of the Riemann zeta function has been obtained for the first time using a fractional iterative method which originates from a unique feature of the fractional calculus. This iterative method, valid for one and several variables, uses the property that the fractional derivative of constants are not always zero. This allows us to construct a fractional iterative method to find the zeros of functions in which it is possible to avoid expressions that involve hypergeometric functions, Mittag-Leffler functions or infinite series. Furthermore, we can find multiple zeros of a function using a singe initial condition. This partially solves the intrinsic problem of iterative methods, which in general is necessary to provide N initial conditions to find N solutions. Consequently the method is suitable for approximating nontrivial zeros of the Riemann zeta function when the absolute value of its imaginary part tends to infinity. Some examples of its implementation are presented, and finally 53 different values near to the zeros of the Riemann zeta function are shown.