Related papers: Mixed precision and mixed accuracy explicit two-de…
We study the local discretization error of Patankar-type Runge-Kutta methods applied to semi-discrete PDEs. For a known two-stage Patankar-type scheme the local error in PDE sense for linear advection or diffusion is shown to be of the…
In this work modified Patankar-Runge-Kutta (MPRK) schemes up to order four are considered and equipped with a dense output formula of appropriate accuracy. Since these time integrators are conservative and positivity preserving for any time…
We propose an adaptive mixed precision and dynamically scaled preconditioned conjugate gradient algorithm (AMP-PCG). It dynamically adjusts the precision for storing vectors and computing, exploiting low precision when appropriate, while…
We apply Runge-Kutta methods to linear partial differential-algebraic equations of the form $Au_t(t,x) + B(u_{xx}(t,x)+ru_x(t,x))+Cu(t,x) = f(t,x)$, where $A,B,C\in\R^{n,n}$ and the matrix $A$ is singular. We prove that under certain…
We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…
A unified theoretical framework is suggested to examine the energy dissipation properties at all stages of additive implicit-explicit Runge-Kutta (IERK) methods up to fourth-order accuracy for gradient flow problems. We construct some…
The ability to accurately approximate trajectories of dynamical systems enables their analysis, prediction, and control. Neural network (NN)-based approximations have attracted significant interest due to fast evaluation with good accuracy…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
Many HPC applications that solve differential equations rely on the Runge-Kutta family of methods for time integration. Among these methods, the fourth-order accurate RK4 scheme is especially popular. This time integration scheme requires…
A new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of…
New time integration methods are proposed for simulating incompressible multiphase flow in pipelines described by the one-dimensional two-fluid model. The methodology is based on 'half-explicit' Runge-Kutta methods, being explicit for the…
Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep…
This paper considers the numerical integration of semilinear evolution PDEs using the high order linearly implicit methods developped in a previous paper in the ODE setting. These methods use a collocation Runge--Kutta method as a basis,…
When one wishes to numerically solve an initial value problem, it is customary to rewrite it as an equivalent first-order system to which a method, usually from the class of Runge-Kutta methods, is applied. Directly treating higher-order…
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 numerical code, based upon a mixed FEM-Runge-Kutta method, is used for the analysis and design of plane 2-D smart structures. The code is applied to the study of arbitrarily shaped PEM plates, based on a weak formulation of their…
Variational space-time formulations for Partial Differential Equations have been of great interest in the last decades. While it is known that implicit time marching schemes have variational structure, the Galerkin formulation of explicit…
This paper introduces a novel framework for the solution of (large-scale) Lyapunov and Sylvester equations derived from numerical integration methods. Suitable systems of ordinary differential equations are introduced. Low-rank…
Explicit Runge-Kutta methods are classical and widespread techniques in the numerical solution of ordinary differential equations (ODEs). Considering partial differential equations, spatial semidiscretisations can be used to obtain systems…
Deriving analytical solutions of ordinary differential equations is usually restricted to a small subset of problems and numerical techniques are considered. Inevitably, a numerical simulation of a differential equation will then always be…