Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- 1 August 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 26 (4) , 1066-1099
- https://doi.org/10.1137/s0097539792240121
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Algorithms for Discrete Fourier Transform and ConvolutionPublished by Springer Nature ,1997
- Computing Fourier Transforms and Convolutions on the 2-SphereAdvances in Applied Mathematics, 1994
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluationLinear Algebra and its Applications, 1993
- Complexity of Computations with Matrices and PolynomialsSIAM Review, 1992
- On Scalar and Vector Transform Methods for Global Spectral ModelsMonthly Weather Review, 1991
- Some applications of Gelfand pairs to number theoryBulletin of the American Mathematical Society, 1991
- Classical Orthogonal Polynomials of a Discrete VariablePublished by Springer Nature ,1991
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal PolynomialsIMA Journal of Numerical Analysis, 1988
- Addition requirements for matrix and transposed matrix productsJournal of Algorithms, 1988
- Harmonics on posetsJournal of Combinatorial Theory, Series A, 1985