Matters Computational: Ideas, Algorithms, Source Code

Front Cover
Springer Science & Business Media, Oct 1, 2010 - Computers - 966 pages
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.
 

What people are saying - Write a review

User Review - Flag as inappropriate

Must have for anyone who works in algorithmic development!
Wish I had enough time to go through the whole book!

Contents

Combinatorial generation
171
Fast transforms
409
Fast arithmetic
549
Algorithms for finite fields
763
The electronic version of the book
921
Machine used for benchmarking
922
The GP language
923
Bibliography
931
Index
951
Copyright

Other editions - View all

Common terms and phrases

About the author (2010)

Jörg Arndt: born 1964 in Berlin, Germany. Study of theoretical physics at the University of Bayreuth, and the Technical University of Berlin, Diploma in 1995. PhD in Mathematics, supervised by Richard Brent, at the Australian National University, Canberra, in 2010.

Bibliographic information