Opening book details…
Can I read Quasi-GCD computations on EtoBox?
Quasi-GCD computations by Arnold Schönhage is a Mathematics article available to read on EtoBox.
What is Quasi-GCD computations about?
For univariate polynomials with real or complex coefficients and a given error bound l > 0, h is called a quasi-gcd off and g, if h is an e-approximate divisor of f and of g and if any (exact) common divisor off, g is an approximate divisor of h. Extended quasi-gcd computation means to find such h and additional cofactors u, u such that ) uf + ug -h 1 < l / h 1 holds. Suitable "pivoting" leads to a numerically stable version of Euclid's algorithm for solving this task. Further refinements by a divide-and-conquer technique and by means of fast algorithms for polynomial arithmetic then yield the worst case upper bound 0 (n2 lg n (lg( 1 /E) + n lg n)) of "pointer time" for &-degree polynomials. In the particular case of integer polynomials, however, an immediate reduction to fast integer gcd computation is recommended, instead. 0 1985 Academic PICSS, Inc.
Who reads Quasi-GCD computations?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- Arnold Schönhage
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0885-064X)
- Published
- 1985
- Language
- EN
- Field
- Mathematics (Physical Sciences)