Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications (Q1315227): 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:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications |
scientific article |
Statements
Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications (English)
0 references
24 February 1994
0 references
The discrete cosine transform (DCT) is introduced as an application of the discrete Chebyshev-Vandermonde transform (DCVT). With the divide-and- conquer technique and the d'Alembert functional equation, fast DCT algorithms are described. By the help of DCVT and DCT, numerically stable fast algorithms for simultaneous polynomial approximation and for a collocation method for the airfoil equations are derived.
0 references
discrete cosine transform
0 references
discrete Chebyshev-Vandermonde transform
0 references
divide-and-conquer technique
0 references
d'Alembert functional equation
0 references
fast algorithms
0 references
polynomial approximation
0 references
collocation
0 references
airfoil equations
0 references
