FGFRFT splits the spectrum of a unitary GFT to treat λ=-1 exactly and approximates the complementary part by a length-L Fourier series, reducing online complexity to O(2 L N²) with derived error bounds.
Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FGFRFT: Fast Graph Fractional Fourier Transform via Exact Spectral Splitting and Fourier-Series Approximation
FGFRFT splits the spectrum of a unitary GFT to treat λ=-1 exactly and approximates the complementary part by a length-L Fourier series, reducing online complexity to O(2 L N²) with derived error bounds.