Multivariate Newton Interpolation
From MaRDI portal
Publication:6311002
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99) Numerical interpolation (65D05) Approximation by polynomials (41A10) Stability and convergence of numerical methods for ordinary differential equations (65L20) Polynomials, rational functions in real analysis (26C99)
Abstract: For , and a given function , the polynomial interpolation problem (PIP) is to determine a unisolvent node set of points and the uniquely defined polynomial in variables of degree that fits on , i.e., , . For the solution to the PIP is well known. In higher dimensions, however, no closed framework was available. We here present a generalization of the classic Newton interpolation from one-dimensional to arbitrary-dimensional spaces. Further we formulate an algorithm, termed PIP-SOLVER, based on a multivariate divided difference scheme that computes the solution in time using memory. Further, we introduce unisolvent Newton-Chebyshev nodes and show that these nodes avoid Runge's phenomenon in the sense that arbitrary periodic Sobolev functions , of regularity can be uniformly approximated, i.e., . Numerical experiments demonstrate the computational performance and approximation accuracy of the PIP-SOLVER in practice. We expect the presented results to be relevant for many applications, including numerical solvers, quadrature, non-linear optimization, polynomial regression, adaptive sampling, Bayesian inference, and spectral analysis.
This page was built for publication: Multivariate Newton Interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311002)