2015/12/18 by Jesse Chan, Chan, Jesse, Tim Warburton +1
Engineering · Mathematics · #Advanced Numerical Methods in Computational Mathematics #Electromagnetic Simulation and Numerical Methods #FOS: Mathematics #Numerical Analysis (math.NA) #Numerical methods for differential equations
paper · pdf · doi:10.48550/arxiv.1512.06025
openalex publication_date 2015/12/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We evaluate the computational performance of the Bernstein-Bezier basis for discontinuous Galerkin (DG) discretizations and show how to exploit properties of derivative and lift operators specific to Bernstein polynomials for an optimal complexity quadrature-free evaluation of the DG formulation. Issues of efficiency and numerical stability are discussed in the context of a model wave propagation problem. We compare the performance of Bernstein-Bezier kernels to both a straightforward and a block-partitioned implementation of nodal DG kernels in a time-explicit GPU-accelerated DG solver. Computational experiments confirm the advantage of Bernstein-Bezier DG kernels over both straightforward and block-partitioned nodal DG kernels at high orders of approximation.