Hougardy / Vygen Algorithmic Mathematics

1. Auflage 2016
ISBN: 978-3-319-39558-6
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 163 Seiten

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.

Zielgruppe

Lower undergraduate

Autoren/Hrsg.

Hougardy, Stefan

Vygen, Jens

Weitere Mitwirkende

von Randow, Rabe

Inhaltsverzeichnis

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

Über Autor(innen)

Stefan Hougardy is professor of discrete mathematics at the University of Bonn. His research interests include combinatorial optimization and chip design.

Jens Vygen is professor of discrete mathematics at the University of Bonn. His research interests include combinatorial optimization and chip design.