In this paper, we consider an approximation of the Caputo fractional derivative and its asymptotic expansion formula, whose generating function is the polylogarithm function. We prove the convergence of the approximation and derive an estimate for the error and order. The approximation is applied for the construction of finite difference schemes for the two-term ordinary fractional differential equation and the time fractional Black–Scholes equation for option pricing. The properties of the approximation are used to prove the convergence and order of the finite difference schemes and to obtain bounds for the error of the numerical methods. The theoretical results for the order and error of the methods are illustrated by the results of the numerical experiments.

The fractional derivatives are a generalization the derivatives of integer order and find applications in studying memory processes in various scientific fields. Numerical methods are used to solve and analyze fractional models of real world problems. In this paper, we consider an approximation of the Caputo fractional derivative and its asymptotic formula, whose generating function is the polylogarithmic function. In the paper, we prove the convergence of the approximation and derive an estimate for the error and order. We consider an application of the approximation for the construction of finite difference schemes for numerical solution of the two-term ordinary fractional differential equation and the time-fractional Black-Scholes equation for option pricing. The properties of the approximation are used to prove the convergence of the methods used for numerical solution of the fractional differential equations. The theoretical results for the error and order of the methods are illustrated by the results of numerical experiments.

In this paper, we consider constructions of first derivative approximations using the generating function. The weights of the approximations contain the powers of a parameter whose modulus is less than one. The values of the initial weights are determined, and the convergence and order of the approximations are proved. The paper discusses applications of approximations of the first derivative for the numerical solution of ordinary and partial differential equations and proposes an algorithm for fast computation of the numerical solution. Proofs of the convergence and accuracy of the numerical solutions are presented and the performance of the numerical methods considered is compared with the Euler method. The main goal of constructing approximations for integer-order derivatives of this type is their application in deriving high-order approximations for fractional derivatives, whose weights have specific properties. The paper proposes the construction of an approximation for the fractional derivative and its application for numerically solving fractional differential equations. The theoretical results for the accuracy and order of the numerical methods are confirmed by the experimental results presented in the paper.