Parallel Hermite interpolation: An algebraic approach
From MaRDI portal
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
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
- Iterated interpolation using a systolic array
- Logarithmic Depth Circuits for Algebraic Functions
- On Multipoint Numerical Interpolation
- Parallel Prefix Computation
Cited in
(12)- Parallel prefix computation with few processors
- A new parallel polynomial division by a separable polynomial via Hermite interpolation with applications
- Fast computation of divided differences and parallel Hermite interpolation
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
- Parallel rational interpolation
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- Fast parallel algorithm for polynomial interpolation
- Parallel algorithms for nevanlinna-pick interpolation:the scalar case∗
- Cost-efficient parallel programs based on set-distributions for polynomial interpolation
- A parallel method for fast and practical high-order Newton interpolation
- Efficient algorithms for Hermite interpolation
- 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)
