Harmonic analysis for graph refinements and the continuous graph FFT (Q1019728)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Harmonic analysis for graph refinements and the continuous graph FFT |
scientific article; zbMATH DE number 5561694
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Harmonic analysis for graph refinements and the continuous graph FFT |
scientific article; zbMATH DE number 5561694 |
Statements
Harmonic analysis for graph refinements and the continuous graph FFT (English)
0 references
4 June 2009
0 references
The discrete Fourier transforms (DFT) and their fast algorithms (FFT) are extended to continuous graphs with equal edge lengths. After a review of differential operators on continuous graphs, the spectral theory of standard Laplace differential operators for continuous graphs and their uniformly sampled subgraphs is explored. After these preliminaries, a continuous graph DFT is defined. Fast algorithms for this DFT and its inverse are described. Finally, an example is presented.
0 references
discrete Fourier transform
0 references
fast Fourier transform (FFT)
0 references
continuous graph FFT
0 references
graph spectral theory
0 references
graph refinements
0 references
harmonic analysis
0 references
numerical example
0 references
Laplace differential operators
0 references
