Efficient Decomposition of Dense Matrices over GF(2)

Details Efficient Decomposition of Dense Matrices over GF(2) Efficient Decomposition of Dense Matrices over GF(2)

2010-06-09

arxiv.org/abs/1006.1744v1

Computer Science

Mathematical Software

Scientific paper

In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense systems of linear and non-linear equations and thus much research has been devoted to improve the asymptotic complexity of such algorithms. In this work we discuss an implementation of both well-known and improved algorithms in the M4RI library. The focus of our discussion is on a new variant of the M4RI algorithm - denoted MMPF in this work -- which allows for considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86_64 CPUs to demonstrate the viability of our approach.

Affiliated with

Also associated with

No associations

Rating

Efficient Decomposition of Dense Matrices over GF(2) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Decomposition of Dense Matrices over GF(2), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Decomposition of Dense Matrices over GF(2) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39535