Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation

DOI10.1016/0024-3795(93)90246-KzbMath0786.65130OpenAlexW2091715500MaRDI QIDQ1311327

Sean S. B. Moore, Dennis M. jun. Healy, Daniel N. Rockmore

Publication date: 18 May 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(93)90246-k

zbMATH Keywords

algorithmmatrix factorizationasymptotic complexitysample pointsdiscrete orthogonal polynomial transformsfast discrete monomial transformssymmetric argumentations

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

An empirical Bayes approach to directional data and efficient computation on the sphere ⋮ Efficient computation of Fourier transforms on compact groups ⋮ Fast algorithms for discrete polynomial transforms ⋮ Fast and stable algorithms for discrete spherical Fourier transforms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for solving Toeplitz systems of equations
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Computing Fourier transforms and convolutions on the 2-sphere
• Stability of Methods for Solving Toeplitz Systems of Equations
• Addition requirements for matrix and transposed matrix products
• Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
• Convolution of vectors over the real field of constants by evaluation-interpolation algorithms
• Complexity of Computations with Matrices and Polynomials
• Fast algorithms for the discrete cosine transform
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• Roundoff Error Analysis of the Fast Fourier Transform