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

一个用于分数吉布斯-兰道方程的隐式中点差分方案

An implicit midpoint difference scheme for the fractional Ginzburg-Landau equation

School of Mathematics and Statistics, Huazhong University of Science and Technology(华中科技大学数学与统计学院)

Pengde Wang, Chengming Huang

AI总结:

本文提出并分析了求解非线性复吉布斯-兰道方程的高效差分方案,采用隐式中点规则和加权移位Grünwald差分算子,建立适用于分数Sobolev范数的不等式,证明数值解在$l^2_h$范数下以$O(τ^2+h^2)$收敛,且无条件成立。

摘要:

本文提出并分析了一个高效的差分方案,用于求解非线性复吉布斯-兰道方程,该方程包含分数拉普拉斯算子。该方案基于隐式中点规则进行时间离散化,并使用加权和移位的Grünwald差分算子处理空间分数拉普拉斯算子。通过仔细分析差分算子,建立了适用于适当分数Sobolev范数的有用不等式。然后证明数值解有界,并在$l^2_h$范数下以最优阶$O(τ^2+h^2)$收敛,时间步长$τ$和网格尺寸$h$无需受限制。先验界和收敛阶无条件成立。数值测试用于验证理论结果和方案的有效性。

英文摘要:

This paper proposes and analyzes an efficient difference scheme for the nonlinear complex Ginzburg-Landau equation involving fractional Laplacian. The scheme is based on the implicit midpoint rule for the temporal discretization and a weighted and shifted Grünwald difference operator for the spatial fractional Laplacian. By virtue of a careful analysis of the difference operator, some useful inequalities with respect to suitable fractional Sobolev norms are established. Then the numerical solution is shown to be bounded, and convergent in the $l^2_h$ norm with the optimal order $O(τ^2+h^2)$ with time step $τ$ and mesh size $h$. The a priori bound as well as the convergence order hold unconditionally, in the sense that no restriction on the time step $τ$ in terms of the mesh size $h$ needs to be assumed. Numerical tests are performed to validate the theoretical results and effectiveness of the scheme.

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

↑