A fast O(N log N) finite difference method for the one-dimensional space-fractional diffusion equation

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes an approach for the space-fractional diffusion equation in one dimension. Since fractional differential operators are non-local, two main difficulties arise after discretization and solving using Gaussian elimination: how to handle the memory requirement of O(N2) for storing the dense or even full matrices that arise from application of numerical methods and how to manage the significant computational work count of O(N3) per time step, where N is the number of spatial grid points. In this paper, a fast iterative finite difference method is developed, which has a memory requirement of O(N) and a computational cost of O(N logN) per iteration. Finally, some numerical results are shown to verify the accuracy and efficiency of the new method.

References Powered by Scopus

Get full text
1299Citations
174Readers

This article is free to access.

Toeplitz and circulant matrices: A review

1140Citations
1385Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Basu, T. (2015). A fast O(N log N) finite difference method for the one-dimensional space-fractional diffusion equation. Mathematics, 3(4), 1032–1044. https://doi.org/10.3390/math3041032

Readers over time

‘17‘18‘2100.751.52.253

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

40%

Professor / Associate Prof. 1

20%

Lecturer / Post doc 1

20%

Researcher 1

20%

Readers' Discipline

Tooltip

Physics and Astronomy 3

60%

Mathematics 2

40%

Save time finding and organizing research with Mendeley

Sign up for free
0