skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Journal Article · · SIAM Journal on Scientific Computing
DOI:https://doi.org/10.1137/21m1389742· OSTI ID:1873331
ORCiD logo [1]; ORCiD logo [2]; ORCiD logo [3];  [4]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Monash Univ., Melbourne, VIC (Australia)
  3. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing
  4. Univ. of Waterloo, ON (Canada)

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly 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). Additionally, 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 condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and 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 and time step. 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 IRK methods.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
89233218CNA000001; AC52-07NA27344
OSTI ID:
1873331
Report Number(s):
LA-UR-20-30412
Journal Information:
SIAM Journal on Scientific Computing, Vol. 44, Issue 1; ISSN 1064-8275
Publisher:
Society for Industrial and Applied Mathematics (SIAM)Copyright Statement
Country of Publication:
United States
Language:
English

References (43)

Inexact Simplified Newton Iterations for Implicit Runge-Kutta Methods journal January 2000
Preconditioning of fully implicit Runge-Kutta schemes for parabolic PDEs
  • Staff, Gunnar A.; Mardal, Kent-Andre; Nilssen, Trygve K.
  • Modeling, Identification and Control: A Norwegian Research Bulletin, Vol. 27, Issue 2 https://doi.org/10.4173/mic.2006.2.3
journal January 2006
Spectral methods for problems in complex geometries journal August 1980
An Efficient Solution Process for Implicit Runge–Kutta Methods journal December 1977
A new type of singly-implicit Runge–Kutta method journal July 2000
A posteriori error analysis for higher order dissipative methods for evolution problems journal September 2006
MFEM: A modular finite element methods library journal January 2021
Efficient numerical realization of discontinuous Galerkin methods for temporal discretization of parabolic problems journal October 2012
Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs journal January 2021
Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems journal January 2002
A splitting preconditioner for the iterative solution of implicit Runge-Kutta and boundary value methods journal January 2014
Order optimal preconditioners for fully implicit Runge-Kutta schemes applied to the bidomain equations journal April 2010
Analysis of a New Space-Time Parallel Multigrid Algorithm for Parabolic Problems journal January 2016
Kronecker product splitting preconditioners for implicit Runge-Kutta discretizations of viscous wave equations journal April 2016
Galerkin and Runge–Kutta methods: unified formulation, a posteriori error estimates and nodal superconvergence journal February 2011
Irksome: Automating Runge–Kutta Time-stepping for Finite Element Methods
  • Farrell, Patrick E.; Kirby, Robert C.; Marchena-Menéndez, Jorge
  • ACM Transactions on Mathematical Software, Vol. 47, Issue 4 https://doi.org/10.1145/3466168
journal December 2021
Nonsymmetric Reduction-Based Algebraic Multigrid journal January 2019
Efficient Low-Order Refined Preconditioners for High-Order Matrix-Free Continuous and Discontinuous Galerkin Methods journal January 2020
Time Discretization of Parabolic Problems by the HP-Version of the Discontinuous Galerkin Finite Element Method journal January 2000
Stability of the method of lines journal December 1992
Multigrid for Matrix-Free High-Order Finite Element Computations on Graphics Processors journal May 2019
Runge-Kutta Discontinuous Galerkin Methods for Convection-Dominated Problems journal September 2001
Order‐Optimal Preconditioners for Implicit Runge–Kutta Schemes Applied to Parabolic PDEs journal January 2007
Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations journal April 2017
A Flexible Inner-Outer Preconditioned GMRES Algorithm journal March 1993
An explicit expression for the penalty parameter of the interior penalty method journal May 2005
On the implementation of implicit Runge-Kutta methods journal September 1976
Multigrid Methods for Implicit Runge--Kutta and Boundary Value Method Discretizations of Parabolic PDEs journal January 2005
An Interior Penalty Finite Element Method with Discontinuous Elements journal August 1982
Preconditioners for the Discontinuous Galerkin time-stepping method of arbitrary order journal June 2017
Runge-Kutta methods with a multiple real eigenvalue only journal December 1976
Efficiently Implementable Algebraically Stable Runge–Kutta Methods journal April 1982
Nonsymmetric Algebraic Multigrid Based on Local Approximate Ideal Restriction ($\ell$AIR) journal January 2018
Finite-Element Preconditioning of G-NI Spectral Methods journal January 2010
Triangularly Implicit Iteration Methods for ODE-IVP Solvers journal January 1997
On computing upper and lower bounds on the outputs of linear elasticity problems approximated by the smoothed finite element method journal January 2010
Real pole approximations to the exponential function journal March 1991
Approximating Runge-Kutta matrices by triangular matrices journal June 1997
Robust and efficient preconditioners for the discontinuous Galerkin time-stepping method journal October 2016
Flexible Conjugate Gradients journal January 2000
Analysis of a New Space-Time Parallel Multigrid Algorithm for Parabolic Problems preprint January 2014
Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods text January 2019
Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs, Part II: nonlinearities and DAEs preprint January 2021

Cited By (1)