Related papers: General Relaxation Methods for Initial-Value Probl…
In this paper a technique is given to recover the classical order of the method when explicit exponential Runge-Kutta methods integrate reaction-diffusion problems. Although methods of high stiff order for problems with vanishing boundary…
We present novel entropy-conservative and entropy-stable multirate Runge-Kutta methods based on Paired Explicit Runge-Kutta (P-ERK) schemes with relaxation for conservation laws and related systems of partial differential equations.…
We study solutions to nonlinear hyperbolic systems with fully nonlinear relaxation terms in the limit of, both, infinitely stiff relaxation and arbitrary late time. In this limit, the dynamics is governed by effective systems of parabolic…
We prove that Runge-Kutta (RK) methods for numerical integration of arbitrarily large systems of Ordinary Differential Equations are linearly stable. Standard stability arguments -- based on spectral analysis, resolvent condition or strong…
In recent years, bilevel approaches have become very popular to efficiently estimate high-dimensional hyperparameters of machine learning models. However, to date, binary parameters are handled by continuous relaxation and rounding…
In the numerical solution of partial differential equations using a method-of-lines approach, the availability of high order spatial discretization schemes motivates the development of sophisticated high order time integration methods. For…
In this article, a family of two- and three-stage explicit multiquadric (MQ) and inverse multiquadric (IMQ) radial basis functions (RBFs) Runge-Kutta methods are introduced for solving ordinary differential equations. These methods are…
In this paper the performance of a parallel iterated Runge-Kutta method is compared versus those of the serial fouth order Runge-Kutta and Dormand-Prince methods. It was found that, typically, the runtime for the parallel method is…
This study computes the gradient of a function of numerical solutions of ordinary differential equations (ODEs) with respect to the initial condition. The adjoint method computes the gradient approximately by solving the corresponding…
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…
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…
We consider the development of high order asymptotic-preserving linear multistep methods for kinetic equations and related problems. The methods are first developed for BGK-like kinetic models and then extended to the case of the full…
We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…
In current research, we analyse dissipation and dispersion characteristics of most accurate two and three stage Gauss-Legendre implicit Runge-Kutta (R-K) methods. These methods, known for their $A$-stability and immense accuracy, are…
Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices in the iterative processes, which generalize row and…
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…
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…
We propose an experimental study of adaptive time-stepping methods for efficient modeling of the aggregation-fragmentation kinetics. Precise modeling of this phenomena usually requires utilization of the large systems of nonlinear ordinary…
Mathematical Programs with Vanishing Constraints (MPVCs) are a notoriously challenging class of problems owing to their lack of constraint qualification. Therefore, to tackle these problems, relaxation-based approaches are typically used.…
We present a general, high-order, fully explicit relaxation scheme which can be applied to any system of nonlinear hyperbolic conservation laws in multiple dimensions. The scheme consists of two steps. In a first (relaxation) step, the…