Solving Sparse Integer Linear Systems
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Abstract
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.
Create a lesson
Related papers
StabQ: Quantum Program Analysis via Weighted Stabilizer Representations
Shangzhou Xia, Junjie Luo, Jianjun Zhao
Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language
Júlia de Araújo Mota, Iago Leal de Freitas, Lucas Rufino et al.
AutoSR: Automatic Symbolic Regression by Searching Research States
Kejia Zhang, Youran Sun, Xinyu Ren et al.
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
Daniel Keren
Technical Report: A Formal Semantics for Java Symbolic Evaluation using Large-Block Encoding
Soha Hussein, Stephen McCamant, Kelton OBrien et al.
Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
Shaoshi Chen, Hao Du, Yiman Gao et al.