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 ---
New algorithms for polynomial and trigonometric interpolation on parallel computers
β Scribed by Ilan Bar-On; Avram Sidi
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 788 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.
## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, sharedβmemory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev