::easycnm - Computer Numerics Library

The easiest way of using the library is to look at the example code. Note that not all cases are bulletproof yet - especially the cases of dividing by zero, non-square matrices and the like are going to cause you some headache.

It is part of the tarball, but you can view a html-ified version right here.

The following algorithms have already been implemented:

- Linear: Gauß
- Linear: LU dissection
- Linear: Cholesky dissection
- Linear iterative: Jacobi iteration (wholestep)
- Linear iterative: Gauß-Seidel iteration (singlestep)
- Least squares: Gaußian normalized equations
- Least squares: Householder algorithm

Design © 2005 by Max aka t-3k (via OSWD)