A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (Q3094285): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Chebfun / rank | |||
Normal rank | |||
Revision as of 00:19, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial interpolation process at quasi-Chebyshev nodes with the FFT |
scientific article |
Statements
A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (English)
0 references
24 October 2011
0 references
Chebyshev interpolation
0 references
Chebyshev nodes
0 references
quasi-Chebyshev nodes
0 references
chinese remainder theorem
0 references
error estimate
0 references
computational complexity
0 references
fast algorithm
0 references
fast Fourier transform (FFT)
0 references
