A fast numerical method for fractional partial differential equations
S. Mockary, E. Babolian, A. R. Vahidi
Advances in Difference Equations · 2019
doi:10.1186/s13662-019-2390-z (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, we use operational matrices of Chebyshev polynomials to solve fractional partial differential equations (FPDEs). We approximate the second partial derivative of the solution of linear FPDEs by operational matrices of shifted Chebyshev polynomials. We apply the operational matrix of integration and fractional integration to obtain approximations of (fractional) partial derivatives of the solution and the approximation of the solution. Then we substitute the operational matrix approximations in the FPDEs to obtain a system of linear algebraic equations. Finally, solving this system, we obtain the approximate solution. Numerical experiments show an exponential rate of convergence and hence the efficiency and effectiveness of the method.
Abstract licence: CC BY
References59
59 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.