<p>In this paper, the time fractional mobile/immobile diffusion equation with the weak singular solution at the initial time is studied. The averaged L1 finite difference scheme is established for the equation. The stability of the numerical scheme is analyzed by the Fourier analysis method. The convergence order of the scheme is <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(O(\tau ^2|\ln \tau |+h^2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mi>τ</mi> <mn>2</mn> </msup> <mo stretchy="false">|</mo> <mo>ln</mo> <mi>τ</mi> <mo stretchy="false">|</mo> <mo>+</mo> <msup> <mi>h</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\tau \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>τ</mi> </math></EquationSource> </InlineEquation> and <i>h</i> are the sizes of the time and space steps, respectively. In addition, due to the historical dependence of the time fractional derivative, we establish a fast method based on the exponential-sum-approximation, effectively reducing computation and storage. Furthermore, we provide an error estimate of the fast algorithm. Finally, a numerical experiment verifies the effectiveness of the algorithm.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Fast Averaged L1 Finite Difference Method for Time Fractional Mobile/Immobile Diffusion Equation with Weakly Singular Solution

  • Haili Qiao,
  • Aijie Cheng

摘要

In this paper, the time fractional mobile/immobile diffusion equation with the weak singular solution at the initial time is studied. The averaged L1 finite difference scheme is established for the equation. The stability of the numerical scheme is analyzed by the Fourier analysis method. The convergence order of the scheme is \(O(\tau ^2|\ln \tau |+h^2)\) O ( τ 2 | ln τ | + h 2 ) , where \(\tau \) τ and h are the sizes of the time and space steps, respectively. In addition, due to the historical dependence of the time fractional derivative, we establish a fast method based on the exponential-sum-approximation, effectively reducing computation and storage. Furthermore, we provide an error estimate of the fast algorithm. Finally, a numerical experiment verifies the effectiveness of the algorithm.