better linear algebra

[VeganFanatic]

OK I have a boat load of code, it works, bit its unaware of vectors etc. I have a vector template that fully supports all standard operators, including scalars I have a matrix template that supports all standard operators, including vectors and scalars So give some matrix m int rows=m.data.size() int cols=m.data[0].size(); what can we do to make m become reduced row echelon form no back substitution yet, I just wanted to see a vector way to identify a pivot from m and make it reduced form this way I it should be easier to find the rank etc. So as I see it we need to find a pivot My matrix works with std::swap for any 2 rows My m[] returns a vector, m[][] returns template_class m = m + v[] works m = m + template_class works so do the other operators I made it assignable by element or row BTW my vector and matrix templates are parallel, hence the reason I wanted to leverage them

http://www.contract-developer.tk