High-order linearly implicit schemes conserving quadratic invariants

In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for preserving them have been ex-tensively studied. Since linear invariants can be easily kept after discretisation, quadratic invariants are essentially the simplest ones. Quadratic invariants are important objects that appear not only in many physical examples but also in the computationally efficient con-servative schemes for general invariants such as scalar auxiliary variable approach, which have been studied in recent years. It is known that quadratic invariants can be maintained relatively easily compared with general invariants, and can be preserved by canonical Runge-Kutta methods. However, there is no unified method for constructing linearly im-plicit and high order conservative schemes. In this paper, we construct such schemes based on canonical Runge-Kutta methods and prove some properties involving accuracy. (c) 2023 The Authors. Published by Elsevier B.V. on behalf of IMACS. This is an open access article under the CC BY-NC-ND license (http:// creativecommons .org /licenses /by-nc -nd /4 .0/).

Automated summary

In this paper, linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant are proposed. Quadratic invariants are important objects appearing in many physical examples and computationally efficient conservative schemes. The authors construct such schemes based on canonical Runge-Kutta methods and prove some properties involving accuracy.