Optimal monotonicity-preserving perturbations of a given Runge–Kutta method

Perturbed Runge–Kutta methods (also referred to as downwind Runge–Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional Runge–Kutta counterparts. In this paper we study the question of how to optimally perturb a given method in order to increase...

Descripción completa

Detalles Bibliográficos
Autores: Higueras Sanz, Inmaculada, Ketcheson, David I., Kocsis, Tihamér A.
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2018
País:España
Institución:Universidad Pública de Navarra
Repositorio:Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
OAI Identifier:oai:academica-e.unavarra.es:2454/38630
Acceso en línea:https://hdl.handle.net/2454/38630
Access Level:acceso abierto
Palabra clave:Strong stability preserving
Monotonicity
Runge–Kutta methods
Time discretization
Descripción
Sumario:Perturbed Runge–Kutta methods (also referred to as downwind Runge–Kutta methods) can guarantee monotonicity preservation under larger step sizes relative to their traditional Runge–Kutta 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 methods for nonlinear problems. In each case, we prove upper bounds on the radius of a.m., and provide algorithms to compute optimal perturbations. We also provide optimal perturbations for many known methods.