Communications on Applied Mathematics and Computation ›› 2026, Vol. 8 ›› Issue (1): 248-268.doi: 10.1007/s42967-024-00428-4

• ORIGINAL PAPERS • Previous Articles     Next Articles

Fast and High-Order Approximation of Parabolic Equations Using Hierarchical Direct Solvers and Implicit Runge-Kutta Methods

Ke Chen1, Daniel Appelö2, Tracy Babb3, Per-Gunnar Martinsson4   

  1. 1. Department of Mathematics, University of Maryland, 4176 Campus Drive, College Park, 20742, MD, USA;
    2. Department of Mathematics, Virginia Tech., 225 Stanger Street, Blacksburg, 24061, VA, USA;
    3. Department of Applied Mathematics, University of Colorado Boulder, 2300 Colorado Avenue, Boulder, 80309, CO, USA;
    4. Department of Mathematics, University of Texas at Austin, 2515 Speedway, Austin, 78712, TX, USA
  • Received:2023-06-06 Revised:2024-04-03 Online:2026-02-20 Published:2026-02-11
  • Contact: Ke Chen,E-mail:kechen@umd.edu,kechen@udel.edu E-mail:kechen@umd.edu,kechen@udel.edu
  • Supported by:
    This work was supported in part by the NSF Grants DMS-2208164, DMS-2210286 (DA) and DMS-1952735, DMS-2012606 (PGM). The work of PGM was also supported by the Office of Naval Research (N00014-18-1-2354) and by the Department of Energy ASCR (DE-SC0022251).

Abstract: A stable and high-order accurate solver for linear and nonlinear parabolic equations is presented. An additive Runge-Kutta method is used for the time stepping, which integrates the linear stiff terms by an explicit singly diagonally implicit Runge-Kutta (ESDIRK) method and the nonlinear terms by an explicit Runge-Kutta (ERK) method. In each time step, the implicit solution is performed by the recently developed Hierarchical Poincaré-Steklov (HPS) method. This is a fast direct solver for elliptic equations that decomposes the space domain into a hierarchical tree of subdomains and builds spectral collocation solvers locally on the subdomains. These ideas are naturally combined in the presented method since the singly diagonal coefficient in ESDIRK and a fixed time step ensures that the coefficient matrix in the implicit solution of HPS remains the same for all time stages. This means that the precomputed inverse can be efficiently reused, leading to a scheme with complexity (in two dimensions) $\mathcal{O}\left(N^{1.5}\right)$ for the precomputation where the solution operator to the elliptic problems is built, and then $\mathcal{O}(N \log N)$ for the solution in each time step. The stability of the method is proved for first order in time and any order in space, and numerical evidence substantiates a claim of the stability for a much broader class of time discretization methods. Numerical experiments supporting the accuracy of the efficiency of the method in one and two dimensions are presented.

Key words: Explicit singly diagonally implicit Runge-Kutta (ESDIRK), Parabolic, Direct solver, High-order, Hierarchical

CLC Number: