Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T14:44:48.792Z Has data issue: false hasContentIssue false

From h to p Efficiently: Selecting the OptimalSpectral/hp Discretisation in Three Dimensions

Published online by Cambridge University Press:  16 May 2011

C. D. Cantwell*
Affiliation:
Department of Mathematics, Imperial College London, London, SW7 2AZ, UK
S. J. Sherwin
Affiliation:
Department of Aeronautics, Imperial College London, London, SW7 2AZ, UK
R. M. Kirby
Affiliation:
School of Computing, University of Utah, Salt Lake City, Utah, USA
P. H. J. Kelly
Affiliation:
Department of Computing, Imperial College London, London, SW7 2AZ, UK
*
⋆ Corresponding author. E-mail:c.cantwell@imperial.ac.uk

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

There is a growing interest in high-order finite and spectral/hp elementmethods using continuous and discontinuous Galerkin formulations. In this paper weinvestigate the effect of h- and p-type refinement onthe relationship between runtime performance and solution accuracy. The broad spectrum ofpossible domain discretisations makes establishing a performance-optimal selectionnon-trivial. Through comparing the runtime of different implementations for evaluatingoperators over the space of discretisations with a desired solution tolerance, wedemonstrate how the optimal discretisation and operator implementation may be selected fora specified problem. Furthermore, this demonstrates the need for codes to support bothlow- and high-order discretisations.

Information

Type
Research Article
Copyright
© EDP Sciences, 2011