國立虎尾科技大學 |

Elements of the General Theory of Optimal Algorithms

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Elements of the General Theory of Optimal Algorithms/ by Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn.
作者:	Sergienko, Ivan V.
其他作者:	Lytvyn, Oleg M.
面頁冊數:	XVII, 378 p. 9 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Optimization. -
電子資源:	https://doi.org/10.1007/978-3-030-90908-6
ISBN:	9783030909086

Elements of the General Theory of Optimal Algorithms
Sergienko, Ivan V.

Elements of the General Theory of Optimal Algorithms[electronic resource] /by Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn. - 1st ed. 2021. - XVII, 378 p. 9 illus.online resource. - Springer Optimization and Its Applications,1881931-6836 ;. - Springer Optimization and Its Applications,104.

-Preface -- Introduction -- List of symbols and abbreviations -- 1. Elements of the computing theory -- 2. Theories of computational complexity -- 3. Interlination of functions -- 4. Interflatation of functions -- 5. Cubature formulae using interlanation functions -- 6. Testing the quality of algorithm programs -- 7. Computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics -- Bilbiography -- Index -- About the Authors.

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.

ISBN: 9783030909086

Standard No.: 10.1007/978-3-030-90908-6doiSubjects--Topical Terms:

669174
Optimization.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Elements of the General Theory of Optimal Algorithms
LDR:02998nam a22003975i 4500 001 1059691
003 DE-He213
005 20220111102451.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030909086 $9 978-3-030-90908-6
024 7 $a 10.1007/978-3-030-90908-6 $2 doi
035 $a 978-3-030-90908-6
050 4 $a QA71-90
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518 $2 23
100 1 $a Sergienko, Ivan V. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 672340
245 1 0 $a Elements of the General Theory of Optimal Algorithms $h [electronic resource] / $c by Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVII, 378 p. 9 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Optimization and Its Applications, $x 1931-6836 ; $v 188
505 0 $a -Preface -- Introduction -- List of symbols and abbreviations -- 1. Elements of the computing theory -- 2. Theories of computational complexity -- 3. Interlination of functions -- 4. Interflatation of functions -- 5. Cubature formulae using interlanation functions -- 6. Testing the quality of algorithm programs -- 7. Computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics -- Bilbiography -- Index -- About the Authors.
520 $a 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.
650 2 4 $a Optimization. $3 669174
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 0 $a Algorithms. $3 527865
650 0 $a Mathematical optimization. $3 527675
650 0 $a Mathematics—Data processing. $3 1365953
700 1 $a Lytvyn, Oleg M. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1366507
700 1 $a Zadiraka, Valeriy K. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1366506
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030909062
776 0 8 $i Printed edition: $z 9783030909079
830 0 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 104 $3 1255232
856 4 0 $u https://doi.org/10.1007/978-3-030-90908-6
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)