Related papers: Generalized explicit pseudo two-step Runge-Kutta-N…
The Runge--Kutta (RK) discontinuous Galerkin (DG) method is a mainstream numerical algorithm for solving hyperbolic equations. In this paper, we use the linear advection equation in one and two dimensions as a model problem to prove the…
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of (non-necessarily Hamiltonian) ordinary differential equations by means of Newton-like iterations. We pay particular…
In recent years, many positivity-preserving schemes for initial value problems have been constructed by modifying a Runge--Kutta (RK) method by weighting the right-hand side of the system of differential equations with solution-dependent…
Among the family of fourth-order time integration schemes, the two-stage Gauss--Legendre method, which is an implicit Runge--Kutta method based on collocation, is the only superconvergent. The computational cost of this implicit scheme for…
Optimal Strong Stability Preserving (SSP) Runge--Kutta methods has been widely investegated in the last decade and many open conjectures have been formulated. The iterated implicit midpoint rule has been observed numerically optimal in…
Constructing explicit Runge--Kutta (ERK) methods with as few stages as possible for a given order is a classical problem in numerical analysis. In this work, we introduce a $Q$/$D$-space framework of sufficient order conditions for ERK…
We develop continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials in this paper. There are two main highlighted merits for developing such methods: Firstly, we do not need to study the tedious solution of…
A novel optimization procedure for the generation of stability polynomials of stabilized explicit Runge-Kutta methods is devised. Intended for semidiscretizations of hyperbolic partial differential equations, the herein developed approach…
Second-order methods for convex optimization outperform first-order methods in terms of theoretical iteration convergence, achieving rates up to $O(k^{-5})$ for highly-smooth functions. However, their practical performance and applications…
Using simplifying assumptions that are related to the time reversal symmetry, a 1-dimensional family of 8-stage pseudo-symplectic Runge-Kutta methods of order (4, 8), i.e., methods of order 4 that preserve symplectic structure up to order…
This paper presents a class of Two-Step General Linear Methods for the numerical solution of Retarded Functional Differential Equations. Explicit methods up to order five are constructed. To avoid order reduction for mildly stiff problems…
This paper presents a class of Two-Step General Linear Methods for the numerical solution of Retarded Functional Differential Equations. Explicit methods up to order five are constructed. To avoid order reduction for mildly stiff problems…
This work proposes and analyzes a new class of numerical integrators for computing low-rank approximations to solutions of matrix differential equation. We combine an explicit Runge-Kutta method with repeated randomized low-rank…
Two-step predictor/corrector methods are provided to solve three classes of problems that present themselves as systems of ordinary differential equations (ODEs). In the first class, velocities are given from which displacements are to be…
The nonlinear gyrokinetic equations describe plasma turbulence in laboratory and astrophysical plasmas. To solve these equations, massively parallel codes have been developed and run on present-day supercomputers. This paper describes…
Fully implicit Runge-Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the…
Many time-dependent partial differential equations (PDEs) can be transformed into an ordinary differential equations (ODEs) containing moderately stiff and non-stiff terms after spatial semi-discretization. In the present paper, we…
Second-order optimization methods are computationally expensive for large-scale problems. Recently, Doikov, Chayti, and Jaggi (ICML 2023) proposed the LazyCRN method that reduces computation by studying the gradient complexity of…
This work considers multirate generalized-structure additively partitioned Runge-Kutta (MrGARK) methods for solving stiff systems of ordinary differential equations (ODEs) with multiple time scales. These methods treat different partitions…
In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge-Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems,…