Orthogonal bases for vertex-mapped pyramids

From MaRDI portal
Publication:2804996

DOI10.1137/15M1011408zbMATH Open1416.65438arXiv1502.07703MaRDI QIDQ2804996FDOQ2804996


Authors: Jesse Chan, T. Warburton Edit this on Wikidata


Publication date: 9 May 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: Discontinuous Galerkin (DG) methods discretized under the method of lines must handle the inverse of a block diagonal mass matrix at each time step. Efficient implementations of the DG method hinge upon inexpensive and low-memory techniques for the inversion of each dense mass matrix block. We propose an efficient time-explicit DG method on meshes of pyramidal elements based on the construction of a semi-nodal high order basis, which is orthogonal for a class of transformations of the reference pyramid, despite the non-affine nature of the mapping. We give numerical results confirming both expected convergence rates and discuss efficiency of DG methods under such a basis.


Full work available at URL: https://arxiv.org/abs/1502.07703




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: Orthogonal bases for vertex-mapped pyramids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804996)