Abstract

To evaluate the computational performance of high‐order elements, a comparison based on operation count is proposed instead of runtime comparisons. More specifically, linear versus high‐order approximations are analyzed for implicit solver under a standard set of hypotheses for the mesh and the solution. Continuous and discontinuous Galerkin methods are considered in two‐dimensional and three‐dimensional domains for simplices and parallelotopes. Moreover, both element‐wise and global operations arising from different Galerkin approaches are studied. The operation count estimates show, that for implicit solvers, high‐order methods are more efficient than linear ones.

Full Document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top

Document information

Published on 01/01/2013

DOI: 10.1002/nme.4547
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?