Parallel Hermite interpolation: An algebraic approach
From MaRDI portal
DOI10.1007/BF02243225zbMATH Open0678.65002MaRDI QIDQ1124261FDOQ1124261
Authors: Ömer Eğecioğlu, E. Gallopoulos, Çetin Kaya Koç 
Publication date: 1989
Published in: Computing (Search for Journal in Brave)
Recommendations
- Fast computation of divided differences and parallel Hermite interpolation
- Efficient algorithms for Hermite interpolation
- A parallel method for fast and practical high-order Newton interpolation
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- Logarithmic Depth Circuits for Hermite Interpolation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Prefix Computation
- Logarithmic Depth Circuits for Algebraic Functions
- On Multipoint Numerical Interpolation
- Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
- Iterated interpolation using a systolic array
Cited In (12)
- Parallel rational interpolation
- Parallel algorithms for nevanlinna-pick interpolation:the scalar case∗
- Fast computation of divided differences and parallel Hermite interpolation
- A new parallel polynomial division by a separable polynomial via Hermite interpolation with applications
- Cost-efficient parallel programs based on set-distributions for polynomial interpolation
- A parallel method for fast and practical high-order Newton interpolation
- Fast parallel algorithm for polynomial interpolation
- Efficient algorithms for Hermite interpolation
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- Parallel prefix computation with few processors
- A parallel algorithm for Lagrange interpolation polynomial
This page was built for publication: Parallel Hermite interpolation: An algebraic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124261)
