Certified dense linear system solving

Journal of Symbolic Computation

Volumn 37, Issue 4, 2004, Pages 485-510

  Mulders, Thorn ^a   Storjohann, A ^b  

^a COMIT AG ^*  (Switzerland)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Diophantine system solution; Integer matrix; Las Vegas; Linear system solution; Polynomial matrix; Randomized algorithm

Indexed keywords

EID: 1942477456     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2003.07.004     Document Type: Article

References (20)

1. Dixon, J.D., 1982. Exact solution of linear equations using p-adic expansions. Numer. Math. 40, 137-141.
2. Giesbrecht. M., 1993. Nearly optimal algorithms for canonical matrix forms. Ph.D. Thesis, University of Toronto.
3. Giesbrecht, M., 1997. Efficient parallel solution of sparse systems of linear Diophantine equations. In: Hitz, M., Kaltofen, E. (Eds.), PASCO'97, Second Int'l Symp. on Parallel Symbolic Computation. ACM Press, New York, pp. 1-10.
4. Giesbrecht, M., Lobo, A., Saunders, B.D., 1998. Certifying inconsistency of sparse linear systems. In: Gloor, O. (Ed.), ISSAC'98, Proc. Int'l. Symp. on Symbolic and Algebraic Computation. ACM Press, New York, pp. 113-119.
5. Hardy, G.H., Wright, E.M., 1979. An Introduction to the Theory of Numbers. Oxford University Press, Oxford.
6. Horn, R.A., Johnson, C.R., 1985. Matrix Analysis. Cambridge University Press, Cambridge.
7. Knuth, D.E., 1981. The Art of Computer Programming. Seminumerical Algorithms, second ed., vol. 2. Addison-Wesley, Reading, MA.
8. Lang, S., 1986. Algebraic Number Theory. Springer-Verlag, New York.
9. Lidl, R., Niederreiter, H., 1983. Finite Fields. Addison-Wesley, Reading, MA.
10. Moenck, R.T., Carter, J.H., 1979. Approximate algorithms to derive exact solutions to systems of linear equations. In: Ng, E.W. (Ed.), Proc. EUROSAM' 79. LNCS vol. 72. Springer, Heidelberg, pp. 65-73.
11. Mulders, T., Storjohann, A., 1999. Diophantine linear system solving. In: Dooley, S. (Ed.), ISSAC'99, Proc. Int'l. Symp. on Symbolic and Algebraic Computation. ACM Press, New York, pp. 181-188.
12. Mulders, T., Storjohann, A., 2000. Rational solutions of singular linear systems. In: Traverso, C. (Ed.), ISSAC'00, Proc. Int'l. Symp. on Symbolic and Algebraic Computation. ACM Press, New York, pp. 242-249.
13. Rosser, J.B., Schoenfeld, L., 1962. Approximate formulas for some functions of prime numbers. Illinois J. Math. 6, 64-94.
14. Shoup, V., 1994. Fast construction of irreducible polynomials over finite fields. J. Symbolic Comput. 17, 371-391.
15. Storjohann. A., 2000. Algorithms for matrix canonical forms. Ph.D. Thesis, Swiss Federal Institute of Technology, ETH-Zurich.
16. Storjohann, A., 2003. High-order lifting and integrality certification. J. Symbolic Comput. 36 (3-4), 613-648.
17. Storjohann, A., Mulders, T., 1998. Fast algorithms for linear algebra modulo N. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (Eds.), ESA'98, Proc. of Sixth Ann. Europ. Symp. on Algorithms. LNCS vol. 1461. pp. 139-150.
18. von zur Gathen, J., Gerhard, J., 1999. Modern Computer Algebra. Cambridge University Press, Cambridge.
19. Wang, X., Pan, V.Y., 2003. Acceleration of Euclidean algorithm and rational number reconstruction. SIAM J. Comput. 32 (2), 548-556.
20. Wiedemann, D., 1986. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory IT-32, 54-62.