Matters Computational

Beschreibung

This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.
This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.
Complete solutions with source code, examples, and illustrations Material that is rarely covered elsewhere or completely new Software is supplied online, including the examples

Autor*in

Jörg Arndt

Themen in »Matters Computational«

Algorithms Arithmetic Combinatorics Finite fields Fourier transform algorithm analysis and problem complexity

Stimmen zu »Matters Computational«

From the reviews:

“The book is a comprehensive compilation of well written software codes as well as short explanation texts for basic methods of computation. It fills a gap in the literature since most books in this area describe either the methods or the codes provided in specialized libraries.” (Dana Petcu, Zentralblatt MATH, Vol. 1210, 2011)

“It is thorough, and covers many algorithms that one does not often see in algorithmic texts. … This may be an invaluable reference to some people, since it does provide excellent coverage of algorithms that are not frequently compiled into a single volume. … In short, this is a wonderful compilation of many algorithms that don’t show up in other places, with reasonable … commentary and an abundance of code. … this is the kind of book libraries will put on their shelves … .” (Jeffrey Putnam, ACM Computing Reviews, July, 2011)

Details

Link teilen