Given m = 385 , I have a linear equation system over a field <mrow class="MJX-T

il2k3s2u7

il2k3s2u7

Answered question

2022-05-20

Given m = 385, I have a linear equation system over a field F p with p a small prime (could be 5,7,11, something like this) with the following properties:
1.There are m 2 variables.
2. Every variable appears in exactly 7 equation.
3. Every equation contains at most 3 variables.
4. The coefficient of the variables is always 1.
5.The free term in the equations are always 0, with one specific equation (an equation of the form 3 x = 1 for a specific variable x).
I am currently using SAGE. It solved nicely smaller equation systems, but this one killed it, even when constructing the matrix as sparse ("Error allocating matrix"). The question is - should I simply try a better (and less convenient) sparse matrix handling package, or is there a better way to deal with such sparse systems of equations? (I can do a little programming myself if needed).

Answer & Explanation

Giovani Hickman

Giovani Hickman

Beginner2022-05-21Added 6 answers

Since you have constant number of non-zero entries per row, your system is fit for iterative methods, namely in finite fields case: Wiedemann's algorithm.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?