Efficient entropy-stable discontinuous spectral-element methods using tensor-product summation-by-parts operators on triangles and tetrahedra

We present a new class of efficient and robust discontinuous spectral-element methods of arbitrary order for nonlinear hyperbolic systems of conservation laws on curved triangular and tetrahedral unstructured grids. Such discretizations employ a recently introduced family of sparse tensor-product summation-by-parts (SBP) operators in collapsed coordinates within an entropy-conservative modal formulation, which is rendered entropy stable when a dissipative numerical flux is used at element interfaces. The proposed algorithms exploit the structure of such SBP operators alongside that of the Proriol–Koornwinder–Dubiner polynomial basis used to represent the numerical solution on the reference triangle or tetrahedron, and a weight-adjusted approximation is employed in order to efficiently invert the local mass matrix for curvilinear elements. Using such techniques, we obtain an improvement in time complexity from O ( p 2 d ) to O ( p d + 1 ) relative to existing entropy-stable formulations using multidimensional SBP operators not possessing such a tensor-product structure, where p is the polynomial degree of the approximation and d is the number of spatial dimensions. The number of required entropy-conservative two-point flux evaluations between pairs of quadrature nodes is accordingly reduced by a factor ranging from 1.56 at p = 2 to 4.57 at p = 10 for triangles, and from 1.88 at p = 2 to 10.99 at p = 10 for tetrahedra. Through numerical experiments involving smooth solutions to the compressible Euler equations on isoparametric triangular and tetrahedral grids, the proposed methods using tensor-product SBP operators are shown to exhibit similar levels of accuracy for a given mesh and polynomial degree to those using multidimensional operators based on symmetric quadrature rules, with both approaches achieving order p + 1 convergence with respect to the element size in the presence of interface dissipation as well as exponential convergence with respect to the polynomial degree. Furthermore, both operator families are shown to give rise to entropy-stable schemes which exhibit excellent robustness for test problems characteristic of under-resolved turbulence simulations. Such results suggest that the algorithmic advantages resulting from the use of tensor-product operators are obtained without compromising accuracy or robustness, enabling the efficient extension of the benefits of entropy stability to higher polynomial degrees than previously considered for triangular and tetrahedral elements. • We introduce new entropy-stable spectral-element methods for triangles and tetrahedra. • The methods use tensor-product summation-by-parts operators in collapsed coordinates. • We describe efficient algorithms exploiting sum factorization and operator sparsity. • The schemes are proven to be conservative, free-stream preserving, and entropy stable. • We numerically verify the schemes' accuracy and robustness for the Euler equations.

Authors

Institutions

Publication Details

Journal
Journal of Computational Physics
Published
2024-08-22
DOI
https://doi.org/10.1016/j.jcp.2024.113360
Citations
10
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
3.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient entropy-stable discontinuous spectral-element methods using tensor-product summation-by-parts operators on triangles and tetrahedra

Tristan Montoya, David W. Zingg
10 citations
Journal of Computational Physics
Advanced Numerical Methods in Computational Mathematics
3.75
article

Efficient entropy-stable discontinuous spectral-element methods using tensor-product summation-by-parts operators on triangles and tetrahedra

Tristan Montoya, David W. Zingg
article en
10 citations

Abstract

We present a new class of efficient and robust discontinuous spectral-element methods of arbitrary order for nonlinear hyperbolic systems of conservation laws on curved triangular and tetrahedral unstructured grids. Such discretizations employ a recently introduced family of sparse tensor-product summation-by-parts (SBP) operators in collapsed coordinates within an entropy-conservative modal formulation, which is rendered entropy stable when a dissipative numerical flux is used at element interfaces. The proposed algorithms exploit the structure of such SBP operators alongside that of the Proriol–Koornwinder–Dubiner polynomial basis used to represent the numerical solution on the reference triangle or tetrahedron, and a weight-adjusted approximation is employed in order to efficiently invert the local mass matrix for curvilinear elements. Using such techniques, we obtain an improvement in time complexity from O ( p 2 d ) to O ( p d + 1 ) relative to existing entropy-stable formulations using multidimensional SBP operators not possessing such a tensor-product structure, where p is the polynomial degree of the approximation and d is the number of spatial dimensions. The number of required entropy-conservative two-point flux evaluations between pairs of quadrature nodes is accordingly reduced by a factor ranging from 1.56 at p = 2 to 4.57 at p = 10 for triangles, and from 1.88 at p = 2 to 10.99 at p = 10 for tetrahedra. Through numerical experiments involving smooth solutions to the compressible Euler equations on isoparametric triangular and tetrahedral grids, the proposed methods using tensor-product SBP operators are shown to exhibit similar levels of accuracy for a given mesh and polynomial degree to those using multidimensional operators based on symmetric quadrature rules, with both approaches achieving order p + 1 convergence with respect to the element size in the presence of interface dissipation as well as exponential convergence with respect to the polynomial degree. Furthermore, both operator families are shown to give rise to entropy-stable schemes which exhibit excellent robustness for test problems characteristic of under-resolved turbulence simulations. Such results suggest that the algorithmic advantages resulting from the use of tensor-product operators are obtained without compromising accuracy or robustness, enabling the efficient extension of the benefits of entropy stability to higher polynomial degrees than previously considered for triangular and tetrahedral elements. • We introduce new entropy-stable spectral-element methods for triangles and tetrahedra. • The methods use tensor-product summation-by-parts operators in collapsed coordinates. • We describe efficient algorithms exploiting sum factorization and operator sparsity. • The schemes are proven to be conservative, free-stream preserving, and entropy stable. • We numerically verify the schemes' accuracy and robustness for the Euler equations.

Journal of Computational PhysicsVol. 516
University of Toronto (CA)
Ontario Research Foundation, Government of Ontario, Canada Foundation for Innovation, University of Toronto, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 6%
Advanced Numerical Methods in Computational Mathematics
3.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.