For a polynomial p(x) of a degree n, we study its interpolation and evaluation on a set of Chebyshev nodes, x k = cos((2k + 1)~r/(2n + 2)), k = 0,1,... ,n. This is easily reduced to applying discrete Fourier transforms (DFTs) to the auxiliary polynomial q(w) = w'~p(x), where 2x = ~w + (aw) -1, a ---
A new approach to fast polynomial interpolation and multipoint evaluation
โ Scribed by Victor Pan; Akimou Sadikou; Elliott Landowne; Olen Tiga
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 347 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this work, by using a p-adic q-Volkenborn integral, we construct a new approach to generating functions of the (h, q)-Euler numbers and polynomials attached to a Dirichlet character ฯ. By applying the Mellin transformation and a derivative operator to these functions, we define (h, q)-extensions
## Abstract ## Background Dementia patients suffer from the progressive deterioration of cognitive and functional abilities. Instrumental disabilities usually appear in the earlier stages of the disease while basic disabilities appear in the more advanced stages. In order to differentiate between