Volume 9, Issue 5
A Memory-Saving Algorithm for Spectral Method of Three-Dimensional Homogeneous Isotropic Turbulence

Qing-Dong Cai & Shiyi Chen

Commun. Comput. Phys., 9 (2011), pp. 1152-1164.

Published online: 2011-05

Preview Full PDF 215 1139
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{CiCP-9-1152, 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 = {

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.

}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.191209.111110s}, url = {http://global-sci.org/intro/article_detail/cicp/7543.html} }
TY - JOUR T1 - A Memory-Saving Algorithm for Spectral Method of Three-Dimensional Homogeneous Isotropic Turbulence JO - Communications in Computational Physics VL - 5 SP - 1152 EP - 1164 PY - 2011 DA - 2011/05 SN - 9 DO - http://dor.org/10.4208/cicp.191209.111110s UR - https://global-sci.org/intro/article_detail/cicp/7543.html KW - AB -

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.

Qing-Dong Cai & Shiyi Chen. (2020). A Memory-Saving Algorithm for Spectral Method of Three-Dimensional Homogeneous Isotropic Turbulence. Communications in Computational Physics. 9 (5). 1152-1164. doi:10.4208/cicp.191209.111110s
Copy to clipboard
The citation has been copied to your clipboard