Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Theory of linear and integer programming
Theory of linear and integer programming
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
A course in computational algebraic number theory
A course in computational algebraic number theory
Efficient rational number reconstruction
Journal of Symbolic Computation
Diophantine linear system solving
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast deterministic computation of determinants of dense matrices
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A Supernodal Approach to Sparse Partial Pivoting
SIAM Journal on Matrix Analysis and Applications
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
On efficient sparse integer matrix Smith normal form computations
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Acceleration of Euclidean Algorithm and Rational Number Reconstruction
SIAM Journal on Computing
Certifying and repairing solutions to large LPs how good are LP-solvers?
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A p-adic algorithm for univariate partial fractions
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Modern Computer Algebra
On Rational Number Reconstruction and Approximation
SIAM Journal on Computing
Solving unsymmetric sparse systems of linear equations with PARDISO
Future Generation Computer Systems - Special issue: Selected numerical algorithms
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
ACM Transactions on Mathematical Software (TOMS)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
An algorithm to solve integer linear systems exactly using numerical methods
Journal of Symbolic Computation
Algorithms for solving linear systems over cyclotomic fields
Journal of Symbolic Computation
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Operations Research Letters
Exact solutions to linear programming problems
Operations Research Letters
Operations Research Letters
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Vector rational number reconstruction
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Improving the accuracy of linear programming solvers with iterative refinement
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
Efficient methods for solving linear-programming problems in exact precision rely on the solution of sparse systems of linear equations over the rational numbers. We consider a test set of instances arising from exact-precision linear programming and use this test set to compare the performance of several techniques designed for symbolic sparse linear-system solving. We compare a direct exact solver based on LU factorization, Wiedemann’s method for black-box linear algebra, Dixon’s p-adic-lifting algorithm, and the use of iterative numerical methods and rational reconstruction as developed by Wan.