Fast o(N) hybrid laplace transform-finite difference method in solving 2d time fractional diffusion equation

Fouad Mohammad Salama*, Norhashidah Hj Mohd Ali, Nur Nadiah Abd Hamid

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

It is time-memory consuming when numerically solving time fractional partial differential equations, as it requires O(N2) computational cost and O(MN) memory complexity with finite difference methods, where, N and M are the total number of time steps and spatial grid points, respectively. To surmount this issue, we develop an efficient hybrid method with O(N) computational cost and O(M) memory complexity in solving two-dimensional time fractional diffusion equation. The presented method is based on the Laplace transform method and a finite difference scheme. The stability and convergence of the proposed method are analyzed rigorously by the means of the Fourier method. A comparative study drawn from numerical experiments shows that the hybrid method is accurate and reduces the computational cost, memory requirement as well as the CPU time effectively compared to a standard finite difference scheme.

Original languageEnglish
Pages (from-to)110-123
Number of pages14
JournalJournal of Mathematics and Computer Science
Volume23
Issue number2
DOIs
StatePublished - 2020
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2020, International Scientific Research Publications. All rights reserved.

Keywords

  • Caputo fractional derivative
  • Finite difference scheme
  • Fractional diffusion equation
  • Laplace transform
  • Stability and convergence analyses

ASJC Scopus subject areas

  • Computational Mechanics
  • General Mathematics
  • Computer Science Applications
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Fast o(N) hybrid laplace transform-finite difference method in solving 2d time fractional diffusion equation'. Together they form a unique fingerprint.

Cite this