I am interested in solving large (n
up to 10^5 or maybe even 10^6) rectangular (maybe 10% more columns than rows) sparse (< 10 nonzeros per row) systems Ax = b
over a finite field GF(q)
(q
might be a prime near 1000 or so). From the literature, it looks like block Lanczos methods might be the most appropriate.
I have Linbox which is supposed to have such methods, but have been unable to get the BlockLanczos solver there to work, and one report says that this has been broken since 2003. The SparseElimination
method does work, but it seems that this will not work well for large n
because of fill-in of the matrix.
So, what is available that does work for such problems?