First time here? Check out the FAQ!

Ask Your Question
1

Solve large system of linear equations over GF(2)

asked 13 years ago

ji-o gravatar image

I need to solve a pretty large system of linear equations over GF(2) (The matrix is around 20000 x 20000). The straightforward approach used to solve linear equation systems (by using MatrixSpace and octave) will ran out of memory before even building up the matrix.

I wonder if there is any method i could use to solve such a system. Also note that the system i try to solve is sparse in general.

Preview: (hide)

2 Answers

Sort by » oldest newest most voted
1

answered 13 years ago

mmarco gravatar image

It's just a guess, but maybe a groebner basis over boolean algebra method would work. Look for documentation about the polybori interface.

Preview: (hide)
link
1

answered 13 years ago

malb gravatar image

Hi,

20,000 x 20,000 is not large and you should be able to do it in a few seconds on a modern CPU:

http://m4ri.sagemath.org/performance.html

However, Sage doesn't expose the fast code we have for this in M4RI:, cf.

http://m4ri.sagemath.org/doxygen/solve_8h.html

That's why it's not as fast as it should be. Sorry, we should fix this.

Preview: (hide)
link

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 13 years ago

Seen: 1,930 times

Last updated: Oct 13 '11