Related papers: Perturbed Runge-Kutta methods for mixed precision …
We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge--Kutta--Legendre (RKL) and Runge--Kutta--Gegenbauer (RKG) super-time-stepping methods were…
A fifth-order implicit Runge-Kutta method and two fourth-order exponential integration methods equipped with Krylov subspace approximations were implemented for the GPU and paired with the analytical chemical kinetic Jacobian software…
The family of PDE-constrained LDDMM methods is emerging as a particularly interesting approach for physically meaningful diffeomorphic transformations. The original combination of Gauss--Newton--Krylov optimization and Runge--Kutta…
A general purpose, modular program package for the integration of large number of independent ordinary differential equation systems capable of using professional graphics cards is presented. The available numerical schemes are the explicit…
Renewed interest in mixed-precision algorithms has emerged due to growing data capacity and bandwidth concerns, as well as the advancement of GPUs, which enable significant speedup for low precision arithmetic. In light of this, we propose…
Conservation properties of iterative methods applied to implicit finite volume discretizations of nonlinear conservation laws are analyzed. It is shown that any consistent multistep or Runge-Kutta method is globally conservative. Further,…
The main objective of this work consists in analyzing sub-structuring method for the parallel solution of sparse linear systems with matrices arising from the discretization of partial differential equations such as finite element, finite…
We consider the construction of semi-implicit linear multistep methods which can be applied to time dependent PDEs where the separation of scales in additive form, typically used in implicit-explicit (IMEX) methods, is not possible. As…
This paper investigates the energy conservation properties of explicit Runge--Kutta (RK) time discretizations for autonomous skew-symmetric systems. For linear problems, we present a general framework for constructing RK methods in which…
A space-time adaptive scheme is presented for solving advection equations in two space dimensions. The gradient-augmented level set method using a semi-Lagrangian formulation with backward time integration is coupled with a point value…
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 error estimates of the integral deferred correction method constructed with stiffly accurate implicit Runge-Kutta methods with a nonsingular matrix $A$ in its Butcher table representation, when applied to stiff…
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…
We show how the error term for the Trapezium Rule can be estimated, by solving an initial value problem using a Runge-Kutta method. The error term can then be added to the Trapezium approximation, yielding a much more accurate result. We…
Using a recent characterization of energy-preserving B-series, we derive the explicit conditions on the coefficients of a Runge-Kutta method that ensure energy preservation (for Hamiltonian systems) up to a given order in the step size,…
The effects of kinetic-energy preservation errors due to Runge-Kutta (RK) temporal integrators have been analyzed for the case of large-eddy simulations of incompressible turbulent channel flow. Simulations have been run using the…
Implicit-Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is partitioned into stiff and nonstiff processes with the goal of lower computational costs than a purely…
This work constructs a new class of multirate schemes based on the recently developed generalized additive Runge-Kutta (GARK) methods (Sandu and Guenther, 2013). Multirate schemes use different step sizes for different components and for…
As supercomputers grow in hardware complexity, their susceptibility to faults increases and measures need to be taken to ensure the correctness of results. Some numerical algorithms have certain characteristics that allow them to recover…
A new preconditioner based on a block $LDU$ factorization with algebraic multigrid subsolves for scalability is introduced for the large, structured systems appearing in implicit Runge-Kutta time integration of parabolic partial…