國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Elements of the general theory of op...

Lytvyn, Oleg M.

Elements of the general theory of optimal algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Elements of the general theory of optimal algorithmsby Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn.
作者:	Sergienko, Ivan Vasilʹevich.
其他作者:	Zadiraka, Valeriy K.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	1 online resource (xvii, 378 p.) :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Algorithms.
電子資源:	https://doi.org/10.1007/978-3-030-90908-6
ISBN:	9783030909086$q(electronic bk.)

Elements of the general theory of optimal algorithms
Sergienko, Ivan Vasilʹevich.

Elements of the general theory of optimal algorithms[electronic resource] /by Ivan V. Sergienko, Valeriy K. Zadiraka, Oleg M. Lytvyn. - Cham :Springer International Publishing :2021. - 1 online resource (xvii, 378 p.) :ill., digital ;24 cm. - Springer optimization and its applications,v. 1881931-6836 ;. - Springer optimization and its applications ;v. 3..

-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$q(electronic bk.)

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

184661
Algorithms.

LC Class. No.: QA9.58 / S47 2021

Dewey Class. No.: 518.1

Elements of the general theory of optimal algorithms
LDR:02716nmm a2200337 a 4500 001 614866
003 DE-He213
005 20220111102451.0
006 m o d
007 cr nn 008maaau
008 220802s2021 sz s 0 eng d
020 $a 9783030909086$q(electronic bk.)
020 $a 9783030909062$q(paper)
024 7 $a 10.1007/978-3-030-90908-6 $2 doi
035 $a 978-3-030-90908-6
040 $a GP $c GP
041 1 $a eng $h ukr
050 4 $a QA9.58 $b S47 2021
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA9.58 $b .S484 2021
100 1 $a Sergienko, Ivan Vasilʹevich. $3 913377
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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a 1 online resource (xvii, 378 p.) : $b ill., digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6836 ; $v 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 0 $a Algorithms. $3 184661
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 274020
650 2 4 $a Optimization. $3 274084
700 1 $a Zadiraka, Valeriy K. $3 913378
700 1 $a Lytvyn, Oleg M. $3 913379
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Springer optimization and its applications ; $v v. 3. $3 440366
856 4 0 $u https://doi.org/10.1007/978-3-030-90908-6
950 $a Mathematics and Statistics (SpringerNature-11649)