Metraipolis › archive › dc_69288bef0176

Mathematical foundation of symmetric fast Fourier transform — arXiv:2610.11972

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11972
License (as archived)
CC0-1.0
Archived
2026-10-09T06:28:44.403Z
SHA-256 of the archived text
210357d482fc9c925a5afde216dcc37d4da45aa1416a036b61809dc7eb8a1d7c
Stable URL of this page
https://metraipolis.com/documento/dc_69288bef0176

How to cite

Mathematical foundation of symmetric fast Fourier transform — arXiv:2610.11972 — arXiv (en), https://arxiv.org/abs/2610.11972 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69288bef0176 (Metraipolis archive dc_69288bef0176, sha256 210357d482fc9c925a5afde216dcc37d4da45aa1416a036b61809dc7eb8a1d7c)
BibTeX
@misc{dc69288bef0176,
  title = {Mathematical foundation of symmetric fast Fourier transform — arXiv:2610.11972},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11972},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69288bef0176; sha256 210357d482fc9c925a5afde216dcc37d4da45aa1416a036b61809dc7eb8a1d7c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11972. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this work, we study the fast Fourier transform (FFT) of discrete data with crystallographic symmetry, for which standard FFT algorithms incur substantial redundant computation. We establish a rigorous mathematical theory of the symmetric fast Fourier transform (SFFT) for $n$-dimensional crystallographic groups and propose the SFFT and symmetric inverse fast Fourier transform (SIFFT) algorithms. We derive symmetry-reduction formulas for both linear and translational symmetries and unify them into a recursive framework. We analyze the arithmetic complexity to obtain theoretical speedup factors relative to the standard FFT, and we confirm the accuracy and efficiency of the proposed methods by numerical experiments on representative three-dimensional space groups.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.11972 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:16.517Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).