Spectral methods on triangles and other domains
Journal of Scientific Computing
Implementing and using high-order finite element methods
Finite Elements in Analysis and Design - Special issue: selection of papers presented at ICOSAHOM'92
Tetrahedral hp finite elements: algorithms and flow simulations
Journal of Computational Physics
SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing
Optimal Decomposition of the Domain in Spectral Methods for Wave-Like Phenomena
SIAM Journal on Scientific Computing
Nodal high-order methods on unstructured grids
Journal of Computational Physics
Nodal Discontinuous Galerkin Methods: Algorithms, Analysis, and Applications
Nodal Discontinuous Galerkin Methods: Algorithms, Analysis, and Applications
Journal of Computational Physics
A compatible and conservative spectral element method on unstructured grids
Journal of Computational Physics
High-order finite-element seismic wave propagation modeling with MPI on a large GPU cluster
Journal of Computational Physics
To CG or to HDG: A Comparative Study
Journal of Scientific Computing
Bernstein-Bézier Finite Elements of Arbitrary Order and Optimal Assembly Procedures
SIAM Journal on Scientific Computing
Journal of Computational Physics
Robust untangling of curvilinear meshes
Journal of Computational Physics
Architecting the finite element method pipeline for the GPU
Journal of Computational and Applied Mathematics
Vectorized OpenCL implementation of numerical integration for higher order finite elements
Computers & Mathematics with Applications
Journal of Computational Physics
Numerical integration on GPUs for higher order finite elements
Computers & Mathematics with Applications
Hi-index | 31.47 |
The spectral/hp element method can be considered as bridging the gap between the - traditionally low-order - finite element method on one side and spectral methods on the other side. Consequently, a major challenge which arises in implementing the spectral/hp element methods is to design algorithms that perform efficiently for both low- and high-order spectral/hp discretisations, as well as discretisations in the intermediate regime. In this paper, we explain how the judicious use of different implementation strategies can be employed to achieve high efficiency across a wide range of polynomial orders. Furthermore, based upon this efficient implementation, we analyse which spectral/hp discretisation (which specific combination of mesh-size h and polynomial order P) minimises the computational cost to solve an elliptic problem up to a predefined level of accuracy. We investigate this question for a set of both smooth and non-smooth problems.