Quote:
Originally Posted by R1zZ1
Hi all, I'm an italian student and I need your support.
I'm implementing MPQS with GMP, the implemented sieving algorithm works fine and I obtain the sparse matrix representing the good relations that I can use to solve the linear algebra and find factors.
My problem is just to solve the linear algebra. I need a C++ implementation or Pari/GP function that find these solutions using gaussian elimination or lanczos (faster, right?).

Lanczos is much faster than Gauss elimination.
There are several MPQS implementations linked to the sticky at the top of the factoring forum; they all have to solve this problem, and there's plenty of code to browse.
jasonp