test_interp_1d, a MATLAB code which defines test functions y(x) that may be used to test interpolation algorithms involving a 1D argument x.
TEST_INTERP_1D requires access to a compiled copy of the R8LIB library.
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
test_interp_1d is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
barycentric_interp_1d, a MATLAB code which defines and evaluates the barycentric Lagrange polynomial p(x) which interpolates a set of data, so that p(x(i)) = y(i). The barycentric approach means that very high degree polynomials can safely be used.
chebyshev_interp_1d, a MATLAB code which determines the combination of Chebyshev polynomials which interpolates a set of data, so that p(x(i)) = y(i).
lagrange_interp_1d, a MATLAB code which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data, so that p(x(i)) = y(i).
nearest_interp_1d, a MATLAB code which interpolates a set of data using a piecewise constant interpolant defined by the nearest neighbor criterion.
newton_interp_1d, a MATLAB code which finds a polynomial interpolant to data using Newton divided differences.
pwl_interp_1d, a MATLAB code which interpolates a set of data using a piecewise linear interpolant.
r8lib, a MATLAB code which contains many utility routines using double precision real (R8) arithmetic.
rbf_interp_1d, a MATLAB code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
shepard_interp_1d, a MATLAB code which defines and evaluates Shepard interpolants to 1D data, based on inverse distance weighting.
test_interp_2d, a MATLAB code which defines test problems for interpolation of data z(x,y), depending on a 2D argument.
test_interp_nd, a MATLAB code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.
vandermonde_interp_1d, a MATLAB code which finds a polynomial interpolant to data y(x) of a 1D argument, by setting up and solving a linear system for the polynomial coefficients, involving the Vandermonde matrix.