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-}
}
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… 

Figures and Tables from this paper

Fast Solution of Fully Implicit Runge-Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs
TLDR
A theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDE's with algebraic constraints is introduced.
Stage-parallel preconditioners for implicit Runge-Kutta methods of arbitrary high order. Linear problems
TLDR
This work considers strongly A-stable implicit Runge-Kutta methods of arbitrary order of accuracy, based on Radau quadratures, for the arising large algebraic systems and introduces an efficient preconditioner, that allows for fully stage-parallel solution.
Weighted-norm preconditioners for a multi-layer tide model
TLDR
A robust method is derived that requires solving a reformulated system that only involves coupling between adjacent layers, and is based on a careful analysis of the matrix that couples the layers.
Arbitrary Order Energy and Enstrophy Conserving Finite Element Methods for 2D Incompressible Fluid Dynamics and Drift-Reduced Magnetohydrodynamics
Maintaining conservation laws in the fully discrete setting is critical for accurate long-time behavior of numerical simulations and requires accounting for discrete conservation properties in both

References

SHOWING 1-10 OF 45 REFERENCES
Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge-Kutta Schemes for Parabolic PDEs
TLDR
It is shown that BCSD, BRSD, and BJF significantly outperform other preconditioners in terms of GMRES iterations, and SABRSD is competitive with them and the prior state of the art in Terms of computational cost while requiring the least amount of memory.
Irksome: Automating Runge–Kutta Time-stepping for Finite Element Methods
TLDR
Irksome is presented, a high-level library for manipulating UFL (Unified Form Language) expressions of semidiscrete variational forms to obtain UFL expressions for the coupled Runge--Kutta stage equations at each time step.
MFEM: a modular finite element methods library
Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
TLDR
This paper designs preconditioners for the matrix-free solution of high-order continuous and discontinuous Galerkin discretizations of elliptic problems based on FEM-SEM equivalence and additive Schwarz methods and presents results on a variety of examples.
Multigrid for Matrix-Free High-Order Finite Element Computations on Graphics Processors
TLDR
A GPU parallelization of a matrix-free geometric multigrid iterative solver targeting moderate and high polynomial degrees, with support for general curved and adaptively refined hexahedral meshes with hanging nodes is developed.
Preconditioners for the Discontinuous Galerkin time-stepping method of arbitrary order
TLDR
A preconditioner for systems arising from space-time finite element discretizations of parabolic equations based on a transformation of the coupled system into block diagonal form and an efficient solution strategy for the arising 2 × 2 blocks is developed.
Real pole approximations to the exponential function
  • B. Orel
  • Mathematics, Computer Science
  • 1991
TLDR
Rational approximations to the exponential function with real, not necessarily distinct poles are studied and it is proven, that approximants with the smallest error constant are the Restricted Padé approximant of Nørsett.
Efficiently Implementable Algebraically Stable Runge–Kutta Methods
TLDR
This paper analyzes the algebraic stability of two families of methods with this property, namely singly-implicit and diagonally implicit methods.
...
...