Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Transpose-free Fast Fourier Transform for Turbulence Simulation (1406.5597v1)

Published 21 Jun 2014 in cs.MS, cs.CE, cs.DS, physics.comp-ph, and physics.flu-dyn

Abstract: Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save operations during interprocess communications by avoiding transpose of the array. As a result, our transpose-free FFT is 15\% to 20\% faster than FFTW.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. A. G. Chatterjee (1 paper)
  2. M. K. Verma (3 papers)
  3. M. Chaudhuri (26 papers)

Summary

We haven't generated a summary for this paper yet.