<p>Considering the initial singularity in the solution, we develop an accelerated tempered Alikhanov formula with a tempering parameter <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>λ</mi> </math></EquationSource> </InlineEquation> on nonuniform time grids. We study the maximum principle and energy dissipation law for the continuous tempered fractional Allen-Cahn problem. Based on this analysis, we propose a nonuniform tempered Alikhanov time-stepping scheme for the Allen-Cahn problem, in which a sum-of-exponentials (SOE) algorithm is employed to efficiently approximate the tempered Caputo fractional derivative. Spatial derivatives are discretized using a fourth-order compact finite-difference operator and efficiently implemented through a fast discrete sine transform (DST) via the FFT algorithm. The scheme satisfies a discrete maximum property and leveraging the convolution framework of the consistency error, we provide precise error estimates in maximum-norm that accurately capture the temporal smoothness of the solution. We establish a tempered analogue of the fractional Grönwall inequality and demonstrate its applicability by deriving representative convergence estimates. A dynamic time-stepping technique is also introduced to enhance long-time simulation efficiency, achieving a computational cost of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathcal {O}(MK_t \log M \log K_t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <mi>M</mi> <msub> <mi>K</mi> <mi>t</mi> </msub> <mo>log</mo> <mi>M</mi> <mo>log</mo> <msub> <mi>K</mi> <mi>t</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and memory usage of <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\mathcal {O}(M \log K_t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <mi>M</mi> <mo>log</mo> <msub> <mi>K</mi> <mi>t</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, where <i>M</i> and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(K_t\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation> are the spatial and temporal grid sizes, respectively. Furthermore, an accelerated compact ADI scheme is constructed. Numerical results confirm the accuracy of the analysis and the efficiency of the proposed algorithm, marking it as the first accelerated nonuniform tempered Alikhanov compact scheme that maintains the maximum principle for the Allen–Cahn problem.</p>

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

Nonuniform Tempered Alikhanov Scheme for Fractional Allen-Cahn Equations with Discrete Maximum Principle

  • Himanshu Kumar Dwivedi,
  • Rajeev,
  • Shengda Zeng

摘要

Considering the initial singularity in the solution, we develop an accelerated tempered Alikhanov formula with a tempering parameter \(\lambda \) λ on nonuniform time grids. We study the maximum principle and energy dissipation law for the continuous tempered fractional Allen-Cahn problem. Based on this analysis, we propose a nonuniform tempered Alikhanov time-stepping scheme for the Allen-Cahn problem, in which a sum-of-exponentials (SOE) algorithm is employed to efficiently approximate the tempered Caputo fractional derivative. Spatial derivatives are discretized using a fourth-order compact finite-difference operator and efficiently implemented through a fast discrete sine transform (DST) via the FFT algorithm. The scheme satisfies a discrete maximum property and leveraging the convolution framework of the consistency error, we provide precise error estimates in maximum-norm that accurately capture the temporal smoothness of the solution. We establish a tempered analogue of the fractional Grönwall inequality and demonstrate its applicability by deriving representative convergence estimates. A dynamic time-stepping technique is also introduced to enhance long-time simulation efficiency, achieving a computational cost of \(\mathcal {O}(MK_t \log M \log K_t)\) O ( M K t log M log K t ) and memory usage of \(\mathcal {O}(M \log K_t)\) O ( M log K t ) , where M and \(K_t\) K t are the spatial and temporal grid sizes, respectively. Furthermore, an accelerated compact ADI scheme is constructed. Numerical results confirm the accuracy of the analysis and the efficiency of the proposed algorithm, marking it as the first accelerated nonuniform tempered Alikhanov compact scheme that maintains the maximum principle for the Allen–Cahn problem.