2016
DOI: 10.1016/j.jcp.2016.05.021
|View full text |Cite
|
Sign up to set email alerts
|

Preconditioned iterative methods for space-time fractional advection-diffusion equations

Abstract: In this paper we want to propose practical numerical methods to solve a class of initial-boundary problem of space-time fractional advection-diffusion equations. To start with, an implicit method based on two-sided Grünwald formulae is proposed with a discussion of the stability and consistency. Then, the preconditioned generalized minimal residual (preconditioned GMRES) method and the preconditioned conjugate gradient normal residual (preconditioned CGNR) method, with an easily constructed preconditioner, are… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
28
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(28 citation statements)
references
References 35 publications
0
28
0
Order By: Relevance
“…These motivated us to study (1.1)–(1.2) in numerical way. A lot of researches have proposed different efficient numerical methods to study time fractional differential equations, in which the time fractional derivatives are usually modelled in Caputo's sense, interested readers can refer to and the references therein. There are many favorable approximations for the Caputo fractional derivative, here we review several researches which provide some recent progress related to our work.…”
Section: Introductionmentioning
confidence: 99%
“…These motivated us to study (1.1)–(1.2) in numerical way. A lot of researches have proposed different efficient numerical methods to study time fractional differential equations, in which the time fractional derivatives are usually modelled in Caputo's sense, interested readers can refer to and the references therein. There are many favorable approximations for the Caputo fractional derivative, here we review several researches which provide some recent progress related to our work.…”
Section: Introductionmentioning
confidence: 99%
“…It was discovered that the stiffness matrices of the numerical discretizations of constant-order sFDEs on a uniform partition typically possess a Toeplitz-like structure [32], which reduces the memory requirement from O(N 2 ) to O(N ) and computational complexity from O(N 3 ) to O(N log N ) per Krylov subspace iteration via the discrete fast Fourier transform. Furthermore, different preconditioners were employed to futher improve the computational efficiency and even convergence behavior [1,5,14,19,20,21,25,31,34].…”
mentioning
confidence: 99%
“…[2,3]). The order (n − 1 < < n) left and right Riemann-Liouville (R-L) fractional derivatives of the function g(t) on [0, T] are defined as i left R-L fractional derivative: 0 t g(t) s) −n+1 ds;…”
mentioning
confidence: 99%