Uniform partition and the best least-squares piecewise polynomial approximation
Uniform partition and the best least-squares piecewise polynomial approximation
It is shown that the best least-squares piecewise n degree polynomial approximation of x n +1 over [ a, b ] is obtained for a uniform partition. Moreover the approximation is continuous for n odd and discontinuous, with equal stepsizes at the nodes, for n even.