High-order lifting and integrality certification

Journal of Symbolic Computation

Volumn 36, Issue 3-4, 2003, Pages 613-648

  Storjohann, Arne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042706308     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00097-X     Document Type: Article

References (18)

1. Dixon, J.D., 1982. Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40, 137-141.
2. Eberly, W., Giesbrecht, M., Villard, G., 2000. Computing the Smith form of a dense integer matrix. In: Proc. 31st Ann. IEEE Symp. Foundations of Computer Science. pp. 675-685.
3. Giorgi, P., Jeannerod, C.-P., Villard, G., 2003. On the complexity of polynomial matrix computations. Research Report 2003-2. Laboratoire LIP, ENS Lyon, France.
4. Hafner, J.L., McCurley, K.S., 1991. Asymptotically fast triangularization of matrices over rings. SIAM Journal of Computing 20 (6), 1068-1083.
5. Kailath, T., 1980. Linear Systems. Prentice Hall, Englewood Cliffs, NJ.
6. Kaltofen, E., Krishnamoorthy, M.S., Saunders, B.D., 1990. Parallel algorithms for matrix normal forms. Linear Algebra and its Applications 136, 189-208.
7. Karatsuba, A., Ofman, Y., 1963. Multiplication of multidigit numbers on automata. Soviet Physics-Doklady 7, 595-596.
8. Moenck, R.T., Carter, J.H., 1979. Approximate algorithms to derive exact solutions to systems of linear equations. In: Proc. EUROSAM'79. Lecture Notes in Compute Science, vol. 72. Springer-Verlag, Berlin, Heidelberg, New York, pp. 65-72.
9. 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. 281-288.
10. 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.
11. Mulders, T., Storjohann, A., 2003. On lattice reduction for polynomial matrices. Journal of Symbolic Computation 35 (4), 377-401.
12. Mulders, T., Storjohann, A., 2003. Certified diophantine dense linear system solving. Journal of Symbolic Computation (in press).
13. Shoup, V., 1994. Fast construction of irreducible polynomials over finite fields. Journal of Symbolic Computation 17, 371-391.
14. Storjohann, A., 2000. Algorithms for matrix canonical forms, Ph.D. Thesis. Swiss Federal Institute of Technology, ETH, Zurich.
15. Storjohann, A., Labahn, G., 1995. Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation. In: Levelt, A.H.M. (Ed.), ISSAC'95, Proc. Int'l. Symp. on Symbolic and Algebraic Computation. ACM Press, New York, pp. 119-125.
16. Strassen, V., 1973. Vermeidung von Divisionen. Journal für die Reine und Angewandte Mathematik 264, 182-202.
17. Villard, G., 1996. Computing Popov and Hermite forms of polynomial matrices. In: Lakshman, Y.N. (Ed.), ISSAC'96, Proc. Int'l. Symp. on Symbolic and Algebraic Computation. ACM Press, New York, pp. 251-258.
18. von zur Gathen, J., Gerhard, J., 1999. Modern Computer Algebra. Cambridge University Press.