On best p-norm approximation of discrete data by polynomials

Abstract

In this note, we derive a solution to the problem of finding a polynomial of degree at most $n$ that best approximates data at $n+2$ points in the $l_{p}$ norm. Analogous to a result of de la Vallée Poussin, one can express the solution as a convex combination of the Lagrange interpolants over subsets of $n+1$ points, and the error oscillates in sign.