New algorithms for polynomial and trigonometric interpolation on parallel computers
From MaRDI portal
Recommendations
Cites work
- A Fast Parallel Horner Algorithm
- A parallel method for fast and practical high-order Newton interpolation
- scientific article; zbMATH DE number 3936360 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 3439855 (Why is no real title available?)
- Logarithmic Depth Circuits for Algebraic Functions
- Method of Lagrangian curvilinear interpolation
- Optimal algorithms for parallel polynomial evaluation
- Polynomial Interpolation: Lagrange versus Newton
Cited in
(6)- Parallel Hermite interpolation: An algebraic approach
- Massively parallel computation of many-variable polynomial interpolation
- Cost-efficient parallel programs based on set-distributions for polynomial interpolation
- Parallel algorithms for nevanlinna-pick interpolation:the scalar case∗
- Efficient algorithms for Hermite interpolation
- A parallel method for fast and practical high-order Newton interpolation
This page was built for publication: New algorithms for polynomial and trigonometric interpolation on parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198975)