首页> 外文期刊>Computers & mathematics with applications >Stability and convergence of semi-implicit time-stepping algorithm for stationary incompressible magnetohydrodynamics
【24h】

Stability and convergence of semi-implicit time-stepping algorithm for stationary incompressible magnetohydrodynamics

机译:平稳不可压缩磁流体动力学半隐式时步算法的稳定性和收敛性

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

For the stationary incompressible magnetohydrodynamics (MHD) equations, we provide a new uniqueness assumption (A0) and show the exponential stability of the solution. Then, the semi-implicit time-stepping algorithm is used to solve the stationary MHD equations. The algorithm is proved to be unconditionally stable. The discrete velocity and magnetic field are bounded in L-infinity(0, +infinity; L-infinity(Omega)) for any space and time step sizes. The error estimates for the algorithm are deduced under the uniqueness conditions. Finally, numerical experiments are performed to testify our theoretical analysis. (C) 2018 Elsevier Ltd. All rights reserved.
机译:对于静态不可压缩磁流体动力学(MHD)方程,我们提供了一个新的唯一性假设(A0),并显示了该解决方案的指数稳定性。然后,使用半隐式时间步长算法求解固定的MHD方程。证明该算法是无条件稳定的。对于任何空间和时间步长,离散速度和磁场都以L-无穷大(0,+无穷大; L-无穷大(Omega))为界。在唯一性条件下推导算法的误差估计。最后,进行数值实验以证明我们的理论分析。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号