English
Related papers

Related papers: Optimal explicit stabilized postprocessed $\tau$-l…

200 papers

Tau-leaping is a family of algorithms for the approximate simulation of the discrete state continuous time Markov chains. Motivation for the development of such methods can be found, for instance, in the fields of chemical kinetics and…

Probability · Mathematics 2020-08-10 Viktor Reshniak , Abdul Khaliq , David Voss

In biochemical systems some of the chemical species are present with only small numbers of molecules. In this situation discrete and stochastic simulation approaches are more relevant than continuous and deterministic ones. The fundamental…

Computational Engineering, Finance, and Science · Computer Science 2013-03-18 Tae-Hyuk Ahn , Adrian Sandu , Xiaoying Han

A novel second order family of explicit stabilized Runge-Kutta-Chebyshev methods for advection-diffusion-reaction equations is introduced. The new methods outperform existing schemes for relatively high Peclet number due to their favorable…

Numerical Analysis · Mathematics 2023-06-09 Ibrahim Almuslimani

Explicit stabilized methods are highly efficient time integrators for large and stiff systems of ordinary differential equations especially when applied to semi-discrete parabolic problems. However, when local spatial mesh refinement is…

Numerical Analysis · Mathematics 2025-10-20 Mathieu Benninghoff , Gilles Vilmart

In this master thesis we have compared different second order stabilized explicit Runge-Kutta methods when applied to the incompressible Navier-Stokes equations by means of a projection method and a differential algebraic approach. We…

Numerical Analysis · Mathematics 2022-03-30 Giacomo Rosilho de Souza

Stabilized Runge-Kutta methods are especially efficient for the numerical solution of large systems of stiff nonlinear differential equations because they are fully explicit. For semi-discrete parabolic problems, for instance, stabilized…

Numerical Analysis · Mathematics 2022-04-05 Assyr Abdulle , Marcus J. Grote , Giacomo Rosilho de Souza

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…

Numerical Analysis · Mathematics 2024-03-19 Daniel Doehring , Gregor J. Gassner , Manuel Torrilhon

Stabilized methods (also called Chebyshev methods) are explicit methods with extended stability domains along the negative real axis. These methods are intended for large mildly stiff problems, originating mainly from parabolic PDEs. In…

Numerical Analysis · Mathematics 2023-03-30 Andrew Moisa , Boris Faleichik

We present second-order optimally stable Implicit-Explicit (IMEX) Runge-Kutta (RK) schemes with application to a modified set of shallow water equations that can be used to model the dynamics of lava flows. The schemes are optimally stable…

Numerical Analysis · Mathematics 2025-09-12 Federico Gatti , Giuseppe Orlando

We introduce a family of stochastic optimization methods based on the Runge-Kutta-Chebyshev (RKC) schemes. The RKC methods are explicit methods originally designed for solving stiff ordinary differential equations by ensuring that their…

Optimization and Control · Mathematics 2022-02-01 Tony Stillfjord , Måns Williamson

High-order spatial discretizations with strong stability properties (such as monotonicity) are desirable for the solution of hyperbolic PDEs. Methods may be compared in terms of the strong stability preserving (SSP) time-step. We prove an…

Numerical Analysis · Mathematics 2014-01-30 Christopher Bresten , Sigal Gottlieb , Zachary Grant , Daniel Higgs , David I. Ketcheson , Adrian Németh

We consider the problem of efficiently simulating stochastic models of chemical kinetics. The Gillespie Stochastic Simulation algorithm (SSA) is often used to simulate these models, however, in many scenarios of interest, the computational…

Molecular Networks · Quantitative Biology 2024-07-10 Thomas Trigo Trindade , Konstantinos C. Zygalakis

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…

Numerical Analysis · Mathematics 2020-04-08 Hendrik Ranocha

In biochemically reactive systems with small copy numbers of one or more reactant molecules, the dynamics is dominated by stochastic effects. To approximate those systems, discrete state-space and stochastic simulation approaches have been…

Numerical Analysis · Mathematics 2020-07-13 Chiheb Ben Hammouda , Alvaro Moraes , Raul Tempone

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…

Numerical Analysis · Mathematics 2025-09-23 Xiao Tang , Junwei Huang

We propose entropy-preserving and entropy-stable partitioned Runge--Kutta (RK) methods. In particular, we extend the explicit relaxation Runge--Kutta methods to IMEX--RK methods and a class of explicit second-order multirate methods for…

Numerical Analysis · Mathematics 2022-07-21 Shinhoo Kang , Emil M. Constantinescu

Strong Stability Preserving (SSP) time integration schemes maintain stability of the forward Euler method for any initial value problem. However, only a small subset of Runge-Kutta (RK) methods are SSP, and many efficient high-order time…

Numerical Analysis · Mathematics 2026-01-28 Mohammad R. Najafian , Brian C. Vermeire

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.…

Numerical Analysis · Mathematics 2025-07-09 Daniel Doehring , Hendrik Ranocha , Manuel Torrilhon

We propose the $S$-leaping algorithm for the acceleration of Gillespie's stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the $\tau$-leaping and $R$-leaping algorithms. These algorithms are…

By explicitly representing the reaction times of discrete chemical systems as the firing times of independent, unit rate Poisson processes, we develop a new adaptive tau-leaping procedure. The procedure developed is novel in that accuracy…

Molecular Networks · Quantitative Biology 2009-11-13 David F. Anderson
‹ Prev 1 2 3 10 Next ›