arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.00309math.NAcs.NA
收藏

基于TT-M FE系统的快速算法用于带有光滑和非光滑解的空间分数阶Allen-Cahn方程

Fast algorithm based on TT-M FE system for space fractional Allen-Cahn equations with smooth and non-smooth solutions

School of Mathematical Sciences, Inner Mongolia University(内蒙古大学数学科学学院)

Baoli Yin, Yang Liu, Hong Li, Siriguleng He

AI总结:

本文提出了一种基于时间双网格(TT-M)有限元(FE)方案的快速算法,用于快速求解具有光滑和非光滑解的非线性空间分数阶Allen-Cahn方程。该算法在时间方向采用隐式二阶θ方案,结合隐式Crank-Nicolson方案和二阶后向差分法,在空间方向采用有限元方法进行逼近,并通过TT-M方法提高计算速度。通过详细分析稳定性及先验误差估计,最后通过三个具有光滑和非光滑解的数值实验展示了该算法在求解非线性偏微分方程中的计算效率,证明了计算时间的节省。

摘要:

本文提出了一种基于时间双网格(TT-M)有限元(FE)方案的快速算法,用于快速求解非线性空间分数阶Allen-Cahn方程。该算法在时间方向采用隐式二阶θ方案,结合隐式Crank-Nicolson方案和二阶后向差分法,在空间方向采用有限元方法进行逼近,并通过TT-M方法提高计算速度。该TT-M FE算法主要包括以下主要计算步骤:首先,在时间粗网格τ_c上使用非线性迭代方法求解非线性隐式二阶θ FE方案;其次,基于所选的初始迭代值,在时间细网格τ<τ_c上求解线性化FE系统,其中通过拉格朗日插值公式找到一些有用的粗数值解。详细分析了稳定性和先验误差估计。最后,提供了三个具有光滑和非光滑解的数值实验,以展示该算法在求解非线性偏微分方程中的计算效率,从而发现计算时间可以得到节省。

英文摘要:

In this article, a fast algorithm based on time two-mesh (TT-M) finite element (FE) scheme, which aims at solving nonlinear problems quickly, is considered to numerically solve the nonlinear space fractional Allen-Cahn equations with smooth and non-smooth solutions. The implicit second-order $θ$ scheme containing both implicit Crank-Nicolson scheme and second-order backward difference method is applied to time direction, a fast TT-M method is used to increase the speed of calculation, and the FE method is developed to approximate the spacial direction. The TT-M FE algorithm includes the following main computing steps: firstly, a nonlinear implicit second-order $θ$ FE scheme on the time coarse mesh $τ_c$ is solved by a nonlinear iterative method; secondly, based on the chosen initial iterative value, a linearized FE system on time fine mesh $τ<τ_c$ is solved, where some useful coarse numerical solutions are found by the Lagrange's interpolation formula. The analysis for both stability and a priori error estimates are made in detail. Finally, three numerical examples with smooth and non-smooth solutions are provided to illustrate the computational efficiency in solving nonlinear partial differential equations, from which it is easy to find that the computing time can be saved.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑