Особливості вирішення задач апроксимації неперервних функцій

Abstract

UK: В роботі розглядаються особливості застосування алгоритмів вирішення задач апроксимації дискретно представлених неперервних функцій. RU: В работе рассматриваются особенности применения алгоритмов решения задач аппроксимации дискретно представленых непрерывных функций. EN: Experience of automation of complex processes shows inability of application of methods of the theory of automatic control effectively more and more to solve than a problem of automation of manufactures and management of social and economic projects. For anyone intellectual, industrial, socially - household activity of the person procedure of decision-making is necessarily characteristic. For formation of theoretical bases of the theory of coordination of complex systems the further development of formal methods, mechanisms, tools of the coordination, providing a coordination of functions of components of system and synchronization of the purposes as a unit is necessary. Problem of approximation of the received experimental dependences is definition of the analytical dependence describing set system of points by set criterion. The most known criterion for problems of approximation is the criterion среднеквадратических deviation which represents minimization of the sum of squares of deviations of experimental data from some analytical function. However, at such statement, the problem of approximation of experimental data has set of decisions. Therefore there is a necessity in discrete representations of continuous functions. In work features of application of algorithms of the decision of problems of approximation discretely представленых continuous functions are considered.