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

DOI10.1137/S0097539792240121MaRDI QIDQ4376166zbMATH OpenOpenAlexFDO

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

(29)

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

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)