Acceleration of Euclidean algorithm and rational number reconstruction

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 548-556

  Wang, Xinmao ^a   Pan, Victor Y ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Extended Euclidean algorithm; Rational number reconstruction

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; LINEAR SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

EUCLIDEAN ALGORITHM; RATIONAL NUMBER RECONSTRUCTION;

NUMBER THEORY;

EID: 0038623314     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702408636     Document Type: Article

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. R. P. Brent, F. G. Gustavson, and D. Y. Y. Yun, Fast solution of Toeplitz systems of equations and computation of Padé approximations, J. Algorithms, 1 (1980), pp. 259-295.
3. G. Lejeune Dirichlet, Verallgemeinerung eines Satzes aus der Lehre von den Kettenbrüchen nebst einigen Anwendungen auf die Theorie der Zahlen, in Bericht über die zur Bekanntmachung geeigneten Verhandlungen der Königlich Preussischen Akademie der Wissenschaften zu Berlin, 1842, pp. 93-95 (reprinted in G. Lejeune Dirichlet's Werke, Vol. I, L. Kronecher, ed., G. Reimer, Berlin, 1889, pp. 635-638 (reprinted: Chelsea, New York, 1969)).
4. J. D. Dixon, Exact solution of linear equations using p-adic expansions, Numer. Math., 40 (1982), pp. 137-141.
5. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, Cambridge, UK, 1990.
6. L. K. Hua, Introduction to Number Theory, Springer-Verlag, Berlin, 1982.
7. A. Hurwitz, Ueber die angenäherte Darstellung der Irrationalzahlen durch rationale Brüche, Math. Ann., 39 (1891), pp. 279-284. (reprinted in Mathematische Werke von Adolf Hurwitz, Zweitzer Band, Birkhäuser, Basel, 1963, pp. 122-128).
8. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 4th ed., Clarendon Press, Oxford, UK, 1960.
9. A. M. Legendre, Essai sur la théorie des nombres, J. B. M. Duprat, Paris, 1798 (4th edition reprinted: Théorie des nombres, A. Blanchard, Paris, 1979).
10. R. Moenck, Fast computation of GCDs, in Proceedings of 5th ACM Annual Symposium on Theory of Computing, ACM, New York, 1973, pp. 142-171.
11. R. T. Moenck and J. H. Carter, Approximate algorithms to derive exact solutions to systems of linear equations, in Proceedings of EUROSAM, Lecture Notes in Comput. Sci. 72, Springer-Verlag, Berlin, 1979, pp. 63-73.
12. V. Y. Pan, Can we optimize Toeplitz/Hankel computations?, in Proceedings of the Fifth International Workshop on Computer Algebra in Scientific Computing (CASC 2002, Yalta, Ukraine), V. G. Ganzha, E. W. Mayr, and E. V. Vorozhzov, eds., Institut fuer Informatik, Technische Universitate Muenchen, Garching, Germany, 2002, pp. 253-264.
13. V. Y. Pan and X. Wang, Acceleration of Euclidean algorithm and extensions, in Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, T. Mora, ed., ACM, New York, 2002, pp. 207-213.
14. A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Inform., 1 (1971), pp. 139-144.
15. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
16. A. Schönhage and V. Strassen, Schnelle Multiplikation grosse Zahlen, Computing, 7 (1971), pp. 281-292.
17. S. Ursic and C. Patarra, Exact solution of systems of linear equations with iterative methods, SIAM J. Algebraic Discrete Methods, 4 (1983), pp. 111-115.
18. R. E. Zippel, Effective Polynomial Computation, Kluwer Academic Publishers, Norwell, MA, 1993.