2017
DOI: 10.1002/nla.2132
|View full text |Cite
|
Sign up to set email alerts
|

Approximate inversion method for time‐fractional subdiffusion equations

Abstract: The finite-difference method applied to the time-fractional subdiffusion equation usually leads to a large-scale linear system with a block lower triangular Toeplitz coefficient matrix. The approximate inversion method is employed to solve this system. A sufficient condition is proved to guarantee the high accuracy of the approximate inversion method for solving the block lower triangular Toeplitz systems, which are easy to verify in practice and have a wide range of applications. The applications of this suff… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 24 publications
0
10
0
Order By: Relevance
“…The fractional derivative denoted by D is introduced in Caputo sense. 11,18,49,50 In addition, we suppose that the function g and functions 0 and 1 are such that the problems have a unique solution.…”
Section: Problem Statementmentioning
confidence: 99%
See 1 more Smart Citation
“…The fractional derivative denoted by D is introduced in Caputo sense. 11,18,49,50 In addition, we suppose that the function g and functions 0 and 1 are such that the problems have a unique solution.…”
Section: Problem Statementmentioning
confidence: 99%
“…Problem Dtνufalse(x,tfalse)=F()ufalse(x,tfalse),ξufalse(x,tfalse),,sξsufalse(x,tfalse),ufalse(xτ0,tτ0false),,ufalse(xτr,tτrfalse), l1<νl,x[0,h1],t[0,h2], with the supplementary conditions, alignleftalign-1u(x,t)align-2=g(x,t),x[τ0,0],t[τ0,0],align-1u(0,t)align-2=ϕ0(t),u(h1,t)=ϕ1(t),0<th2, where τ r >…> τ 0 >0 is the delay parameter, p i , q i ∈(0,1], i =0,1,…, l and F is an analytical function. The fractional derivative denoted by D ν is introduced in Caputo sense . In addition, we suppose that the function g and functions ϕ 0 and ϕ 1 are such that the problems have a unique solution....…”
Section: Introductionmentioning
confidence: 99%
“…In consequence of the nonlocal property and historical dependence of the fractional operators, the aforementioned numerical methods always require all previous function values, which leads to an average O(n) storage and computational cost O(n 2 ), where n is the total number of the time levels. To overcome this difficulty, many efforts have been made to speed up the evaluation of the CO fractional derivative [2,4,14,17,18,[23][24][25]42]. Nevertheless, the coefficient matrices of the numerical schemes for the VO fractional problems lose the Toeplitz-like structure and the VO fractional derivative is no longer a convolution operator.…”
Section: Introductionmentioning
confidence: 99%
“…Because of this, before solving the linear system ( 1 To remedy the situation, fast kernel compression methods are proposed in [2,12,17,26] Besides the time-stepping method, PinT method is another type of popular methods for (1.5), which solves {ũ n |n = 1, 2, ..., N } in a parallel way. In [9,20,24,25], PinT algorithms are developed by employing a fast diagonalizable approximation to T in the all-at-once system (1.6). The so approximated all-at-once system is block diagonalizable with each eigen-block corresponding to a complex scalar shifted spatial system.…”
Section: Introductionmentioning
confidence: 99%