Fast algorithms for discrete polynomial transforms (Q4210958): Difference between revisions
From MaRDI portal
Latest revision as of 18:58, 27 January 2025
scientific article; zbMATH DE number 1198385
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast algorithms for discrete polynomial transforms |
scientific article; zbMATH DE number 1198385 |
Statements
Fast algorithms for discrete polynomial transforms (English)
0 references
10 September 1998
0 references
discrete polynomial transform
0 references
Vandermonde-like matrix
0 references
fast cosine transform
0 references
fast polynomial transform
0 references
Chebyshev knots
0 references
cascade summation
0 references
numerical examples
0 references
algorithm
0 references
matrix-vector product
0 references
0 references
0 references
0 references
0.9207765
0 references
0.7914746
0 references
0.77960867
0 references
0.77126044
0 references
0.77009094
0 references
0.7581731
0 references
0.7540178
0 references
0.7502714
0 references