[Edu-sig] Annotate Algorithms in Python

[DiPierro, Massimo]

Welcome everybody,


I just finished a book on Numerical Algorithms in Python:


http://www.amazon.com/Annotated-Algorithms-Python-Applications-Physics/dp/0991160401


It covers many algorithms including:

- merge sort

- binary sort

- heap sort

- priority queues

- tree search

- tree traversing

- topological sort

- Dijkstra

- Prim

- disjoint sets

- Huffman encoding

- linear algebra

- Cholesky

- Gauss-Jordan

- sparse matrix inversion (minres, bicgstab)

- Newton solver

- Newton optimizer

- bisection method

- secant method

- golden section method

- multi-dimensional solver

- least squares

- chi square fitting

- numerical integration by quadrature

- Fourier transform and fft

- random number generators

- Monte Carlo simulations

- parallelization with mpi4py, pyOpenCL, and OCL

- Map-Reduce


They all come with examples and applications.

The book contains the entire source code (pure python) and does use numpy.

The point of the book is not teaching existing API but showing/discussing python code.

Most of the code presented in the book can be downloaded here: https://github.com/mdipierro/nlib


Massimo