We study the problem of interpolation by a complete spline of 2n − 1 degree given in B-spline representation. Explicit formulas for the first nand the last ncoefficients of B-spline decomposition are found. It is shown that other B-spline coefficients can be computed as a solution of a banded system of an equitype linear equations.
A bicubic model for local smoothing of surfaces is constructed on the base of pivot points. Such an approach allows reducing the dimension of matrix of normal equations more than twice. The model enables to increase essentially the speed and stability of calculations. The algorithms, constructed by the aid of the offered model, can be used both in applications and the development of global methods for smoothing and approximation of surfaces.
The uniform convergence of a sequence of Lienhard approximation of a given continuous function is proved. Further, a method of numerical integration is derived which is based on the Lienhard interpolation method.
We consider triangulations formed by triangular elements. For the standard linear interpolation operator we prove the interpolation order to be for provided the corresponding family of triangulations is only semiregular. In such a case the well-known Zlámal’s condition upon the minimum angle need not be satisfied.
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.