Computer Science – Symbolic Computation
Scientific paper
2006-03-21
Computer Science
Symbolic Computation
Scientific paper
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic complexity in terms of machine operations subject to a conjecture on the effectiveness of certain sparse projections. A LinBox-based implementation of this algorithm is demonstrated, and emphasizes the practical benefits of this new method over the previous state of the art.
Eberly Wayne
Giesbrecht Mark
Giorgi Pascal
Storjohann Arne
Villard Gilles
No associations
LandOfFree
Solving Sparse Integer Linear Systems 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 Solving Sparse Integer Linear Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Sparse Integer Linear Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-302255