Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems

  • Authors:
  • M. P. Calvo;C. Palencia

  • Affiliations:
  • 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

  • Venue:
  • Mathematics of Computation
  • Year:
  • 2002

Quantified Score

Hi-index 0.02

Visualization

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.