Elements of the general theory of optimal algorithms. Translated from the Ukrainian

DOI10.1007/978-3-030-90908-6MaRDI QIDQ2057553zbMATH OpenOpenAlexFDO

Authors V. K. Zadiraka, O. M. Lytvyn, I. V. Sergienko

Publication date 6 December 2021

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-90908-6

zbMATH Keywords

computational complexitycubature formulaeinterlineation and interflatation of functionsoptimal algorithmquality of algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

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.

Recommendations

• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• scientific article; zbMATH DE number 177335
• scientific article; zbMATH DE number 3909615
• scientific article; zbMATH DE number 665283
• Some issues in the theory of optimal algorithms and informational complexity

Cited in

(11)

• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• scientific article; zbMATH DE number 665283 (Why is no real title available?)
• scientific article; zbMATH DE number 7033647 (Why is no real title available?)
• Approximate calculation of double integrals of highly oscillating functions of general type using the cubature formula of optimal order of accuracy on a class of differentiable functions
• Chebyshev approximation of multivariable functions by a nonlinear function of a rational expression
• Applying the general theory of optimal algorithms in cryptography, steganography, and blockchain technology
• Elements of the general theory of optimal algorithms
• Chebyshev approximation by the power of a rational expression
• The Chebyshev approximation by the logarithm of a rational expression
• Method and algorithm for interbase conversion of Rademacher binary codes into Christensen residue codes
• Chebyshev approximation of multivariable functions by a nonlinear expression of a generalized polynomial with a condition

This page was built for publication: Elements of the general theory of optimal algorithms. Translated from the Ukrainian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057553)