2015
DOI: 10.1016/j.aml.2014.11.005
|View full text |Cite
|
Sign up to set email alerts
|

Onk-step CSCS-based polynomial preconditioners for Toeplitz linear systems with application to fractional diffusion equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
10

Relationship

6
4

Authors

Journals

citations
Cited by 23 publications
(12 citation statements)
references
References 19 publications
0
12
0
Order By: Relevance
“…The conventional time-stepping schemes utilizing the Gaussian elimination require the computational cost of O(N 3 ) and storage of O(N 2 ) at each time step, where N is the spatial grid number. For the purpose of optimizing the computational complexity, numerous fast algorithms [6,8,15,[17][18][19][20][21] are designed.…”
Section: Introductionmentioning
confidence: 99%
“…The conventional time-stepping schemes utilizing the Gaussian elimination require the computational cost of O(N 3 ) and storage of O(N 2 ) at each time step, where N is the spatial grid number. For the purpose of optimizing the computational complexity, numerous fast algorithms [6,8,15,[17][18][19][20][21] are designed.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, we show that the discretizations of TDFDEs lead to a nonsymmetric Toeplitz-like system of linear equations. The linear system can be solved efficiently by using Krylov subspace methods with suitable circulant preconditioners [52][53][54]. It can greatly reduce the memory and computational costs; the memory requirement and computational complexity are only O(M) and O(M log M) in each iteration step, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Fast methods Lei and Sun ( 2013 ), Popolizio ( 2015 ), Gu et al. ( 2015 , 2015 ) have been developed to solve FDEs with the shifted Grünwald formula. Wang and Wang ( 2011 ) proposed a conjugate gradient normal residual (CGNR) to solve the discretized system by Meerschact and Tadjeran’s method with the computational cost of .…”
Section: Introductionmentioning
confidence: 99%