02780nmm a2200337 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002300139245014100162250001700303260005600320300004200376505049700418653001700915653001500932653005300947653003401000653003001034700003501064700003001099041001901129989003601148490004701184028003001231856007201261082000801333520110101341EB002009516EBX0100000000000000117241500000000000000.0cr|||||||||||||||||||||220201 ||| eng a97830309090861 aSergienko, Ivan V.00aElements of the General Theory of Optimal AlgorithmshElektronische Ressourcecby Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn a1st ed. 2021 aChambSpringer International Publishingc2021, 2021 aXVII, 378 p. 9 illusbonline resource0 a-Preface -- Introduction -- List of symbols and abbreviations -- 1. Elements of the computing theory -- 2. Theories of computational complexity -- 3. Interlination of functions -- 4. Interflatation of functions -- 5. Cubature formulae using interlanation functions -- 6. Testing the quality of algorithm programs -- 7. Computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics -- Bilbiography -- Index -- About the Authors aOptimization aAlgorithms aComputational Mathematics and Numerical Analysis aMathematics / Data processing aMathematical optimization1 aZadiraka, Valeriy K.e[author]1 aLytvyn, Oleg M.e[author]07aeng2ISO 639-2 bSpringeraSpringer eBooks 2005-0 aSpringer Optimization and Its Applications50a10.1007/978-3-030-90908-640uhttps://doi.org/10.1007/978-3-030-90908-6?nosfx=yxVerlag3Volltext0 a518 aIn this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics