大葉大學圖書館 |

Algorithmic mathematics[electronic resource] /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	518.1
書名/作者:	Algorithmic mathematics/ by Stefan Hougardy, Jens Vygen.
作者:	Hougardy, Stefan.
其他作者:	Vygen, Jens.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xiii, 163 p. : : ill. (some col.), digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Algorithms.
標題:	Mathematics.
ISBN:	9783319395586
ISBN:	9783319395579
內容註:	1 Introduction -- 2 Representations of the Integers -- 3 Computing with Integers -- 4 Approximate Representations of the Real Numbers -- 5 Computing with Errors -- 6 Graphs -- 7 Simple Graph Algorithms -- 8 Sorting Algorithms -- 9 Optimal Trees and Paths -- 10 Matchings and Network Flows -- 11 Gaussian Elimination -- Bibliography -- Index.
摘要、提要註:	Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
電子資源:	http://dx.doi.org/10.1007/978-3-319-39558-6

Algorithmic mathematics[electronic resource] /
Hougardy, Stefan.

Algorithmic mathematics[electronic resource] /by Stefan Hougardy, Jens Vygen. - Cham :Springer International Publishing :2016. - xiii, 163 p. :ill. (some col.), digital ;24 cm.

1 Introduction -- 2 Representations of the Integers -- 3 Computing with Integers -- 4 Approximate Representations of the Real Numbers -- 5 Computing with Errors -- 6 Graphs -- 7 Simple Graph Algorithms -- 8 Sorting Algorithms -- 9 Optimal Trees and Paths -- 10 Matchings and Network Flows -- 11 Gaussian Elimination -- Bibliography -- Index.

Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

ISBN: 9783319395586

Standard No.: 10.1007/978-3-319-39558-6doiSubjects--Topical Terms:

182797
Algorithms.

LC Class. No.: QA9.58

Dewey Class. No.: 518.1

Algorithmic mathematics[electronic resource] /
LDR:02199nmm a2200313 a 4500 001 467651
003 DE-He213
005 20161014172331.0
006 m d
007 cr nn 008maaau
008 170511s2016 gw s 0 eng d
020 $a 9783319395586 $q (electronic bk.)
020 $a 9783319395579 $q (paper)
024 7 $a 10.1007/978-3-319-39558-6 $2 doi
035 $a 978-3-319-39558-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.58
072 7 $a PBKS $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 518.1 $2 23
090 $a QA9.58 $b .H838 2016
100 1 $a Hougardy, Stefan. $3 673061
245 1 0 $a Algorithmic mathematics $h [electronic resource] / $c by Stefan Hougardy, Jens Vygen.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xiii, 163 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a 1 Introduction -- 2 Representations of the Integers -- 3 Computing with Integers -- 4 Approximate Representations of the Real Numbers -- 5 Computing with Errors -- 6 Graphs -- 7 Simple Graph Algorithms -- 8 Sorting Algorithms -- 9 Optimal Trees and Paths -- 10 Matchings and Network Flows -- 11 Gaussian Elimination -- Bibliography -- Index.
520 $a Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
650 0 $a Algorithms. $3 182797
650 1 4 $a Mathematics. $3 172349
700 1 $a Vygen, Jens. $3 467593
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-39558-6
950 $a Mathematics and Statistics (Springer-11649)