FFTArray: A Python Library for the Implementation of Discretized Multi-Dimensional Fourier Transforms

• URL: http://arxiv.org/abs/2508.03697v2
• Date: Thu, 04 Sep 2025 11:37:54 GMT
• Title: FFTArray: A Python Library for the Implementation of Discretized Multi-Dimensional Fourier Transforms
• Authors: Stefan J. Seckmeyer, Christian Struckmann, Gabriel Müller, Jan-Niclas Kirsten-Siemß, Naceur Gaaloul,
• Abstract summary: We present FFTArray, a Python library that automates the general discretization of Fourier transforms.<n>Built on the Python Array API Standard, FFTArray integrates seamlessly with array backends like NumPy, JAX and PyTorch.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Partial differential equations describing the dynamics of physical systems rarely have closed-form solutions. Fourier spectral methods, which use Fast Fourier Transforms (FFTs) to approximate solutions, are a common approach to solving these equations. However, mapping Fourier integrals to discrete FFTs is not straightforward, as the selection of the grid as well as the coordinate-dependent phase and scaling factors require special care. Moreover, most software packages that deal with this step integrate it tightly into their full-stack implementations. Such an integrated design sacrifices generality, making it difficult to adapt to new coordinate systems, boundary conditions, or problem-specific requirements. To address these challenges, we present FFTArray, a Python library that automates the general discretization of Fourier transforms. Its purpose is to reduce the barriers to developing high-performance, maintainable code for pseudo-spectral Fourier methods. Its interface enables the direct translation of textbook equations and complex research problems into code, and its modular design scales naturally to multiple dimensions. This makes the definition of valid coordinate grids straightforward, while coordinate grid specific corrections are applied with minimal impact on computational performance. Built on the Python Array API Standard, FFTArray integrates seamlessly with array backends like NumPy, JAX and PyTorch and supports Graphics Processing Unit acceleration. The code is openly available at https://github.com/QSTheory/fftarray under Apache-2.0 license.

Related papers

• scipy.spatial.transform: Differentiable Framework-Agnostic 3D Transformations in Python [49.015684860172975]
  Three-dimensional rigid-body transforms, i.e. rotations and translations, are central to modern differentiable machine learning pipelines.<n> SciPy's spatial$.$diff module is a rigorously tested Python implementation.<n>We present a complete overhaul of SciPy's spatial$.$transform functionality that makes it compatible with any array library implementing the Python array API.
  arXiv  Detail & Related papers  (2025-11-22T18:52:34Z)
• Memory-Efficient Training with In-Place FFT Implementation [5.474695910716561]
  Existing implementations, including standard FFT and real FFT, cannot achieve true in-place computation.<n>We propose the first real-domain, fully in-place FFT framework (rdFFT) that preserves input-output memory space consistency.
  arXiv  Detail & Related papers  (2025-11-03T09:36:11Z)
• Variable-size Symmetry-based Graph Fourier Transforms for image compression [65.7352685872625]
  We propose a new family of Symmetry-based Graph Fourier Transforms of variable sizes into a coding framework. Our proposed algorithm generates symmetric graphs on the grid by adding specific symmetrical connections between nodes. Experiments show that SBGFTs outperform the primary transforms integrated in the explicit Multiple Transform Selection.
  arXiv  Detail & Related papers  (2024-11-24T13:00:44Z)
• Group Equivariant Fourier Neural Operators for Partial Differential Equations [33.71890280061319]
  We consider solving partial differential equations with Fourier neural operators (FNOs) In this work, we extend group convolutions to the frequency domain and design Fourier layers that are equivariant to rotations, translations, and reflections. The resulting $G$-FNO architecture generalizes well across input resolutions and performs well in settings with varying levels of symmetry.
  arXiv  Detail & Related papers  (2023-06-09T06:34:16Z)
• Fourier Continuation for Exact Derivative Computation in Physics-Informed Neural Operators [53.087564562565774]
  PINO is a machine learning architecture that has shown promising empirical results for learning partial differential equations. We present an architecture that leverages Fourier continuation (FC) to apply the exact gradient method to PINO for nonperiodic problems.
  arXiv  Detail & Related papers  (2022-11-29T06:37:54Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• FFTc: An MLIR Dialect for Developing HPC Fast Fourier Transform Libraries [1.181206257787103]
  We introduce FFTc, a domain-specific language for expressing Fourier Transform algorithms. We present the initial design, implementation, and preliminary results of FFTc.
  arXiv  Detail & Related papers  (2022-07-14T10:31:21Z)
• Softmax-free Linear Transformers [90.83157268265654]
  Vision transformers (ViTs) have pushed the state-of-the-art for visual perception tasks. Existing methods are either theoretically flawed or empirically ineffective for visual recognition. We propose a family of Softmax-Free Transformers (SOFT)
  arXiv  Detail & Related papers  (2022-07-05T03:08:27Z)
• Gaussian Fourier Pyramid for Local Laplacian Filter [0.6117371161379208]
  Several edge-preserving decompositions resolve halos, e.g., local Laplacian filtering (LLF) An approximated acceleration of fast LLF was proposed to linearly interpolate multiple Laplacian pyramids. Our results showed that Fourier LLF has a higher accuracy for the same number of pyramids.
  arXiv  Detail & Related papers  (2022-06-08T20:50:42Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Fast Partial Fourier Transform [28.36925669222461]
  Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify one's demand. In this paper, we propose a fast Partial Fourier Transform (PFT), a careful modification of the Cooley-Tukey algorithm that enables one to specify an arbitrary consecutive range where the coefficients should be computed.
  arXiv  Detail & Related papers  (2020-08-28T10:01:49Z)
• Region adaptive graph fourier transform for 3d point clouds [51.193111325231165]
  We introduce the Region Adaptive Graph Fourier Transform (RA-GFT) for compression of 3D point cloud attributes. The RA-GFT achieves better complexity-performance trade-offs than previous approaches.
  arXiv  Detail & Related papers  (2020-03-04T02:47:44Z)
• DFTpy: An efficient and object-oriented platform for orbital-free DFT simulations [55.41644538483948]
  In this work, we present DFTpy, an open source software implementing OFDFT written entirely in Python 3. We showcase the electronic structure of a million-atom system of aluminum metal which was computed on a single CPU. DFTpy is released under the MIT license.
  arXiv  Detail & Related papers  (2020-02-07T19:07:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.