首页> 外文期刊>Journal of Scientific Computing >Optimal Point-Wise Error Estimate of a Compact Difference Scheme for the Coupled Gross-Pitaevskii Equations in One Dimension
【24h】

Optimal Point-Wise Error Estimate of a Compact Difference Scheme for the Coupled Gross-Pitaevskii Equations in One Dimension

机译:一维Gross-Pitaevskii方程紧致差分格式的最佳逐点误差估计

获取原文
获取原文并翻译 | 示例
       

摘要

The coupled Gross-Pitaevskii (CGP) equation studied in this paper is an important mathematical model describing two-component Bose-Einstein condensate with an internal atomic Josephson junction. We here analyze a compact finite difference scheme which conserves the total mass and energy in the discrete level for the CGP equation. In general, due to the difficulty caused by compact difference on nonlinear terms, optimal point-wise error estimates without any restrictions on the grid ratios of compact difference schemes for nonlinear partial differential equations are very hard to be established. To overcome the difficulty caused by the compact difference operator, we introduce a new norm and an interesting transformation by which the difference scheme is transformed into a special equivalent vector form, we then use the energy method and some important lemmas on the equivalent system to obtain the optimal convergent rate, without any restrictions on the grid ratio, at the order of O(h~4 + τ~2) in the maximum norm with time step r and mesh size h. Finally, numerical results are reported to test the theoretical results and simulate the dynamics of the CGP equation.
机译:本文中研究的耦合总Gross-Pitaevskii(CGP)方程是一个重要的数学模型,描述了具有内部原子约瑟夫森结的两组分玻色-爱因斯坦凝聚物。我们在这里分析一个紧凑的有限差分方案,该方案在CGP方程的离散级中节省了总质量和能量。通常,由于非线性项上的紧致差分所带来的困难,很难建立对非线性偏微分方程的紧致差分格式的网格比没有任何限制的最优逐点误差估计。为了克服紧致差分算子带来的困难,我们引入了一个新的范数和一个有趣的变换,将差分方案转换为一个特殊的等价矢量形式,然后在等价系统上使用能量方法和一些重要引理来获得最优收敛速度,对网格比率没有任何限制,在最大范数下为O(h〜4 +τ〜2),随时间步长r和网格大小h。最后,报告了数值结果以测试理论结果并模拟CGP方程的动力学。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号