Solving Sparse Integer Linear Systems

Simple item page
dc.creatorEberly, Wayne
dc.creatorGiesbrecht, Mark
dc.creatorGiorgi, Pascal
dc.creatorStorjohann, Arne
dc.creatorVillard, Gilles
dc.date2006-03-21
dc.date.accessioned2026-07-07T07:05:53Z
dc.date.available2026-07-07T07:05:53Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0603082
dc.identifierhttp://arxiv.org/abs/cs/0603082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109826
dc.subjectSymbolic Computation
dc.subjectI.1.2
dc.titleSolving Sparse Integer Linear Systems
dc.typetext

Files

Collections

arXiv