arXiv (All)
open access
Mathematical foundation of symmetric fast Fourier transform
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 crystallo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Superfast Direct Solver for 2D Type-II Inverse Nonuniform Discrete Fourier Transform Based on Hierarchically Semiseparable Matrices#1109092
- Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support#784839
- Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support#783249
- Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support#618536
- MEGA: Object-Level Mesh Extraction from 3D Gaussian Splatting via Spatial Visual Distillation#1156978
Record · ID 1249252
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive