Matters Computational: Ideas, Algorithms, Source Code

by Jïrg Arndt

Overview

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.

Product Details

ISBN-13:	9783642147630
Publisher:	Springer Berlin Heidelberg
Publication date:	12/23/2010
Edition description:	2011
Pages:	966
Product dimensions:	7.80(w) x 10.40(h) x 1.70(d)

About the Author

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.

Table of Contents

Low level algorithms.- Bit wizardry.- Permutations and their operations.- Sorting and searching.- Data structures.- Combinatorial generation.- Conventions and considerations.- Combinations.- Compositions.- Subsets.- Mixed radix numbers.- Permutations.- Multisets.- Gray codes for string with restrictions.- Parenthesis strings.- Integer partitions.- Set partitions.- Necklaces and Lyndon words.- Hadamard and conference matrices.- Searching paths in directed graphs.- Fast transforms.- The Fourier transform.- Convolution, correlation, and more FFT algorithms.- The Walsh transform and its relatives.- The Haar transform.- The Hartley transform.- Number theoretic transforms (NTTs).- Fast wavelet transforms.- Fast arithmetic.- Fast multiplication and exponentiation.- Root extraction.- Iterations for the inversion of a function.- The AGM, elliptic integrals, and algorithms for computing.- Logarithm and exponential function.- Computing the elementary functions with limited resources.- Numerical evaluation of power series.- Cyclotomic polynomials, product forms, and continued fractions.- Synthetic Iterations.-. Algorithms for finite fields.- Modular arithmetic and some number theory.- Binary polynomials.- Shift registers.- Binary finite fields.- The electronic version of the book.- Machine used for benchmarking.- The GP language.- Bibliography.- Index.

Editorial Reviews

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)

From the Publisher