Constraint-Satisfying Krylov Solvers for Structure-Preserving DiscretiZations

Abstract

SIAM Journal on Matrix Analysis and Applications, Volume 45, Issue 1, Page 327-352, March 2024.
Abstract. A key consideration in the development of numerical schemes for time-dependent partial differential equations (PDEs) is the ability to preserve certain properties of the continuum solution, such as associated conservation laws or other geometric structures of the solution. There is a long history of the development and analysis of such structure-preserving discretization schemes, including both proofs that standard schemes have structure-preserving properties and proposals for novel schemes that achieve both high-order accuracy and exact preservation of certain properties of the continuum differential equation. When coupled with implicit time-stepping methods, a major downside to these schemes is that their structure-preserving properties generally rely on an exact solution of the (possibly nonlinear) systems of equations defining each time step in the discrete scheme. For small systems, this is often possible (up to the accuracy of floating-point arithmetic), but it becomes impractical for the large linear systems that arise when considering typical discretization of space-time PDEs. In this paper, we propose a modification to the standard flexible generalized minimum residual iteration that enforces selected constraints on approximate numerical solutions. We demonstrate its application to both systems of conservation laws and dissipative systems.