Accidental ground state degeneracies—those not a consequence of global symmetries of
the Hamiltonian—are inevitably lifted by fluctuations, often leading to long-range order, a …

Algorithms are developed for calculating dealiased linear convolution sums without the
expense of conventional zero-padding or phase-shift techniques. For one-dimensional in …

An efficient algorithm for computing the one-dimensional partial fast Fourier transform f_j= ∑
_ k= 0^ c (j) e^ 2 π ijk/N F_k fj=∑ k= 0 c (j) e 2 π ijk/NF k is presented. Naive computation of …

Efficient algorithms based on the fast Fourier transform are developed for computing linear
convolutions. A hybrid approach is described that combines the conventional practice of …

In addition to conserving energy and enstrophy, the nonlinear terms of the two-dimensional
incompressible Navier–Stokes equation are well known to conserve the global integral of …

Efficient algorithms have recently been developed for calculating dealiased linear
convolution sums without the expense of conventional zero-padding or phase-shift …

An adaptive parallel matrix transpose algorithm optimized for distributed multicore
architectures running in a hybrid OpenMP/MPI configuration is presented. Significant boosts …

Turbulence is a chaotic motion of fluid that can be described by the Navier–Stokes
equations or even highly simplified shell models. Under the continuum limit, standard shell …

Efficient algorithms for computing linear convolutions based on the fast Fourier transform are
developed. A hybrid approach is described that combines the conventional practice of …

Spectral reduction was originally formulated entirely in the wavenumber domain as a coarse-
grained wavenumber convolution in which bins of modes interact with enhanced coupling …