The Continuous Graph FFT

2008/08/15 by Robert Carlson, Carlson, Robert
Computer Science · Mathematics · #34B45 #65T50 #Algorithm #Classical Analysis and ODEs (math.CA) #Computer science #FOS: Mathematics #Fast Fourier transform #Graph #Graph theory and applications #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Spectral Theory in Mathematical Physics #Theoretical computer science

paper · pdf · doi:10.48550/arxiv.0808.2172

published in arXiv (Cornell University) (Cornell University)

openalex publication_date 2008/08/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.

Citations

• Spectral graph theory [CBMS Conference on Recent Advances in Spectral Graph Theory held at California State University at Fresno, June 6 - 10. 1994]
• Modern Graph Theory

Related

• DCTs, DSTs and transforms on path graphs: History and recent results
• A quantum graph FFT with applications to partial differential equations on networks
• Analyzing the Approximation Error of the Fast Graph Fourier Transform
• The right way to teach the FFT
• Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph