Question: Hello,
I'm looking for a general algortihm, but I also use Waterloo's Maple 10:
Using Maple, msolve(eqns, 2) is a great tool.
Say I have a set of linear equations with far too many unknowns. I can
msolve them over mod 2 and Maple will return thousands of solutions
(_MaxSolns is modified). However, I just want the sparsest solutio…

Answer: I don't think there is an approach better than brute-force.
Say your linear equations are of the traditional form M*x = b.
When you have solved your mod-2 linear equations, the solution space takes the form of:
x = x0 + M0 * r
where x0 is an arbitr…

Verified Answer?

by:bagalpPosted on 1998-03-02 at 08:49:33ID: 1182531

Your problem will be solved when you into any standard book on Numerical Analysis. They have all sorts of methods to solve all sort of equations.