Solving very sparse rational systems of equations

ACM Transactions on Mathematical Software

Volumn 37, Issue 4, 2011, Pages

  Cook, William ^a   Steffy, Daniel E ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Dixon's algorithm; Linear programming; LU factorization; Rational systems; Sparse matrices; Wiedemann's method

Indexed keywords

DIXON'S ALGORITHM; LU FACTORIZATION; RATIONAL SYSTEMS; SPARSE MATRICES; WIEDEMANN'S METHOD;

ALGORITHMS; FACTORIZATION; LINEAR PROGRAMMING; MATRIX ALGEBRA;

NUMERICAL METHODS;

EID: 79952496652     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1916461.1916463     Document Type: Article

References (58)

1. ABBOTT, J. AND MULDERS, T. 2001. How tight is Hadamard's bound? Exp. Math. 10, 3, 331-336.
2. ABBOTT, J., BRONSTEIN, M., AND MULDERS, T. 1999. Fast deterministic computation of determinants of dense matrices. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'99). ACM, New York, NY, 197-204.
3. ACHTERBERG, T., KOCH, T., AND MARTIN, A. 2006. MIPLIB 2003. Oper. Res. Lett. 34, 361-372.
4. APPLEGATE, D., COOK, W., AND DASH, S. 2005. QSopt. http://www.isye. gatech.edu/~wcook/qsopt/.
5. APPLEGATE, D. L., BIXBY, R. E., CHVÁTAL, V., AND COOK, W. J. 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ.
6. APPLEGATE, D. L.,COOK, W.,DASH, S., AND ESPINOZA, D. G. 2007. Exact solutions to linear programming problems. Oper. Res. Lett. 35, 693-699. (Pubitemid 47483975)
7. BERLEKAMP, E. R. 1967. Factoring polynomials over finite fields. Bell Syst. Tech. J. 46, 1853-1859.
8. BIXBY, R. E., CERIA, S., MCZEAL, C. M., AND SAVELSBERGH, M. W. P. 1998. An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12-15.
9. CHEN, Z. 2005. A BLAS based C library for exact linear algebra over integer matrices. M.S. thesis. School of Computer Science, University of Waterloo, Waterloo, ON, Canada.
10. CHEN, L. AND MONAGAN, M. 2010. Algorithms for solving linear systems over cyclotomic fields. J. Symbol. Computat. 45, 9, 902-911.
11. CHEN, Z. AND STORJOHANN, A. 2005. A BLAS based C library for exact linear algebra on integer matrices. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'05). ACM, New York, NY, 92-99. (Pubitemid 44531653)
12. CHVÁTAL, V. 1983. Linear Programming. W. H. Freeman and Company, New York, NY.
13. COHEN, H. 2000. A Course in Computational Algebraic Number Theory. Springer, New York, NY.
14. COLLINS, G. E. AND ENCARNACIÓN, M. J. 1995. Efficient rational number reconstruction. J. Symbol. Comp. 20, 287-297.
15. DEMMEL, J. W., EISENSTAT, S. C., GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755. (Pubitemid 129332599)
16. DHIFLAOUI, M., FUNKE, S., KWAPPIK, C., MEHLHORN, K., SEEL, M., SCHÖMER, E., SCHULTE, R., AND WEBER, D. 2003. Certifying and repairing solutions to large LPs: How good are LP-solvers? In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03). SIAM, Philadelphia, PA, 255-256.
17. DIXON, J. D. 1982. Exact solution of linear equations using p-adic expansion. Num. Math. 40, 137-141.
18. DONGARRA, J. J., CROZ, J. D.,HAMMARLING, S., AND DUFF, I. S. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17. (Pubitemid 20684794)
19. DUMAS, J.-G. AND VILLARD, G. 2002. Computing the rank of large sparse matrices over finite fields. In Proceedings of the 5th International Workshop on Computer Algebra in Scientific Computing (CASC'02). 63-74.
20. DUMAS, J.-G., SAUNDERS, B. D., AND VILLARD, G. 2001. On efficient sparse integer matrix Smith normal form computations. J. Symbol. Comput. 32, 71-99. (Pubitemid 33663780)
21. DUMAS, J.-G.,GAUTIER, T.,GIESBRECHT, M.,GIORGI, P.,HOVINEN, B.,KALTOFEN, E., SAUNDERS, B. D., TURNER, W. J., AND VILLARD, G. 2002. LinBox: A generic library for exact linear algebra. In Mathematical Software: ICMS 2002. A. M. Cohen, X.-S. Gao, and N. Takayama Eds., World Scientific, Singapore, 40-50.
22. DUMAS, J.-G., GIORGI, P., AND PERNET, C. 2008. Dense linear algebra over word-size prime fields: The FFLAS and FFPACK packages. ACM Trans. Math. Softw. 35, 3, Article 19.
23. EBERLY, W., GIESBRECHT, M., GIORGI, P., STORJOHANN, A., AND VILLARD, G. 2006. Solving sparse rational linear systems. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'06). ACM, New York, NY, 63-70. (Pubitemid 44438952)
24. EMIRIS, I. Z. 1998. A complete implementation for computing general dimensional convex hulls. Int. J. Comp. Geom. Appli. 8, 223-253. (Pubitemid 128536563)
25. ESPINOZA, D. G. 2006. On linear programming, integer programming and cutting planes. Ph.D. dissertation. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
26. GAY, D. M. 1985. Electronic mail distribution of linear programming test problems. COAL Newsl. 13, 10-12.
27. GMP. 2008. GNU multiple precision arithmetic library, version 4.2. http://gmplib.org.
28. GOLUB, G. AND VAN LOAN, C. 1983. Matrix Computations. Johns Hopkins University Press, Baltimore, MD.
29. GOULD, N. I. M., SCOTT, J. A., AND HU, Y. 2007. A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. 33, 2, Article 10.
30. HALES, T. C. 2005. A proof of the Kepler conjecture. Ann. Math. 162, 1065-1185. (Pubitemid 44047882)
31. ILOG. 2007. User's Manual, ILOG CPLEX 11.0. ILOG CPLEX Division, Incline Village, NV.
32. KALTOFEN, E. 2002. An output-sensitive variant of the baby steps/giant steps determinant algorithm. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'02). ACM, New York, NY, 138-144. (Pubitemid 35023382)
33. KALTOFEN, E. AND ROLLETSCHEK, H. 1989. Computing greatest common divisors and factorizations in quadratic number fields. Math. Comp. 53, 188, 697-720.
34. KALTOFEN, E. AND SAUNDERS, B. D. 1991. On Wiedemann's method of solving sparse linear systems. In Proceedings of the 9th International Symposium on Applied, Algebraic Algorithms, Error-Correcting Codes. Lecture Notes in Computer Science, vol. 539. Springer, Berlin, Germany, 29-38.
35. KHODADAD, S. AND MONAGAN, M. 2006. Fast rational function reconstruction. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'06). ACM, New York, NY, 184-190. (Pubitemid 44438967)
36. KOCH, T. 2004. The final NETLIB-LP results. Oper. Res. Lett. 32, 138-142.
37. KWAPPIK, C. 1998. Exact linear programming. M.S. thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany.
38. LAWSON, C. L.,HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979. Basic linear algebra subprograms for fortran usage. ACM Trans. Math. Softw. 5, 3, 308-323. (Pubitemid 10415072)
39. LICHTBLAU, D. 2005. Half-GCD and fast rational recovery. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'05). ACM, New York, NY, 231-236. (Pubitemid 44531668)
40. MASSEY, J. L. 1969. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theor. 15, 122-127.
41. MÉSZÁROS, C. 2006. LPtestset. http://www.sztaki.hu/ ~meszaros/public-ftp/lptestset/.
42. MITTELMANN, H. D. 2006. LPtestset. http://plato.asu.edu/ftp/lptestset/.
43. MONAGAN, M. 2004. Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. In Proceedings of the International Symposium on Symbolic and Algebraic Computation. ACM, New York, NY, 243-249. (Pubitemid 41550455)
44. MULDERS, T. AND STORJOHANN, A. 1999. Diophantine linear system solving. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'99). ACM, New York, NY, 181-188.
45. PAN, V. Y. AND WANG, X. 2003. Acceleration of Euclidean algorithm and rational number reconstruction. SIAM J. Comp. 32, 548-556.
46. PAN, V. Y. AND WANG, X. 2004. On rational number reconstruction and approximation. SIAM J. Comp. 33, 502-503.
47. REINELT, G. 1991. TSPLIB-a traveling salesman library. ORSA J. Comp. 3, 376-384.
48. SCHENK, O. AND GÄRTNER, K. 2004. Solving unsymmetric sparse systems of linear equations with PARDISO. J. Fut. Gen. Comp. Syst. 3, 20, 475-487.
49. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. Wiley, Chichester, U.K.
50. SHOUP, V. 2008. NTL: A library for doing number theory. http://www.shoup.net/ntl/.
51. STEFFY, D. 2010. Exact solutions to linear systems of equations using output sensitive lifting. ACM Comm. Comput. Algebra 44, 4, 160-182.
52. SUHL, U. H. AND SUHL, L. M. 1990. Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comp. 2, 4, 325-335.
53. URSIC, S. AND PATARRA, C. 1983. Exact solution of systems of linear equations with iterative methods. SIAM J. Matrix Anal. Appl. 4, 1, 111-115.
54. VANDERBEI, R. J. 2001. Linear Programming: Foundations and Extensions. Kluwer, Boston, MA.
55. VON ZUR GATHEN, J. AND GERHARD, J. 2003. Modern Computer Algebra. Cambridge University Press, Cambridge, U.K.
56. WAN, Z. 2006. An algorithm to solve integer linear systems exactly using numerical methods. J. Symbol. Comp. 41, 621-632. (Pubitemid 43585364)
57. WANG, P. S. 1981. A p-adic algorithm for univariate partial fractions. In Proceedings of the 4th ACM Symposium on Symbolic and Algebraic Computation (SYMSAC'81). ACM, New York, NY, 212-217.
58. WIEDEMANN, D. H. 1986. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor. 32, 54-62.