Math. Model. Nat. Phenom.
Volume 6, Number 3, 2011Computational aerodynamics
|Page(s)||84 - 96|
|Published online||16 May 2011|
From h to p Efficiently: Selecting the Optimal Spectral/hp Discretisation in Three Dimensions
Department of Mathematics, Imperial College London, London, SW7
2 Department of Aeronautics, Imperial College London, London, SW7 2AZ, UK
3 School of Computing, University of Utah, Salt Lake City, Utah, USA
4 Department of Computing, Imperial College London, London, SW7 2AZ, UK
⋆ Corresponding author. E-mail:
There is a growing interest in high-order finite and spectral/hp element methods using continuous and discontinuous Galerkin formulations. In this paper we investigate the effect of h- and p-type refinement on the relationship between runtime performance and solution accuracy. The broad spectrum of possible domain discretisations makes establishing a performance-optimal selection non-trivial. Through comparing the runtime of different implementations for evaluating operators over the space of discretisations with a desired solution tolerance, we demonstrate how the optimal discretisation and operator implementation may be selected for a specified problem. Furthermore, this demonstrates the need for codes to support both low- and high-order discretisations.
Key words: element / optimisation / code performance
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.