Explicit Runge Kutta Methods that Alleviate Order Reduction
Numerical Analysis
2026-02-11 v2 Numerical Analysis
Abstract
Explicit Runge--Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to initial-boundary value problem with time-dependent boundary conditions. We study conditions on explicit RK methods that guarantee high-order convergence for linear problems; we refer to these conditions as weak stage order conditions. We prove a general relationship between the method's order, weak stage order, and number of stages. We derive explicit RK methods with high weak stage order and demonstrate, through numerical tests, that they avoid the order reduction phenomenon up to any order for linear problems and up to order three for nonlinear problems.
Keywords
Cite
@article{arxiv.2310.02817,
title = {Explicit Runge Kutta Methods that Alleviate Order Reduction},
author = {Abhijit Biswas and David I. Ketcheson and Steven Roberts and Benjamin Seibold and David Shirokoff},
journal= {arXiv preprint arXiv:2310.02817},
year = {2026}
}