Year: 2011
Communications in Computational Physics, Vol. 9 (2011), Iss. 5 : pp. 1152–1164
Abstract
Homogeneous isotropic turbulence has been playing a key role in the research of turbulence theory. And the pseudo-spectral method is the most popular numerical method to simulate this type of flow fields in a periodic box, where fast Fourier transform (FFT) is mostly effective. However, the bottle-neck in this method is the memory of computer, which motivates us to construct a memory-saving algorithm for spectral method in present paper. Inevitably, more times of FFT are needed as compensation. In the most memory-saving situation, only 6 three-dimension arrays are employed in the code. The cost of computation is increased by a factor of 4, and that 38 FFTs are needed per time step instead of the previous 9 FFTs. A simulation of isotropic turbulence on 20483 grid can be implemented on a 256G distributed memory clusters through this method.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/cicp.191209.111110s
Communications in Computational Physics, Vol. 9 (2011), Iss. 5 : pp. 1152–1164
Published online: 2011-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 13
-
Accuracy and computational efficiency of dealiasing schemes for the DNS of under resolved flows with strong gradients
Sinhababu, Arijit
Ayyalasomayajula, Sathyanarayana
Mathematics and Computers in Simulation, Vol. 182 (2021), Iss. P.116
https://doi.org/10.1016/j.matcom.2020.10.020 [Citations: 4]