Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation

DOI10.2307/2004888zbMath0198.21101OpenAlexW4253444407MaRDI QIDQ5594861

Fred T. Krogh

Publication date: 1970

Full work available at URL: https://doi.org/10.2307/2004888

zbMATH Keywords

numerical analysis

Related Items (13)

Systolic computation of interpolating polynomials ⋮ Parallel Hermite interpolation: An algebraic approach ⋮ A Newton interpolation based predictor-corrector numerical method for fractional differential equations with an activator-inhibitor case study ⋮ ENO-based high-order data-bounded and constrained positivity-preserving interpolation ⋮ A parallel method for fast and practical high-order Newton interpolation ⋮ A comparison of several invariant imbedding algorithms for the solution of two-point boundary-value problems ⋮ Fast computation of divided differences and parallel Hermite interpolation ⋮ On the computation of Hermite interval interpolating polynomials ⋮ Computational complexity for a class of multipoint iterative procedures without or with internal memory ⋮ Multivariate interval interpolation ⋮ Retracted: New numerical method for ordinary differential equations: Newton polynomial ⋮ Explicit calculation of the Lagrangian interval interpolating polynomial ⋮ Reliable determination of interpolating polynomials

Cites Work

• Van der Monde systems and numerical differentiation
• An Iterative Method of Numerical Differentiation
• On Interpolation by Iteration of Proportional Parts, without the Use of Differences
• Interpolation by Algebraic and Trigonometric Polynomials
• Aitken-Hermite Interpolation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation