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

Title: Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

Abstract

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O(p2d) storage and O(p3d) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O(pd+1) storage, O(pd+1) work in two spatial dimensions, and O(pd+2) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O(p9) to O(p5) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p.

Authors:
ORCiD logo [1];  [2]
  1. Brown Univ., Providence, RI (United States). Div. of Applied Mathematics
  2. Univ. of California, Berkeley, CA (United States). Dept. of Mathematics
Publication Date:
Research Org.:
Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)
Sponsoring Org.:
USDOE Office of Science (SC)
OSTI Identifier:
1526501
Alternate Identifier(s):
OSTI ID: 1576607
Grant/Contract Number:  
AC02-05CH11231
Resource Type:
Accepted Manuscript
Journal Name:
Journal of Computational Physics
Additional Journal Information:
Journal Volume: 354; Journal Issue: C; Journal ID: ISSN 0021-9991
Publisher:
Elsevier
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Preconditioners; Discontinuous Galerkin method; Matrix-free

Citation Formats

Pazner, Will, and Persson, Per -Olof. Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods. United States: N. p., 2017. Web. https://doi.org/10.1016/j.jcp.2017.10.030.
Pazner, Will, & Persson, Per -Olof. Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods. United States. https://doi.org/10.1016/j.jcp.2017.10.030
Pazner, Will, and Persson, Per -Olof. Fri . "Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods". United States. https://doi.org/10.1016/j.jcp.2017.10.030. https://www.osti.gov/servlets/purl/1526501.
@article{osti_1526501,
title = {Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods},
author = {Pazner, Will and Persson, Per -Olof},
abstractNote = {In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O(p2d) storage and O(p3d) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O(pd+1) storage, O(pd+1) work in two spatial dimensions, and O(pd+2) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O(p9) to O(p5) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p.},
doi = {10.1016/j.jcp.2017.10.030},
journal = {Journal of Computational Physics},
number = C,
volume = 354,
place = {United States},
year = {2017},
month = {11}
}

Journal Article:

Citation Metrics:
Cited by: 6 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
journal, December 1977

  • Alexander, Roger
  • SIAM Journal on Numerical Analysis, Vol. 14, Issue 6
  • DOI: 10.1137/0714068

Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems
journal, January 2002

  • Arnold, Douglas N.; Brezzi, Franco; Cockburn, Bernardo
  • SIAM Journal on Numerical Analysis, Vol. 39, Issue 5
  • DOI: 10.1137/S0036142901384162

Preconditioning for modal discontinuous Galerkin methods for unsteady 3D Navier–Stokes equations
journal, May 2013


Assessment of a discontinuous Galerkin method for the simulation of vortical flows at high Reynolds number: SIMULATION OF VORTICAL FLOW AT HIGH REYNOLDS NUMBER USING DGM
journal, November 2013

  • Carton de Wiart, C.; Hillewaert, K.; Duponcheel, M.
  • International Journal for Numerical Methods in Fluids, Vol. 74, Issue 7
  • DOI: 10.1002/fld.3859

The Local Discontinuous Galerkin Method for Time-Dependent Convection-Diffusion Systems
journal, December 1998


The Runge–Kutta Discontinuous Galerkin Method for Conservation Laws V
journal, April 1998

  • Cockburn, Bernardo; Shu, Chi-Wang
  • Journal of Computational Physics, Vol. 141, Issue 2
  • DOI: 10.1006/jcph.1998.5892

An implicit matrix-free Discontinuous Galerkin solver for viscous and turbulent aerodynamic simulations
journal, November 2011


Tensor-product preconditioners for higher-order space–time discontinuous Galerkin methods
journal, February 2017


A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
journal, June 1981

  • Golub, Gene H.; Luk, Franklin T.; Overton, Michael L.
  • ACM Transactions on Mathematical Software, Vol. 7, Issue 2
  • DOI: 10.1145/355945.355946

A multilevel discontinuous Galerkin method
journal, September 2003


The CFL condition for spectral approximations to hyperbolic initial-boundary value problems
journal, May 1991


Efficient Implementation of Weighted ENO Schemes
journal, June 1996

  • Jiang, Guang-Shan; Shu, Chi-Wang
  • Journal of Computational Physics, Vol. 126, Issue 1
  • DOI: 10.1006/jcph.1996.0130

Robust smoothers for high-order discontinuous Galerkin discretizations of advection–diffusion problems
journal, August 2008


An analysis of the spectrum of the discontinuous Galerkin method
journal, February 2013


Comparison of implicit and explicit hybridizable discontinuous Galerkin methods for the acoustic wave equation: IMPLICIT VERSUS EXPLICIT HDG
journal, October 2015

  • Kronbichler, M.; Schoeder, S.; Müller, C.
  • International Journal for Numerical Methods in Engineering, Vol. 106, Issue 9
  • DOI: 10.1002/nme.5137

The ubiquitous Kronecker product
journal, November 2000


Direct solution of partial difference equations by tensor product methods
journal, December 1964

  • Lynch, Robert E.; Rice, John R.; Thomas, Donald H.
  • Numerische Mathematik, Vol. 6, Issue 1
  • DOI: 10.1007/BF01386067

Order‐Optimal Preconditioners for Implicit Runge–Kutta Schemes Applied to Parabolic PDEs
journal, January 2007

  • Mardal, K. ‐A.; Nilssen, T. K.; Staff, G. A.
  • SIAM Journal on Scientific Computing, Vol. 29, Issue 1
  • DOI: 10.1137/05064093X

Spectral methods for problems in complex geometries
journal, August 1980


Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier–Stokes Equations
journal, January 2008

  • Persson, P. -O.; Peraire, J.
  • SIAM Journal on Scientific Computing, Vol. 30, Issue 6
  • DOI: 10.1137/070692108

Numerical Convergence Study of Nearly Incompressible, Inviscid Taylor–Green Vortex Flow
journal, July 2005

  • Shu, Chi-Wang; Don, Wai-Sun; Gottlieb, David
  • Journal of Scientific Computing, Vol. 24, Issue 1
  • DOI: 10.1007/s10915-004-5407-y

E pur si muove: Galilean-invariant cosmological hydrodynamical simulations on a moving mesh
journal, January 2010


A comparison of vortex and pseudo-spectral methods for the simulation of periodic vortical flows at high Reynolds numbers
journal, April 2011

  • van Rees, Wim M.; Leonard, Anthony; Pullin, D. I.
  • Journal of Computational Physics, Vol. 230, Issue 8
  • DOI: 10.1016/j.jcp.2010.11.031

From h to p efficiently: Implementing finite and spectral/hp element methods to achieve optimal performance for low- and high-order discretisations
journal, July 2010

  • Vos, Peter E. J.; Sherwin, Spencer J.; Kirby, Robert M.
  • Journal of Computational Physics, Vol. 229, Issue 13
  • DOI: 10.1016/j.jcp.2010.03.031

High-order CFD methods: current status and perspective: HIGH-ORDER CFD METHODS
journal, January 2013

  • Wang, Z. J.; Fidkowski, Krzysztof; Abgrall, Rémi
  • International Journal for Numerical Methods in Fluids, Vol. 72, Issue 8
  • DOI: 10.1002/fld.3767

Taming the CFL Number for Discontinuous Galerkin Methods on Structured Meshes
journal, January 2008

  • Warburton, T.; Hagstrom, T.
  • SIAM Journal on Numerical Analysis, Vol. 46, Issue 6
  • DOI: 10.1137/060672601

An optimization-based framework for anisotropic simplex mesh adaptation
journal, September 2012


    Works referencing / citing this record:

    Analysis and Entropy Stability of the Line-Based Discontinuous Galerkin Method
    journal, March 2019