Related papers: Performance Evaluation of Mixed-Precision Runge-Ku…
In the early days of computing, severe memory constraints made it necessary to use lower floating-point precision. As hardware capabilities have advanced, modern systems, particularly in computational statistics and scientific computing,…
Modified Patankar-Runge-Kutta (MPRK) methods preserve the positivity as well as conservativity of a production-destruction system (PDS) of ordinary differential equations for all time step sizes. As a result, higher order MPRK schemes do…
We provide a note on continuous-stage Runge-Kutta methods (csRK) for solving initial value problems of first-order ordinary differential equations. Such methods, as an interesting and creative extension of traditional Runge-Kutta (RK)…
This article extends the theory of dual-consistent summation-by-parts (SBP) and generalized SBP (GSBP) time-marching methods by showing that they are implicit Runge-Kutta schemes. Through this connection, the accuracy theory for the…
We introduce a high-order space-time approximation of the Shallow Water Equations with sources that is invariant-domain preserving (IDP) and well-balanced with respect to rest states. The employed time-stepping technique is a novel explicit…
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…
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and…
In the last few decades, numerical simulation for nonlinear oscillators has received a great deal of attention, and many researchers have been concerned with the design and analysis of numerical methods for solving oscillatory problems. In…
We have shown previously that functionally fitted Runge-Kutta (FRK) methods can be studied using a convenient collocation framework. Here, we extend that framework to functionally fitted Runge-Kutta-Nystr\"om (FRKN) methods, shedding…
In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with…
Splitting-based time integration approaches such as fractional steps, alternating direction implicit, operator splitting, and locally one-dimensional methods partition the system of interest into components and solve individual components…
In this paper we consider time-dependent PDEs discretized by a special class of Physics Informed Neural Networks whose design is based on the framework of Runge--Kutta and related time-Galerkin discretizations. The primary motivation for…
In this paper, we present continuous-stage partitioned Runge-Kutta (csPRK) methods for energy-preserving integration of Hamiltonian systems. A sufficient condition for the energy preservation of the csPRK methods is derived. It is shown…
In this paper, a family of arbitrarily high-order structure-preserving exponential Runge-Kutta methods are developed for the nonlinear Schr\"odinger equation by combining the scalar auxiliary variable approach with the exponential…
The result after $N$ steps of an implicit Runge-Kutta time discretization of an inhomogeneous linear parabolic differential equation is computed, up to accuracy $\epsilon$, by solving only $$O\Big(\log N \log \frac1\epsilon \Big) $$ linear…
Fractional-step methods are a popular and powerful divide-and-conquer approach for the numerical solution of differential equations. When the integrators of the fractional steps are Runge--Kutta methods, such methods can be written as…
Fortran's prominence in scientific computing requires strategies to ensure both that legacy codes are efficient on high-performance computing systems, and that the language remains attractive for the development of new high-performance…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
In the paper explicit functional continuous Runge-Kutta and Runge-Kutta-Nystr\"om methods for retarded functional differential equations are considered. New methods for first order equations as well as for second order equations of the…
The use of reduced and mixed precision computing has gained increasing attention in high-performance computing (HPC) as a means to improve computational efficiency, particularly on modern hardware architectures like GPUs. In this work, we…