Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:55, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for discrete polynomial transforms on arbitrary grids |
scientific article |
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
