Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
type: Item
instance of: scholarly article
title: Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
zbMATH Open document ID: 0786.65130
DOI: 10.1016/0024-3795(93)90246-K
author: Sean S. B. Moore
author: Dennis Healy
author: Daniel N. Rockmore
published in: Linear Algebra and its Applications
publication date: 1994-05-18T00:00:00Z
review text: A concept of symmetric argumentations is introduced into an algorithm for stabilizing the fast discrete monomial transforms, while retaining the asymptotic complexity of the computation.
Mathematics Subject Classification ID: 65T50
zbMATH DE Number: 484447
zbMATH Keywords: discrete orthogonal polynomial transforms
zbMATH Keywords: matrix factorization
zbMATH Keywords: sample points
zbMATH Keywords: symmetric argumentations
zbMATH Keywords: algorithm
zbMATH Keywords: fast discrete monomial transforms
zbMATH Keywords: asymptotic complexity
reviewed by: Yasuhiro Kobayashi
MaRDI profile type: Publication
cites work: Stability of Methods for Solving Toeplitz Systems of Equations
cites work: Asymptotically fast solution of Toeplitz and related systems of linear equations
cites work: Q4190138
cites work: Addition requirements for matrix and transposed matrix products
cites work: A new algorithm for solving Toeplitz systems of equations
cites work: Q3995195
cites work: Q4273603
cites work: Computing Fourier transforms and convolutions on the 2-sphere
cites work: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
cites work: Q3675490
cites work: Fast algorithms for the discrete cosine transform
cites work: Q3707259
cites work: Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
cites work: Q3935355
cites work: Q3735040
cites work: Convolution of vectors over the real field of constants by evaluation-interpolation algorithms
cites work: Complexity of Computations with Matrices and Polynomials
cites work: Roundoff Error Analysis of the Fast Fourier Transform
cites work: Q3699921
cites work: Q3995134
cites work: Q4003887
cites work: Q4342463
full work available at URL: 0024-3795(93)90246-k
OpenAlex ID: W2091715500
description: scientific article; zbMATH DE number 484447