tree 9492c274ea64313d4ee2f0235dcec3cb87c67915
parent 56c7e164f026c2a07ca6d4d3d81fcce2fd0c570e
author Benoit Jacob <jacob.benoit.1@gmail.com> 1232901186 +0000
committer Benoit Jacob <jacob.benoit.1@gmail.com> 1232901186 +0000

Optimization in LU::solve: when rows<=cols, no need to compute the L matrix
Remove matrixL() and matrixU() methods: they were tricky, returning a Part,
and matrixL() was useless for non-square LU. Also they were untested. This is
the occasion to simplify the docs (class_LU.cpp) removing the most confusing part.
I think that it's better to let the user do his own cooking with Part's.