Elements of the general theory of optimal algorithms
A general scheme for estimating the total error of a computational algorithm is presented. Optimal algorithms are constructed under the conditions of the most complete use of available information about the problem. Reserves for optimization of calculations are considered. Keywords: computational algorithm, approximate solution, error of approximate solution, optimization of algorithms, reserves of calculations optimization, computer technologies.
Authors
- І. В. Швідченко (ORCID: https://orcid.org/0000-0002-5434-2845)
- V. K. Zadiraka (ORCID: https://orcid.org/0000-0001-9628-0454)
Publication Details
- Journal
- Kibernetyka ta Systemnyi Analiz
- Published
- 2025-01-01
- DOI
- https://doi.org/10.34229/kca2522-9664.25.4.3
- Primary Topic
- Advanced Computational Techniques in Science and Engineering
- Type
- article
- Field-Weighted Citation Impact
- 0.00