Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677)
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: Fast algorithms for discrete polynomial transforms on arbitrary grids |
scientific article; zbMATH DE number 1915813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for discrete polynomial transforms on arbitrary grids |
scientific article; zbMATH DE number 1915813 |
Statements
Fast algorithms for discrete polynomial transforms on arbitrary grids (English)
0 references
25 May 2003
0 references
discrete polynomial transform
0 references
Vandermonde-like matrix
0 references
fast cosine
0 references
transform
0 references
fast Fourier transform
0 references
fast polynomial transform
0 references
Chebyshev knots
0 references
nonequi-spaced
0 references
grids
0 references
\(B\)-splines
0 references
Gaussian bells
0 references
numerical examples
0 references
matrix-vector product
0 references
algorithm
0 references
0 references
0 references
0 references
0.9394651055336
0 references
0.9394651055336
0 references
0.8257716298103333
0 references
0.8231032490730286
0 references
