International Conference «Mathematical and Informational Technologies, MIT-2011»
(IX Conference «Computational and Informational Technologies for Science,
Engineering and Education»)

Vrnjacka Banja, Serbia, August, 27–31, 2011

Budva, Montenegro, August, 31 – September, 5, 2011

Baklanova O.E.  

Data compression with ∑∏- algorithm for the approximation based on the continuous and discrete B-splines

This article contains the description of ∑∏-algorithm for the approximation of the function with two independent variables by the sum of products of one-dimensional functions. It is easy to describe the construction of the best ∑∏-approximation with the given accuracy level. The structure of the construction of the best ∑∏-approximation usually repeats this structure with some differences concerning with the algorithm for the eigenvalue problem and some additional possibilities like visual control. Some realizations of this algorithm based on the continuous and discrete B- splines are presented here. Few examples concerning with compression in the solving of approximation problems are described and discussed. 

To reports list

© 1996-2019, Institute of computational technologies of SB RAS, Novosibirsk