Superfast solution of real positive definite toeplitz systems
SIAM Journal on Matrix Analysis and Applications
Numerical solution of the space fractional Fokker-Planck equation
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on boundary and interior layers - computational and asymptotic methods (BAIL 2002)
Finite difference approximations for fractional advection-dispersion flow equations
Journal of Computational and Applied Mathematics
Toeplitz and circulant matrices: a review
Communications and Information Theory
Numerical Approximation of a Time Dependent, Nonlinear, Space-Fractional Diffusion Equation
SIAM Journal on Numerical Analysis
Compact finite difference method for the fractional diffusion equation
Journal of Computational Physics
Finite difference approximations for two-sided space-fractional partial differential equations
Applied Numerical Mathematics
A direct O(Nlog2N) finite difference method for fractional diffusion equations
Journal of Computational Physics
Preconditioned iterative methods for fractional diffusion equation
Journal of Computational Physics
Journal of Computational Physics
Hi-index | 31.46 |
Fractional diffusion equations model phenomena exhibiting anomalous diffusion that cannot be modeled accurately by the classical second-order diffusion equations. Because of the nonlocal property of fractional differential operators, the corresponding numerical methods have full coefficient matrices which require storage of O(N^2) and computational cost of O(N^3) for a problem of size N. We develop a superfast-preconditioned conjugate gradient squared method for the efficient solution of steady-state space-fractional diffusion equations. The method reduces the computational work from O(N^2) to O(NlogN) per iteration and reduces the memory requirement from O(N^2) to O(N). Furthermore, the method significantly reduces the number of iterations to be mesh size independent. Preliminary numerical experiments for a one-dimensional steady-state diffusion equation with 2^1^3 nodes show that the fast method reduces the overall CPU time from 3h and 27min for the Gaussian elimination to 0.39s for the fast method while retaining the accuracy of Gaussian elimination. In contrast, the regular conjugate gradient squared method diverges after 2days of simulations and more than 20,000 iterations.