Acceleration of Euclidean algorithm and extensions

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

Volumn , Issue , 2002, Pages 207-213

  Pan, Victor Y ^a   Wang, Xinmao ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Bit operation complexity; Extended Euclidean algorithm; Linear system of equations; P adic lifting; Randomized algorithms; Rational number reconstruction; Smith invariant factors; Toeplitz and Hankel matrices

Indexed keywords

ACCELERATION; INTEGER PROGRAMMING; LINEAR EQUATIONS; OPTIMAL SYSTEMS;

EUCLIDEAN ALGORITHM; HENSELS LIFTING; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0036050382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780533     Document Type: Conference Paper

References (22)

1. Fast deterministic computations of the determinants of dense matrices
2. Fast solution of Toeplitz systems of equations and computation of Padé approximations
3. GCD of many integers
4. On fast multiplication of polynomials over arbitrary rings
5. Exact solution of linear equations using p-adic expansions
6. On computing the determinant and Smith form of an integer matrix
7. Processor efficient parallel solution of linear systems over an abstract field
8. Fast computation of GCDs
9. Approximate algorithms to derive exact solutions to systems of linear equations
10. Certified dense linear system solving
11. Complexity of parallel matrix computations
12. Computing the determinant and the characteristic polynomials of a matrix via solving linear system of equations
13. Parametrization of Newton's iteration for computations with structured matrices and applications
14. Parallel complexity of computations with general and Toeplitz-like matrices filled with integers and extensions
15. Randomized acceleration of fundamental matrix computations
16. Can we optimize computations with structured matrices?
17. Schnelle Berechnung von Kettenbruchentwicklungen
18. Schnelle Multiplikation grosse Zahlen