Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
type: Item
instance of: scholarly article
title: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
zbMATH Open document ID: 0896.65094
DOI: 10.1137/S0097539792240121
author: Dennis Healy
author: Daniel N. Rockmore
author: James R. Driscoll
published in: SIAM Journal on Computing
publication date: 1998-02-10T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 42C05
Mathematics Subject Classification ID: 42-04
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 42C10
zbMATH DE Number: 1116355
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: FFT
zbMATH Keywords: discrete polynomial transform
zbMATH Keywords: orthogonal polynomials
zbMATH Keywords: three-term recurrence
zbMATH Keywords: distance transitive graph
zbMATH Keywords: fast algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: s0097539792240121
OpenAlex ID: W2149599446
Recommended article: Fast algorithms for discrete polynomial transforms
Recommended article: A fast Fourier transform for the Johnson graph
Recommended article: Fast discrete transforms by means of eigenpolynomials
Recommended article: Algebraic Signal Processing Theory: Cooley–Tukey-Type Algorithms for Polynomial Transforms Based on Induction
Recommended article: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
description: scientific article; zbMATH DE number 1116355