![]() |
Linear algebra in MPQS
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?). Thx in advance! |
I'll also appreciate if you indicate me a C++ library with a function that solves equations system over Z_2.
Lidia has a function named solve() but i am not sure that it works with sparse matrix modulo 2 and gives me a valid solution. bye |
[QUOTE=R1zZ1;97477]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?). [/QUOTE] 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 |
All times are UTC. The time now is 18:18. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.