Search arXivSearch

arXiv · 2607.06788

On the order of Runge Kutta methods reusing last stage

Abstract

In this paper we consider explicit Runge--Kutta (RK) methods for the numerical solution of Initial Value Problems (IVPs) in differential equations in which the last function evaluation in a step is reused, substituting the first evaluation for the next step. This requirement implies that, except for the first step, the computational cost of an $s$--stage explicit RK method reduces from $s$ to $(s-1)$ function evaluations per step. It will be seen that, in general, if a RK method has order $p$, when introducing this reused stage the new method has in general order $<p$. In this context we study the conditions on the coefficients of an explicit RK method with order $p$ such that the global error of the method reusing the last stage has the same order $p$ of accuracy. A detailed study on the conditions that the coefficients of an $s$ stage method with order $p$ must satisfy for the method reusing the last stage has also order $p$. In particular, for the families of $s$--stage explicit RK methods with the highest order $p=s$ we identify those methods reusing the last stage which retain the order of of the original method. The results of some numerical experiments are presented to confirm the theoretical results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Calvo, Juan I. Montijano, Luis Rández. 2026-07-07. On the order of Runge Kutta methods reusing last stage. https://arxiv.org/abs/2607.06788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA