Multithreaded Impliclty Dealiased Convolutions for Pseudospectral Simulations
ORAL
Abstract
Convolutions form the crux of the pseudospectral method for direct numerical simulations of nonlinear PDEs such as the Navier--Stokes equations and magnetohydrodynamic flows. The computation of convolutions is an expensive task that is facilitated by the use of the convolution theorem and FFTs. However, input data must be zero-padded in order to remove aliased terms and recover a linear convolution. Here, we present a multithreaded version of the method of implicit dealiasing (Bowman and Roberts, SIAM J. Sci. Comput. 33, 2011). Implicit dealiasing has computational complexity identical to the conventional zero-padding technique, but is twice as fast in practice and requires $(2/3)^{d-1}$ the memory of a conventional $d$-dimensional centred convolution. High-performance implicitly dealiased convolution routines are available under the LGPL at \texttt{fftwpp.sourceforge.net}.
–
Authors
-
Malcolm Roberts
Aix-Marseille University
-
John C. Bowman
University of Alberta