Fast computation of divided differences and parallel Hermite interpolation
From MaRDI portal
(Redirected from Publication:581992)
The authors give some parallel algoritms for fast polynomial interpolation (Lagrange or Hermite interpolation). These algorithms are based on the fast parallel evaluation of a closed formula for generalized divided differences. Some numerical examples are given.
Recommendations
- scientific article; zbMATH DE number 4176314
- A fast algorithm for multivariate Hermite interpolation
- Parallel Hermite interpolation: An algebraic approach
- The fast implementation of higher order Hermite-Fejér interpolation
- Efficient algorithms for Hermite interpolation
- Fast parallel algorithm for polynomial interpolation
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Algorithms for solving Hermite interpolation problems using the fast Fourier transform
- A parallel method for fast and practical high-order Newton interpolation
- Efficient Algorithms for Periodic Hermite Spline Interpolation
Cites work
- A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
- A fast method for interpolation using preconditioning
- A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
- A parallel method for fast and practical high-order Newton interpolation
- Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- High Degree Polynomial Interpolation in Newton Form
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3509655 (Why is no real title available?)
- scientific article; zbMATH DE number 3416363 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Logarithmic Depth Circuits for Algebraic Functions
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- Newton Interpolation in Fejer and Chebyshev Points
- On Multipoint Numerical Interpolation
- On the computational power of pushdown automata
- Optimally conditioned Vandermonde matrices
- Parallel Hermite interpolation: An algebraic approach
- Parallel Prefix Computation
- Solution of Vandermonde systems of equations
- Solving confluent Vandermonde systems of Hermite type
- Solving Triangular Systems on a Parallel Computer
- Some Poised and Nonpoised Problems of Interpolation
- The block decomposition of a Vandermonde matrix and its applications
Cited in
(11)- Parallel Hermite interpolation: An algebraic approach
- Parallel information-based complexity
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- Fast parallel algorithm for polynomial interpolation
- Systolic computation of interpolating polynomials
- A new parallel polynomial division by a separable polynomial via Hermite interpolation with applications
- scientific article; zbMATH DE number 4176314 (Why is no real title available?)
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Fast and stable contour integration for high order divided differences via elliptic functions
- Efficient algorithms for Hermite interpolation
- A parallel method for fast and practical high-order Newton interpolation
This page was built for publication: Fast computation of divided differences and parallel Hermite interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581992)
