首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Authors:M P Calvo  C Palencia
Institution:Departamento de Matemática Aplicada y Computación, Universidad de Valladolid, Valladolid, Spain ; Departamento de Matemática Aplicada y Computación, Universidad de Valladolid, Valladolid, Spain
Abstract:A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The solution is decomposed into two parts. One of them can be computed directly in terms of the data and the other satisfies an initial value problem without any order reduction. A numerical illustration is given. This idea applies to practical problems, where spatial discretization is also required, leading to the full order both in space and time.

Keywords:Abstract initial boundary value problems  Runge-Kutta  order reduction
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号