A second-order accurate numerical scheme for a time-fractional Fokker-Planck equation

Kassem Mustapha*, Omar M. Knio, Olivier P. Le Maître

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A second-order accurate time-stepping scheme for solving a time-fractional Fokker-Planck equation of order α ∈ (0,1), with a general driving force, is investigated. A stability bound for the semidiscrete solution is obtained for α ∈ (1/2, 1) via a novel and concise approach. Our stability estimate is -robust in the sense that it remains valid in the limiting case where α approaches 1 (when the model reduces to the classical Fokker-Planck equation), a limit that presents practical importance. Concerning the error analysis, we obtain an optimal second-order accurate estimate for α ∈ (1/2, 1). A time-graded mesh is used to compensate for the singular behavior of the continuous solution near the origin. The time-stepping scheme scheme is associated with a standard spatial Galerkin finite element discretization to numerically support our theoretical contributions. We employ the resulting fully discrete computable numerical scheme to perform some numerical tests. These tests suggest that the imposed time-graded meshes assumption could be further relaxed, and we observe second-order accuracy even for the case α ∈ (1/2, 1), that is, outside the range covered by the theory.

Original languageEnglish (US)
Pages (from-to)2115-2136
Number of pages22
JournalIMA Journal of Numerical Analysis
Volume43
Issue number4
DOIs
StatePublished - Jul 1 2023

Keywords

  • finite elements
  • fractional Fokker-Planck
  • graded meshes
  • stability and error analysis
  • time discretizations

ASJC Scopus subject areas

  • General Mathematics
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A second-order accurate numerical scheme for a time-fractional Fokker-Planck equation'. Together they form a unique fingerprint.

Cite this