# A class of generalized additive Runge-Kutta methods

@article{Sandu2013ACO, title={A class of generalized additive Runge-Kutta methods}, author={Adrian Sandu and Michael G{\"u}nther}, journal={ArXiv}, year={2013}, volume={abs/1310.5573} }

This work generalizes the additively partitioned Runge-Kutta methods by allowing for different stage values as arguments of different components of the right hand side. An order conditions theory is developed for the new family of generalized additive methods, and stability and monotonicity investigations are carried out. The paper discusses the construction and properties of implicit-explicit and implicit-implicit,methods in the new framework. The new family, named GARK, introduces additional… Expand

#### Figures and Topics from this paper

#### 8 Citations

A Generalized-Structure Approach to Additive Runge-Kutta Methods

- Mathematics, Computer Science
- SIAM J. Numer. Anal.
- 2015

The paper discusses the construction and properties of implicit-explicit and implicit-implicit methods in the new framework, which introduces additional flexibility when compared to traditional partitioned Runge--Kutta formalism and therefore offers additional opportunities for the development of flexible solvers for systems with multiple scales, or driven by multiple physical processes. Expand

Multirate generalized additive Runge Kutta methods

- Mathematics, Computer Science
- Numerische Mathematik
- 2016

This work constructs a new class of multirate schemes based on the recently developed generalized additive Runge–Kutta methods and shows that nonlinear stability and monotonicity investigations show that these properties are inherited from the base schemes provided that additional coupling conditions hold. Expand

Relaxed Multirate Infinitesimal Step Methods

- Computer Science
- 2018

The resulting framework supports a range of attractive properties for multirate methods, including telescopic extensions, subcycling, embeddings for temporal error estimation, and support for changes to the fast/slow time-scale separation between steps, without requiring any sacrifices in linear stability. Expand

Relaxed Multirate Infinitesimal Step Methods for Initial-Value Problems

- Computer Science, Mathematics
- 2018

The resulting framework supports a range of attractive properties for multirate methods, including telescopic extensions, subcycling, embeddings for temporal error estimation, and support for changes to the fast/slow time-scale separation between steps, without requiring any sacrifices in linear stability. Expand

Linearly Implicit IMEX Runge-Kutta Methods for a Class of Degenerate Convection-Diffusion Problems

- Computer Science, Mathematics
- SIAM J. Sci. Comput.
- 2015

Multispecies kinematic flow models with strongly degenerate diffusive corrections give rise to systems of nonlinear convection-diffusion equations of arbitrary size. Applications of these systems… Expand

Efficient and accurate splitting methods for time integration of multi-physics systems

- 2014

Coupled multi-physics systems dominate computational models of advanced science and engineering applications. These systems give rise to challenges not typically faced by single-physics models:… Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

Order conditions for numerical methods for partitioned ordinary differential equations

- Mathematics
- 1981

SummaryMotivated by the consideration of Runge-Kutta formulas for partitioned systems, the theory of “P-series” is studied. This theory yields the general structure of the order conditions for… Expand

Additive Runge-Kutta methods for stiff ordinary differential equations

- Mathematics
- 1983

Certain pairs of Runge-Kutta methods may be used additively to solve a system of n differential equations x' = J(t)x + g(t, x). Pairs of methods, of order p < 4, where one method is semiexplicit and… Expand

Contractivity/monotonicity for additive Runge-Kutta methods: inner product norms

- Mathematics
- 2006

Space discretization of some time dependent partial differential equations give rise to ordinary differential equations containing additive terms with different stiffness properties. In these… Expand

Partitioning strategies in Runge-Kutta type methods

- Mathematics
- 1993

The numerical solution of ode's suffers from stability constraints, if there are solution components with different time constants. Two recommended approaches in software packages to handle these… Expand

Characterizing Strong Stability Preserving Additive Runge-Kutta Methods

- Mathematics, Computer Science
- J. Sci. Comput.
- 2009

This paper characterize strong stability preserving additive Runge-Kutta methods giving some order barriers and structural properties. Expand

Monotonicity conditions for multirate and partitioned explicit Runge-Kutta schemes

- Mathematics, Physics
- 2012

Multirate schemes for conservation laws or convection-dominated problems seem to come in two flavors: schemes that are locally inconsistent, and schemes that lack mass-conservation. In this paper… Expand

Contractivity of Runge-Kutta methods

- Mathematics
- 1991

In this paper we present necessary and sufficient conditions for Runge-Kutta methods to be contractive. We consider not only unconditional contractivity for arbitrary dissipative initial value… Expand

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

- Mathematics
- 2003

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and… Expand

Monotonicity for Runge–Kutta Methods: Inner Product Norms

- Mathematics, Computer Science
- J. Sci. Comput.
- 2005

This paper considers monotonicity issues for Runge–Kutta methods when the applied norm is an inner product norm. Expand

Representations of Runge-Kutta Methods and Strong Stability Preserving Methods

- Computer Science, Mathematics
- SIAM J. Numer. Anal.
- 2005

This paper extends the Shu--Osher representations for any Runge--Kutta method giving sufficient conditions for monotonicity and shows how optimal Shu-- Osher representations can be constructed from the Butcher tableau of a Runge-KutTA method. Expand