登入選單
返回Google圖書搜尋
Elements of the General Theory of Optimal Algorithms
Ivan V. SergienkoValeriy K. ZadirakaOleg M. Lytvyn
出版Springer Nature, 2022-01-11
主題Mathematics / Counting & NumerationMathematics / AppliedComputers / Programming / AlgorithmsMathematics / Numerical AnalysisMathematics / Probability & Statistics / Stochastic ProcessesMathematics / Optimization
ISBN30309090859783030909086
URLhttp://books.google.com.hk/books?id=udFYEAAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋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 developing algorithmic and software support for the solution of problems of computational and applied mathematics.