Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation |
scientific article; zbMATH DE number 484447
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation |
scientific article; zbMATH DE number 484447 |
Statements
Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (English)
0 references
18 May 1994
0 references
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.
0 references
discrete orthogonal polynomial transforms
0 references
matrix factorization
0 references
sample points
0 references
symmetric argumentations
0 references
algorithm
0 references
fast discrete monomial transforms
0 references
asymptotic complexity
0 references
0 references
0 references
