C++ for Scientists - Technische Universität Dresden

11.4. MATRIX TEMPLATE LIBRARY 249
coordinate format. The matrix is stored column wise. The template argument 1 indicates that
row and column numbers start from one, which is required for the Fortran 90 code MUMPS.
Finally, the last argument indicates that the row and column indices are stored in type int,
which is also a requirement for the Fortran 90 interface. The solve consists of three phases :
(1) the analysis phase, which only needs the matrix’ integer data, (2) the factorization phase,
where also the numerical values are required and (3) the solution phase (or backtransformation),
where the right-hand side vector is passed on. The included files contain the specializations of
the dense matrix and sparse matrix traits for uBLAS and the MUMPS bindings.
11.4 Matrix Template Library
11.5 Blitz++
TODO: We can ask Todd to write something himself — Peter
11.6 Graph Libraries
TODO: Few introducing words from Peter
11.6.1 Boost Graph Library
TODO: I can write something about it — Peter
11.6.2 LEDA
LEDA implements advanced container types and combinatorial algorithms, especially graph
algorithms. Containers are parameterized by element type and implementation strategies. Algorithms
in general work only with the data structure of the library itself.
11.7 Geometric Libraries
TODO: Few introducing words from René and Philipp
11.7.1 CGAL
TODO: Ask Sylvain to write something? Or can René and Philipp write it?
CGAL implements generic classes and procedures for geometric computing. The data structure
complexity is at a very high level.