Dynamic programming and bicubic spline interpolation

Abstract Dynamic programming techniques were used to obtain the spline approximation for a function with prescribed values on the knot points along a line. Extending this procedure to two dimensions, the bicubic spline approximation defined over a two-dimensional region is obtained in this paper employing the methods of dynamic programming. A regular rectangular region as well as a region with irregular boundaries can be handled by this method, avoiding the difficulties of large storage and high dimensionality.