Elements of the General Theory of Optimal Algorithms

Elements of the General Theory of Optimal Algorithms
Author :
Publisher : Springer Nature
Total Pages : 387
Release :
ISBN-10 : 9783030909086
ISBN-13 : 3030909085
Rating : 4/5 (86 Downloads)

Book Synopsis Elements of the General Theory of Optimal Algorithms by : Ivan V. Sergienko

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.


Elements of the General Theory of Optimal Algorithms Related Books

Elements of the General Theory of Optimal Algorithms
Language: en
Pages: 387
Authors: Ivan V. Sergienko
Categories: Mathematics
Type: BOOK - Published: 2022-01-11 - Publisher: Springer Nature

DOWNLOAD EBOOK

In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in comput
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Encyclopaedia of Mathematics
Language: en
Pages: 555
Authors: Michiel Hazewinkel
Categories: Mathematics
Type: BOOK - Published: 2013-12-01 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This ENCYCLOPAEDIA OF MATHEMATICS aims to be a reference work for all parts of mathe matics. It is a translation with updates and editorial comments of the Sovi
Encyclopaedia of Mathematics
Language: en
Pages: 952
Authors: M. Hazewinkel
Categories: Mathematics
Type: BOOK - Published: 2013-11-11 - Publisher: Springer

DOWNLOAD EBOOK

Minimax Models in the Theory of Numerical Methods
Language: en
Pages: 273
Authors: A. Sukharev
Categories: Business & Economics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

In the Russian edition published in 1989, this book was called "Minimax Algorithms in Problems of Numerical Analysis". The new title is better related to the su