Artículos relacionados a Elements of the General Theory of Optimal Algorithms:...

Elements of the General Theory of Optimal Algorithms: 188 (Springer Optimization and Its Applications, 188) - Tapa dura

Libro 173 de 176: Springer Optimization and Its Applications

Sergienko, Ivan V.; Lytvyn, Oleg M.; Zadiraka, Valeriy K.

 
9783030909062: Elements of the General Theory of Optimal Algorithms: 188 (Springer Optimization and Its Applications, 188)
Tapa dura
ISBN 10: 3030909069 ISBN 13: 9783030909062
Editorial: Springer, 2022

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

​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.


De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2022
Idioma
Inglés
ISBN 10 
3030909069
ISBN 13 
9783030909062
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
398
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania