首页> 外文期刊>Numerische Mathematik >Runge-Kutta methods without order reduction for linear initial boundary value problems
【24h】

Runge-Kutta methods without order reduction for linear initial boundary value problems

机译:不求解线性初边界值问题的Runge-Kutta方法

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

摘要

It is well-known the loss of accuracy when a Runge-Kutta method is used together with the method of lines for the full discretization of an initial boundary value problem. We show that this phenomenon, called order reduction, is caused by wrong boundary values in intermediate stages. With a right choice, the order reduction can be avoided and the optimal order of convergence in time is achieved. We prove this fact for time discretizations of abstract initial boundary value problems based on implicit, Runge-Kutta methods. Moreover, we apply these results to the full discretization of parabolic problems by means of Galerkin finite element techniques. We present some numerical examples in order to confirm that the optimal order is actually achieved. [References: 32]
机译:众所周知,当将Runge-Kutta方法与线方法一起用于初始边界值问题的完全离散化时,准确性会下降。我们证明了这种现象,称为阶数减少,是由中间阶段中错误的边界值引起的。如果选择正确,则可以避免阶数减少,并且可以实现时间收敛的最佳顺序。我们证明了这一事实,适用于基于隐式,Runge-Kutta方法的抽象初始边值问题的时间离散化。此外,我们将这些结果通过Galerkin有限元技术应用于抛物线问题的完全离散化。我们提供一些数值示例,以确认最佳顺序实际上已实现。 [参考:32]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号