Lagrange polynomial

In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a data set of coordinate pairs ⁠ ( x j , y j ) {\displaystyle \textstyle (x_{j},y_{j})} ⁠, the ⁠ x j {\displaystyle \textstyle x_{j}} ⁠ are called nodes and the ⁠ y j {\displaystyle \textstyle y_{j}} ⁠ are called values. The Lagrange polynomial ⁠ L ( x ) {\displaystyle L(x)} ⁠ which interpolates the data assumes each value at the corresponding node, ⁠ L ( x j ) = y j {\displaystyle \textstyle L(x_{j})=y_{j}} ⁠. If there are ⁠ k + 1 {\displaystyle k+1} ⁠ data pairs, the Lagrange polynomial has degree ⁠ ≤ k {\displaystyle \leq k} ⁠. Although named after Joseph-Louis Lagrange, who published it in 1795, the method was first discovered in 1779 by Edward Waring. It is also an easy consequence of a formula published in 1783 by Leonhard Euler. Uses of Lagrange polynomials include the Newton–Cotes method of numerical integration, Shamir's secret sharing scheme in cryptography, and Reed–Solomon error correction in coding theory. For equispaced nodes, Lagrange interpolation is susceptible to Runge's phenomenon of large oscillation.