• DOI:10.1137/21m1389742
• Corpus ID: 235830017

Fast Solution of Fully Implicit Runge-Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

@article{Southworth2022FastSO,
  title={Fast Solution of Fully Implicit Runge-Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting},
  author={Ben S. Southworth and Oliver A. Krzysik and Will Pazner and Hans De Sterck},
  journal={SIAM J. Sci. Comput.},
  year={2022},
  volume={44},
  pages={416-}
}

• B. Southworth, O. Krzysik, +1 author H. D. Sterck
• Published 2 January 2021
• Computer Science
• SIAM J. Sci. Comput.

Fully implicit Runge-Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but are rarely used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). This framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have conditioning ∼ O(1), with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization. The new method can be used with arbitrary existing preconditioners for backward Euler-type time stepping schemes, and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite-element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally implicit RK methods. ∗BSS was supported by Lawrence Livermore National Laboratory under contract B639443, and as a Nicholas C. Metropolis Fellow under the Laboratory Directed Research and Development program of Los Alamos National Laboratory. OAK acknowledges the support of an Australian Government Research Training Program (RTP) Scholarship. †Theoretical Division, Los Alamos National Laboratory, U.S.A. ([e-mail]), http: //orcid.org/0000-0002-0283-4928 ‡School of Mathematics, Monash University, Australia ([e-mail]), https: //orcid.org/0000-0001-7880-6512 §Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, U.S.A. (pazn [e-mail]) ¶Department of Applied Mathematics, University of Waterloo, Waterloo, Canada (hdesterck@uwa terloo.ca) 1 ar X iv :2 10 1. 00 51 2v 3 [ m at h. N A ] 1 3 Ju l 2 02 1