A parallel method for fast and practical high-order Newton interpolation
From MaRDI portal
Publication:920539
DOI10.1007/BF02017348zbMath0708.65008WikidataQ63353486 ScholiaQ63353486MaRDI QIDQ920539
Ömer Eğecioğlu, Efstratios Gallopoulos
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
numerical experimentsparallel algorithmsinterpolating polynomialsdivided differenceshigh-order interpolationparallel prefix techniques
Numerical interpolation (65D05) Parallel numerical computation (65Y05) Interpolation in approximation theory (41A05) Complexity and performance of numerical algorithms (65Y20)
Related Items (3)
A Chebychev-Vandermonde solver ⋮ New algorithms for polynomial and trigonometric interpolation on parallel computers ⋮ Fast computation of divided differences and parallel Hermite interpolation
Cites Work
- Unnamed Item
- Unnamed Item
- A stability classification method and its application to pipelined solution of linear recurrences
- Fast computation of divided differences and parallel Hermite interpolation
- Stability aspects in using parallel algorithms
- A comparison of algorithms for polynomial interpolation
- A fast method for interpolation using preconditioning
- Optimal algorithms for parallel polynomial evaluation
- A ccuracy and speed of real and complex interpolation
- Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
- Iterated interpolation using a systolic array
- Logarithmic Depth Circuits for Algebraic Functions
- Newton Interpolation in Fejer and Chebyshev Points
- Parallel Prefix Computation
- Chebyshev-Vandermonde Systems
- Computational Complexity and Numerical Stability
- Parallelism in random access machines
- Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
- On the Parallel Evaluation of Polynomials
This page was built for publication: A parallel method for fast and practical high-order Newton interpolation
