New algorithms for polynomial and trigonometric interpolation on parallel computers
From MaRDI portal
Publication:1198975
DOI10.1007/BF02074881zbMath0754.65007MaRDI QIDQ1198975
Publication date: 16 January 1993
Published in: BIT (Search for Journal in Brave)
trigonometric interpolationparallel algorithmsHermite interpolationChebyshev interpolationpolynomial interpolationparallel computerfinite -difference interpolation
Trigonometric interpolation (42A15) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Numerical methods for trigonometric approximation and interpolation (65T40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel method for fast and practical high-order Newton interpolation
- Optimal algorithms for parallel polynomial evaluation
- A Fast Parallel Horner Algorithm
- Polynomial Interpolation: Lagrange versus Newton
- Logarithmic Depth Circuits for Algebraic Functions
- Method of Lagrangian curvilinear interpolation
This page was built for publication: New algorithms for polynomial and trigonometric interpolation on parallel computers