Articoli correlati a Elements of the General Theory of Optimal Algorithms:...

9783030909062: Elements of the General Theory of Optimal Algorithms: 188
Rilegato
ISBN 10: 3030909069 ISBN 13: 9783030909062
Casa editrice: Springer Nature, 2022

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull'autore

?Ivan V. Sergienko is the Director of the V.M. Glushkov Institute of Cybernetics of the National Academy of Science of Ukraine.


Valeriy K. Zadiraka is Head of the Department of Numerical Methods for Optimization at the V.M. Glushkov Institute of Cybernetics of the National Academy of Science of Ukraine.

Oleg M. Lytvyn is Professor at the Department of Information Computing Technology and Mathematics at the Ukrainian Engineering Pedagogical Academy.


Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer Nature
Data di pubblicazione
2022
Lingua
Inglese
ISBN 10 
3030909069
ISBN 13 
9783030909062
Rilegatura
Copertina rigida
Numero edizione
1
Numero di pagine
396
Contatto del produttore
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Germania