DOE OSTI · 2584433
Explicit Runge–Kutta Methods that Alleviate Order Reduction
Abstract
Explicit Runge–Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to an 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. Furthermore, 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Biswas, Abhijit [King Abdullah University of Science and Technology, Thuwal (Saudi Arabia)], Ketcheson, David I. [King Abdullah University of Science and Technology, Thuwal (Saudi Arabia)] (ORCID:000000021212126X), Roberts, Steven [Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)] (ORCID:0000000272252501), Seibold, Benjamin [Temple University, Philadelphia, PA (United States)] (ORCID:0000000328796402), Shirokoff, David [New Jersey Institute of Technology, Newark, NJ (United States)]. 2025-07-08. Explicit Runge–Kutta Methods that Alleviate Order Reduction. https://doi.org/10.1137/23m1606812
Cite the original work for its findings. Save a collection to share your selection of sources.