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 paper deals with the recently proposed autotracking piecewise cubic approximation (APCA) based on the discrete projective transformation, and neural networks (NN). The suggested new approach facilitates the analysis of data with complex dependence and relatively small errors. We introduce a new representation of polynomials that can provide different local approximation models. We demonstrate how APCA can be applied to especially noisy data thanks to NN and local estimations. On the other hand, the new approximation method also has its impact on neural networks. We show how APCA helps to decrease the computation time of feed forward NN.
In the paper a simple proof of the Weierstrass approximation theorem on a function continuous on a compact interval of the real line is given. The proof is elementary in the sense that it does not use uniform continuity.