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 …

Given the high algorithmic complexity of applied‐to‐images Fast Fourier Transforms (FFT),
computational‐resource‐usage efficiency has been a challenge in several engineering …

In the scientific literature, the study of the impact of the fracture contact area on macro-
dispersion in single rough fractures is still an open question. In this work, we study …

This study revisits bounds on the projection of the global attractor in the energy–enstrophy
plane for 2D incompressible turbulence [Dascaliuc, Foias, and Jolly, 2005, 2010]. In addition …

In this paper, we have developed an efficient volume penalization based diffuse-filtering
scheme to solve variable mobility based Cahn–Hilliard equation in complex geometries. The …

Abstract Characterization of flow topology is essential to understand the effects of the
heterogeneity and dimensionality of geological formations on the mixing of inert solute …

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 …

Given the high algorithmic complexity of applied-to-images Fast Fourier Transforms (FFT),
computational-resource-usage efficiency has been a challenge in several engineering …

How to Design an Efficient Pseudospectral Code Page 1 How to Design an Efficient
Pseudospectral Code John C. Bowman University of Alberta June 11, 2019 www.math.ualberta.ca/∼bowman/talks …