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

Hendrik Ranocha, Lajos Loczi, David I. Ketcheson

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

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.
Original languageEnglish (US)
JournalNumerische Mathematik
DOIs
StatePublished - Oct 28 2020

Bibliographical note

KAUST Repository Item: Exported on 2020-11-03
Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The project “Application-domain-specific highly reliable IT solutions” has been implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, and financed under the scheme Thematic Excellence Programme no. 2020-4.1.1-TKP2020 (National Challenges Subprogramme).

Fingerprint

Dive into the research topics of 'General relaxation methods for initial-value problems with application to multistep schemes'. Together they form a unique fingerprint.

Cite this