Fast rational function reconstruction

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

Volumn 2006, Issue , 2006, Pages 184-190

  Khodadad, Sara ^a   Monagan, Michael ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Fast Euclidean Algorithm; Modular Algorithms; Rational Reconstruction

Indexed keywords

COMPUTATIONAL METHODS; LINEAR ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

FAST EUCLIDEAN ALGORITHMS; FUNCTION RECONSTRUCTION; MODULAR ALGORITHMS; RATIONAL RECONSTRUCTION;

FUNCTION EVALUATION;

EID: 33748963572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145801     Document Type: Conference Paper

References (16)

1. Richard P. Brent, Fred G. Gustavson, and David Y. Y. Yun. Fast solution of Toeplitz systems of equations and computation of Padé approximants. Journal of Algorithms, 1:259-295, 1980.
2. G. E. Collins and M. J. Encarnacion. Efficient Rational Number Reconstruction. J. Symbolic Computation, 20:287-297, 1995.
3. Mark J. Encarnacion. Computing GCDs of Polynomials over Algebraic Number Fields. J. Symbolic Computation, 20(3):299-313, 1995.
4. Joachim von zur Gathen and Jürgen Gerhard. Modern Computer Algebra. Cambridge University Press, second edition, 2003.
5. Sara Khodadad. Fast Rational Function Reconstruction. Master's thesis, Simon Fraser University (SFU), Burnaby, BC, Canada, 2005.
6. L. Langemyr and S. McCallum. The computation of polynomial gcd's over an algebraic number field. J. Symbolic Computation, 8:429-448, 1989.
7. Daniel Lichtblau. Half-gcd and Fast Rational Recovery. In Proceedings of ISSAC '05, pages 231-236. ACM Press: New York, NY, 2005.
8. Keju Ma and Joachim von zur Gathen. Analysis of Euclidean Algorithms for Polynomials over Finite Fields. J. Symbolic Computation, 9:429-455, 1990.
9. Roman Maeder. Storage Allocation for the Karatsuba Integer Multipliation Algorithm. In DISCO '93: Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, pages 59-65. Springer-Verlag, 1993.
10. R. T. Moenck. Fast computation of gcds. In STOC '73: Proceedings of the fifth annual ACM Symposium on Theory of Computing, pages 142-151. ACM Press: New York, NY, 1973.
11. Michael Monagan. Maximal quotient rational reconstruction: An almost optimal algorithm for rational reconstruction. Proceedings of ISSAC '04, pages 243-249. ACM Press: New York, NY, 2004.
12. Peter Lawrence Montgomery. An FFT extension of the elliptic curve method of factorization. PhD thesis, Los Angeles, CA, USA, 1992.
13. Victor Y. Pan and Xinmao Wang. Acceleration of Euclidean Algorithm and Extensions. Proceedings of ISSAC '02, pages 207-213. ACM Press: New York, NY, 2002.
14. A. Schönhage. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica, 1:139-144, 1971.
15. Allan Steel. Private communication.
16. Paul S. Wang. A p-adic Algorithm for Univariate Partial Fractions. In Proceedings of the fourth ACM Symposium on Symbolic and Algebraic Computation, pages 212-217. ACM Press: New York, NY, 1981.