# DIVDIF Divided Difference Polynomials

DIVDIF is a C++ library which creates, prints and manipulates divided difference polynomials.

Divided difference polynomials are a systematic method of computing polynomial approximations to scattered data. The representations are compact, and may easily be updated with new data, rebased at zero, or analyzed to produce the standard form polynomial, integral or derivative polynomials.

Other routines are available to convert the divided difference representation into standard polynomial format. This is a natural way to determine the coefficients of the polynomial that interpolates a given set of data, for instance.

One surprisingly simple but useful routine is available to take a set of roots and compute the divided difference or standard form polynomial that passes through those roots.

Finally, the Newton-Cotes quadrature formulas can be derived using divided difference methods, so a few routines are given which can compute the weights and abscissas of open or closed rules for an arbitrary number of nodes.

### Languages:

DIVDIF is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version.

### Related Data and Programs:

BERNSTEIN_POLYNOMIAL, a C++ library which evaluates the Bernstein polynomials, useful for uniform approximation of functions;

CHEBYSHEV, a C++ library which computes the Chebyshev interpolant/approximant to a given function over an interval.

DIFFER, a C++ library which determines the finite difference coefficients necessary in order to combine function values at known locations to compute an approximation of given accuracy to a derivative of a given order.

LAGRANGE_INTERP_1D, a C++ library which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data, so that p(x(i)) = y(i).

RBF_INTERP, a C++ library which defines and evaluates radial basis function (RBF) interpolants to multidimensional data.

SPLINE, a C++ library which includes many routines to construct and evaluate spline interpolants and approximants.

TEST_APPROX, a C++ library which defines test problems for approximation, provided as a set of (x,y) data.

TEST_INTERP_1D, a C++ library which defines test problems for interpolation of data y(x), depending on a 1D argument.

### Reference:

1. Philip Davis,
Interpolation and Approximation,
Dover, 1975,
ISBN: 0-486-62495-1,
LC: QA221.D33
2. Carl deBoor,
A Practical Guide to Splines,
Springer, 2001,
ISBN: 0387953663,
LC: QA1.A647.v27.
3. Jean-Paul Berrut, Lloyd Trefethen,
Barycentric Lagrange Interpolation,
SIAM Review,
Volume 46, Number 3, September 2004, pages 501-517.
4. FM Larkin,
Root Finding by Divided Differences,
Numerische Mathematik,
Volume 37, pages 93-104, 1981.

### List of Routines:

• CHEBY_T_ZERO returns zeroes of the Chebyshev polynomial T(N)(X).
• CHEBY_U_ZERO returns zeroes of the Chebyshev polynomial U(N)(X).
• DATA_TO_DIF sets up a divided difference table from raw data.
• DATA_TO_DIF_NEW sets up a divided difference table from raw data.
• DATA_TO_DIF_DISPLAY sets up a divided difference table and prints out intermediate data.
• DATA_TO_R8POLY computes the coefficients of a polynomial interpolating data.
• DIF_ANTIDERIV integrates a polynomial in divided difference form.
• DIF_APPEND adds a pair of data values to a divided difference table.
• DIF_BASIS computes all Lagrange basis polynomials in divided difference form.
• DIF_BASIS_I computes the I-th Lagrange basis polynomial in divided difference form.
• DIF_DERIV computes the derivative of a polynomial in divided difference form.
• DIF_PRINT prints the polynomial represented by a divided difference table.
• DIF_SHIFT_X replaces one abscissa of a divided difference table with a new one.
• DIF_SHIFT_ZERO shifts a divided difference table so that all abscissas are zero.
• DIF_TO_R8POLY converts a divided difference table to a standard polynomial.
• DIF_VAL evaluates a divided difference polynomial at a point.
• DIF_VALS evaluates a divided difference polynomial at a set of points.
• LAGRANGE_RULE computes the weights of a Lagrange interpolation rule.
• LAGRANGE_SUM carries out a Lagrange interpolation rule.
• LAGRANGE_VAL applies a naive form of Lagrange interpolation.
• NC_RULE computes the weights of a Newton-Cotes quadrature rule.
• NCC_RULE computes the coefficients of a Newton-Cotes closed quadrature rule.
• NCO_RULE computes the coefficients of a Newton-Cotes open quadrature rule.
• R8_SWAP swaps two R8's.
• R8POLY_ANT_COF integrates an R8POLY in standard form.
• R8POLY_ANT_VAL evaluates the antiderivative of an R8POLY in standard form.
• R8POLY_BASIS computes all Lagrange basis polynomials in standard form.
• R8POLY_BASIS_1 computes the I-th Lagrange basis polynomial in standard form.
• R8POLY_DER_COF computes the coefficients of the derivative of a real polynomial.
• R8POLY_DER_VAL evaluates the derivative of a real polynomial in standard form.
• R8POLY_ORDER returns the order of a polynomial.
• R8POLY_PRINT prints out a real polynomial in standard form.
• R8POLY_SHIFT adjusts the coefficients of a polynomial for a new argument.
• R8POLY_VAL_HORNER evaluates a real polynomial in standard form.
• R8VEC_DISTINCT is true if the entries in an R8VEC are distinct.
• R8VEC_INDICATOR sets an R8VEC to the indicator vector {1,2,3...}.
• R8VEC_PRINT prints an R8VEC.
• ROOTS_TO_DIF sets a divided difference table for a polynomial from its roots.
• ROOTS_TO_R8POLY converts polynomial roots to polynomial coefficients.
• S_LEN_TRIM returns the length of a string to the last nonblank.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C++ source codes.

Last revised on 25 May 2011.