@Article{CiCP-9-5,
author = {},
title = {A Memory-Saving Algorithm for Spectral Method of Three-Dimensional Homogeneous Isotropic Turbulence},
journal = {Communications in Computational Physics},
year = {2011},
volume = {9},
number = {5},
pages = {1152--1164},
abstract = {<p style="text-align: justify;">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 2048<sup>3</sup> grid can be implemented on a 256G distributed memory
clusters through this method.</p>},
issn = {1991-7120},
doi = {https://doi.org/10.4208/cicp.191209.111110s},
url = {https://global-sci.com/article/80892/a-memory-saving-algorithm-for-spectral-method-of-three-dimensional-homogeneous-isotropic-turbulence}
}