Elements of the General Theory of Optimal Algorithms

de

, ,

Éditeur :

Springer


Collection :

Springer Optimization and Its Applications

Paru le : 2022-01-11

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
137,14

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description
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 e-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.
Pages
378 pages
Collection
Springer Optimization and Its Applications
Parution
2022-01-11
Marque
Springer
EAN papier
9783030909062
EAN PDF
9783030909086

Informations sur l'ebook
Nombre pages copiables
3
Nombre pages imprimables
37
Taille du fichier
5980 Ko
Prix
137,14 €
EAN EPUB
9783030909086

Informations sur l'ebook
Nombre pages copiables
3
Nombre pages imprimables
37
Taille du fichier
21094 Ko
Prix
137,14 €