Elements of the general theory of optimal algorithms. Translated from the Ukrainian (Q2057553)

This work consists of seven chapters, including elements of computing theory, theories of computational complexity, interlineation of functions, interflatation of functions, cubature formulae using interlineation of functions, testing the quality of algorithm programs and computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics. In particular, the substantiation of the algorithms is given by applying the derivation of estimates of their global error, and the optimal algorithms are constructed by employing more available information about the problem. Moreover, a priori information is included in the algorithm, as well as in the error estimate, which improves the quality of the approximate solution of the problem, and simultaneously, different informational operators about the problem are considered. In addition, the rapid orthogonal transformations are applied to increase the speed of the constructed algorithms, and the background of interlination and interflatation of functions and some supporting data in functional analysis and approximate functions are provided.