Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

DOI10.1137/S0097539792240121MaRDI QIDQ4376166zbMATHOpenAlexFDO

Authors Dennis Healy, Daniel N. Rockmore, James R. Driscoll

Publication date 10 February 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792240121

zbMATH Keywords

fast algorithmFFTfast Fourier transformorthogonal polynomialsdistance transitive graphthree-term recurrencediscrete polynomial transform

Mathematics Subject Classification ID

Distance in graphs (05C12) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical methods for discrete and fast Fourier transforms (65T50) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)

Recommendations

• Fast algorithms for discrete polynomial transforms
• A fast Fourier transform for the Johnson graph
• Fast discrete transforms by means of eigenpolynomials
• Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms

Cited in

(27)

• Fast algorithms using orthogonal polynomials
• FFTs on the rotation group
• Computational harmonic analysis for tensor fields on the two-sphere
• Nonreflecting boundary conditions for elastodynamic scattering
• Fast Fourier transforms for spherical Gauss-Laguerre basis functions
• Fast SGL Fourier transforms for scattered data
• Computation of far-field solutions based on exact nonreflecting boundary conditions for the time-dependent wave equation
• Algorithms for fast convolutions on motion groups
• Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
• Developement of a numerical procedure for direct simulations of turbulent convection in a closed rectangular cell
• A Hermite pseudospectral solver for two-dimensional incompressible flows on infinite domains
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Fast algorithms for discrete polynomial transforms
• Spectral radial basis functions for full sphere computations
• Harmonic analysis for graph refinements and the continuous graph FFT
• Fast spherical Fourier algorithms.
• Double coset decompositions and computational harmonic analysis on groups
• Efficient computation of Fourier transforms on compact groups
• A fast Hermite transform
• Fast and stable algorithms for discrete spherical Fourier transforms
• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
• Sparse Legendre expansions via \(\ell_1\)-minimization
• A note on stability results for scattered data interpolation on Euclidean spheres
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• Exchangeable pairs of Bernoulli random variables, Krawtchouck polynomials, and Ehrenfest urns
• Fast conversion algorithms for orthogonal polynomials
• Orthogonal polynomial expansions on sparse grids

This page was built for publication: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376166)