The traditional tabular-polynomial methods for the approximation of complex functional relationships have a limitation on accuracy, smoothness, and they do not allow parallelisation of the computing structures for the implementation of approximation using classical polynomials on Horner's algorithm [1][2][3]. For instance, a second-level polynomial on Horner's algorithm can be represented in the following way:The structure, shown in Fig. 2.1, was proposed for the implementation of the second-level polynomials. The use of parabolic basic B-splines for the approximation of functions allows enhancing the smoothness and locality properties [4,5]. According to Formula (2.1.1), the value of the function under interpolation on a random point of a given interval is determined by the values m + 1 of summands (where m is the B-spline level)-pair derivatives of basic functions to constant coefficients.The local formulae are convenient among the coefficient determination methods in data processing with B-splines for they allow avoiding solution of equation systems [6]. At calculation of b coefficients using the three-point formula, only three values f i − 1 , f i , f i + 1 of the function are used. This facilitates the initiation of processing without waiting for the arrival of all data [7], i.e. a combination of data entry and processing operations.