Using the Temporary Base Class Idiom (TBCI), high performance C++ classes for
Vectors, Matrices, various sparse Matrices (Band diagonal, Compressed Column, ...)
have been implemented.
The second large part of the library has a selection of solvers for (sparse)
linear systems. Optimized direct solvers (Gauss-Jordan, LU-decomposition,
Singular-Value-Decomposition) and iterative solvers (Krylov subspace methods,
such as BiConjugate Gradient, CGS, BiCGStab, QMR, ...) are implemented along
with PreConditioners.