| 书目名称 | Elements of the General Theory of Optimal Algorithms |
| 编辑 | Ivan V. Sergienko,Valeriy K. Zadiraka,Oleg M. Lytv |
| 视频video | |
| 概述 | Results provide methods to solve problems that have been unsolvable until now.Provides know-how in computer technology for computational processes for various computational models.Results can be used |
| 丛书名称 | Springer Optimization and Its Applications |
| 图书封面 |  |
| 描述 | In 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.. |
| 出版日期 | Book 2021 |
| 关键词 | T-efficient algorithms; software support; theory of computations; theory of optimal algorithms; computin |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-030-90908-6 |
| isbn_ebook | 978-3-030-90908-6Series ISSN 1931-6828 Series E-ISSN 1931-6836 |
| issn_series | 1931-6828 |
| copyright | Springer Nature Switzerland AG 2021 |
发表于 2025-3-21 17:47:05
