General relaxation methods for initial-value problems with application to multistep schemes

From MaRDI portal
Publication:2217872

DOI10.1007/S00211-020-01158-4zbMATH Open1456.65051arXiv2003.03012OpenAlexW3096719680MaRDI QIDQ2217872FDOQ2217872


Authors: Hendrik Ranocha, Lajos Lóczi, David I. Ketcheson Edit this on Wikidata


Publication date: 11 January 2021

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep methods, including all general linear methods of order two or higher, and many other classes of schemes. We prove the existence of a valid relaxation parameter and high-order accuracy of the resulting method, in the context of general equations, including but not limited to conservative or dissipative systems. The theory is illustrated with several numerical examples.


Full work available at URL: https://arxiv.org/abs/2003.03012




Recommendations




Cites Work


Cited In (25)

Uses Software





This page was built for publication: General relaxation methods for initial-value problems with application to multistep schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217872)