Node order in Newton interpolation 2026-10-18
Reordering the interpolation nodes changes the successive subsets used for the divided differences and the factors of the Newton polynomial. The final interpolation polynomial remains unchanged in exact arithmetic. For , reversing gives and values . The successive divided difference columns are nowFor example, the first second divided difference is . The top row becomes , givingThe earlier partial interpolants differ because they fit different subsets: fits , whereas fits . The highest divided difference is invariant because both complete top rows finish with the same set of four interpolation nodes; this is symmetry of divided differences.
Reversing the interpolation nodes changes the Newton construction but gives the same final polynomial
. Details. This distinction is useful when checking a divided difference table: permuting all the interpolation nodes must preserve its final divided difference, even though the intermediate entries change. It also explains why data can be appended in their arrival order. In floating-point arithmetic, the subtractions and divisions may accumulate different rounding errors in different orders; exact invariance describes the mathematical polynomial, rather than guaranteeing bit-for-bit equality of numerical results.
