Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Modern computer algebra
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Approximate algorithms to derive exact solutions to systems of linear equations
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Acceleration of Euclidean algorithm and extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Exact solutions to linear systems of equations using output sensitive lifting
ACM Communications in Computer Algebra
Numeric-symbolic exact rational linear system solver
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 |
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in well-conditioned cases or quickly aborts in ill-conditioned cases. Success of this algorithm on a linear equation requires that the linear system must be sufficiently well-conditioned for the numeric linear algebra method being used to compute a solution with sufficient accuracy. Our method is to find an initial approximate solution by using a numerical method, then amplify the approximate solution by a scalar, and adjust the amplified solution and corresponding residual to integers so that they can be computed without large integer arithmetic involved and can be stored exactly. Then we repeat these steps to refine the solution until sufficient accuracy is achieved, and finally reconstruct the rational solution. Our approximating, amplifying, and adjusting idea enables us to compute the solutions without involving high precision software floating point operations in the whole procedure or large integer arithmetic except at the final rational reconstruction step. We will expose the theoretical cost and show some experimental results.