2018
DOI: 10.1007/s10915-018-0664-3
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Monotonicity-Preserving Perturbations of a Given Runge–Kutta Method

Abstract: Perturbed Runge-Kutta methods (also referred to as downwind Runge-Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional RungeKutta counterparts. In this paper we study the question of how to optimally perturb a given method in order to increase the radius of absolute monotonicity (a.m.). We prove that for methods with zero radius of a.m., it is always possible to give a perturbation with positive radius. We first study methods for linear problems and then … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…For verifying the effectiveness of the aforementioned controller, a numerical simulation experiment was achieved in MATLAB/Simulink. The real-time state value of the manipulator system is solved by ode4 (Runge-Kutta) (Higueras et al, 2018). Through the feedback of the current state value, the current control torque of the system is obtained.…”
Section: Methodsmentioning
confidence: 99%
“…For verifying the effectiveness of the aforementioned controller, a numerical simulation experiment was achieved in MATLAB/Simulink. The real-time state value of the manipulator system is solved by ode4 (Runge-Kutta) (Higueras et al, 2018). Through the feedback of the current state value, the current control torque of the system is obtained.…”
Section: Methodsmentioning
confidence: 99%
“…which we then evolve in time using an explicit Runge-Kutta method of the form (6). This approach is known as a Lawson-type method [11].…”
Section: Ssp Theory For Explicit Integrating Factor Runge-kutta Methodsmentioning
confidence: 99%
“…Thus, if α i,j ≥ 0, all the intermediate stages u (i) in (6) are convex combinations of backward in time Euler and forward Euler operators, with ∆t replaced by |β i,j | α i,j ∆t. Following the same reasoning as above, any strong stability bound satisfied by the backward in time and forward in time Euler methods will then be preserved by the Runge-Kutta method (6) where F is replaced byF whenever the corresponding β is negative.…”
Section: Introductionmentioning
confidence: 99%
“…• Strong stability preserving (SSP) Runge-Kutta methods (Hadjimichael et al, 2013;David I. Ketcheson et al, 2009;David I. Ketcheson, 2008) • SSP general linear methods (Bresten et al, 2017; • Low-storage Runge-Kutta methods (David I. Ketcheson, 2010) • Additive and downwind SSP Runge-Kutta methods (Higueras et al, 2018;David I. Ketcheson, 2011) • High-order parallel extrapolation and deferred correction methods (David I. Ketcheson & bin Waheed, 2014) • SSP linear multistep methods (Hadjimichael et al, 2016;Hadjimichael & Ketcheson, 2018) • Dense output formulas for Runge-Kutta methods (David I. Ketcheson et al, 2017) • Internal stability theory for Runge-Kutta methods (David I.…”
Section: Related Research and Softwarementioning
confidence: 99%