Elements of the General Theory of Optimal Algorithms
Author | : Ivan V. Sergienko |
Publisher | : Springer Nature |
Total Pages | : 387 |
Release | : 2022-01-11 |
ISBN-13 | : 9783030909086 |
ISBN-10 | : 3030909085 |
Rating | : 4/5 (85 Downloads) |
Download or read book Elements of the General Theory of Optimal Algorithms written by Ivan V. Sergienko and published by Springer Nature. This book was released on 2022-01-11 with total page 387 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.