Vector rational number reconstruction

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2011, Pages 51-57

  Bright, Curtis ^a   Storjohann, Arne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

lattice basis reduction; rational reconstruction

Indexed keywords

ALGEBRAIC ALGORITHMS; BIT-OPERATIONS; COMMON DENOMINATORS; LATTICE BASIS REDUCTION; LATTICE REDUCTION; RATIONAL NUMBERS; RATIONAL RECONSTRUCTION; RATIONAL SOLUTION; REDUCTION ALGORITHMS; ROBUST METHODS; SUB-LATTICES;

ALGORITHMS; LINEAR SYSTEMS;

ALGEBRA;

EID: 79959639648     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993886.1993900     Document Type: Conference Paper

References (23)

1. S. Cabay. Exact solution of linear systems. In Proc. Second Symp. on Symbolic and Algebraic Manipulation, pages 248-253, 1971.
2. Z. Chen. A BLAS based C library for exact linear algebra on integer matrices. Master's thesis, David R. Cheriton School of Computer Science, University of Waterloo, 2005.
3. Z. Chen and A. Storjohann. A BLAS based C library for exact linear algebra on integer matrices. In M. Kauers, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '05, pages 92-99. ACM Press, New York, 2005.
4. W. Cook and D. E. Steffy. Solving very sparse rational systems of equations. ACM Trans. Math. Softw., 37:39:1-39:21, February 2011.
5. J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numerische Mathematik, 40:137-141, 1982.
6. J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. LinBox: A generic library for exact linear algebra. In A. J. Cohen and N. Gao, X.-S. andl Takayama, editors, Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China, pages 40-50, Singapore, 2002. World Scientific.
7. M. J. Encarnación. Computing gcds of polynomials over algebraic number fields. J. Symb. Comput., 20:299-313, September 1995.
8. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2 edition, 2003.
9. P. Giorgi. Arithmetic and algorithmic in exact linear algebra for the LinBox library. PhD thesis, École normale supérieure de Lyon, LIP, Lyon, France, December 2004.
10. G. Hanrot. LLL: a tool for effective diophantine approximation. In Conference in honour of the 25th birthday of the LLL algorithm - LLL+25, Caen France, 2007.
11. E. Kaltofen and H. Rolletschek. Computing greatest common divisors and factorizations in quadratic number fields. Math. Comput., 53(188), 1989.
12. E. Kaltofen and Z. Yang. On exact and approximate interpolation of sparse rational functions. In J. P. May, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '07, pages 203-210. ACM Press, New York, 2007.
13. J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal of Computing, 14(1):196-209, 1985.
14. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
15. D. Lichtblau. Half-GCD and fast rational recovery. In M. Kauers, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '05, pages 231-236. ACM Press, New York, 2005. Extended version available at http://library.wolfram.com/infocenter/Conferences/7534/HGCD-and-planar-lattices. pdf.
16. M. Monagan. Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. In J. Gutierrez, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '04, pages 243-249. ACM Press, New York, 2004.
17. P. Q. Nguyen and D. Stehlé. An LLL algorithm with quadratic complexity. SIAM Journal on Computing, 39(3):874-903, 2009.
18. A. Novocin. Factoring Univariate Polynomials over the Rationals. PhD thesis, Florida State University, 2008.
19. A. Novocin, D. Stehlé, and G. Villard. An LLL-reduction algorithm with quasi-linear time complexity. STOC 2011: 43rd ACM Symposium on Theory of Computing, to appear.
20. Z. Olesh and A. Storjohann. The vector rational function reconstruction problem. In I. Kotsireas and E. Zima, editors, Proc. of the Waterloo Workshop on Computer Algebra: devoted to the 60th birthday of Sergei Abramov (WWCA-2006), pages 137-149. World Scientific, 2006.
21. V. Shoup. A Computational Introduction to Number Theory and Algebra. Cambridge University Press, 2 edition, 2005.
22. D. E. Steffy. Exact solutions to linear systems of equations using output sensitive lifting. SIGSAM Bull., 44:160-182, January 2011.
23. M. van Hoeij and A. Novocin. Gradual sub-lattice reduction and a new complexity for factoring polynomials. In A. López-Ortiz, editor, LATIN 2010: Theoretical Informatics, volume 6034 of Lecture Notes in Computer Science, pages 539-553. Springer Berlin / Heidelberg, 2010.