Tool to find the equation of a curve via Newton's algorithm. Newtonian Interpolating algorithm is a polynomial interpolation/approximation allowing to obtain the Lagrange polynomial as equation of the curve by knowing its points.
Newton Interpolating Polynomial - dCode
Tag(s) : Functions
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Newton interpolation refers to a method for constructing an interpolation polynomial passing through a set of points $(x_i,y_i)$. It is based on the calculus of divided differences and provides a polynomial in a factored form that allows for the easy addition of new points without recalculating everything.
To find the Newton interpolation polynomial associated with points $ (x_i,y_i) $, use divided differences to construct the Newton form of the polynomial. From $ n+1 $ known points, the polynomial can be written
$$ P(x)= [y_0] + [y_0,y_1] (x-x_0) + \ldots + [y_0,\ldots ,y_n] (x-x_0) \ldots (x-x_{n-1}) $$
with the notation $ [y_i] $ for divided differences.
Each coefficient $ [y_0,\ldots,y_k] $ is calculated using the values $ (x_i,y_i) $.
Example: Curve whose points (1,3) and (2,5) are known. $$ P(x) = [y_0] + [y_0,y_1] (x-x_0) \\ = 3 + \left(\frac{3}{1-2}+\frac{5}{2-1}\right) (x-1) = 3+2(x-1) = 2x+1 $$
Newton Divided Differences are noted $ [y_i] $ and computed by the formula $$ [y_0,\dots ,y_k]=\sum_{j=0}^k {\frac{y_j}{\prod_{0\leq i\leq k,\,i\neq j}(x_j-x_i)}} $$ they intervene in the computation of Newton's interpolation.
Example: For two points: $ [y_i,y_{i+1}] = \frac{y_{i+1} - y_i}{x_{i+1} - x_i} $
NB: If $ k = 0 $, then the product $ \prod(x_j-x_i) = 1 $ (empty product)
Both forms describe the same interpolation polynomial. The Lagrange form uses basic polynomials $ L_i(x) $, while the Newton form relies on factored products $ (x-x_0)\ldots(x-x_{k-1}) $. The two constructions are algebraically equivalent, but the Newton form is more convenient for adding a point without a complete recalculation.
dCode retains ownership of the "Newton Interpolating Polynomial" source code. Any algorithm for the "Newton Interpolating Polynomial" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Newton Interpolating Polynomial" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Newton Interpolating Polynomial" or any other element are not public (except explicit open source licence). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
The content of the page "Newton Interpolating Polynomial" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Newton Interpolating Polynomial on dCode.fr [online website], retrieved on 2025-11-21,