Schnelle Berechnung von Kettenbruchentwicklungen

  title={Schnelle Berechnung von Kettenbruchentwicklungen},
  author={Arnold Sch{\"o}nhage},
  journal={Acta Informatica},
SummaryA method, given by D. E. Knuth for the computation of the greatest common divisor of two integers u, v and of the continued fraction for u/v is modified in such a way that only O(n(lg n)2(lglg n)) elementary steps are used for u,v<.2n.ZusammenfassungEin von D. E. Knuth angegebenes Verfahren, für ganze Zahlen u, v den größten gemeinsamen Teiler und den Kettenbruch für u/v zu berechnen, wird so modifiziert, daß für n-stellige Zahlen nur O(n(lg n)2 (lglg n)) elementare Schritte gebraucht… 
Computational Schemes for Subresultant Chains
This paper discusses different practical schemes, and their implementation, for efficiently computing subresultants and extensive experimentation supports the findings.
On Schönhage's algorithm and subquadratic integer gcd computation
A new subquadratic left-to-right GCD algorithm, inspired by Schonhage's algorithm for reduction of binary quadratic forms, is described, which runs slightly faster than earlier algorithms, and is much simpler to implement.
The Frobenius number g(A) of a set A = (a1,a2,... ,an) of positive integers is the largest integer not representable as a nonnegative linear combination of the ai. We interpret the Frobenius number
Efficient computation of the Jacobi symbol Niels Möller 2019
This paper describes how to extend any left-to-right gcd algorithm to compute the Jacobi symbol, using a single table lookup per reduction, for both quadratic time gcd algorithms and subquadratic algorithms.
1 Fractured Lattices , Integer Programming , and Diophantine Approximation ? dedicated to Prof
  • G. Rote
  • Mathematics, Computer Science
Integer Programming is of course closely connected to integer lattices and the geometry of numbers. Especially the algorithms in small dimensions which have theoretical performance guarantees are
Two efficient algorithms for the computation of ideal sums in quadratic orders
  • A. Weilert
  • Mathematics, Computer Science
    Math. Comput.
  • 2006
It is shown that the calculation of an ideal sum in a fixed quadratic order can be done as fast as in Z up to a constant factor, i.e., in O(μ( n) logn), where n bounds the size of the operands and μ(n) denotes an upper bound for the multiplication time of n-bit integers.
An LLL-reduction algorithm with quasi-linear time complexity
A new framework for analyzing unimodular transformation matrices which reduce shifts of reduced bases, this includes bit-size control and new perturbation tools is established, which is illustrated by generating a family of reduction algorithms.
Analysis of Fast Versions of the Euclid Algorithm
A precise probabilistic analysis of fast variants of the gcd algorithm is provided, and it is proved that their average bit--complexity on random inputs of size n is Θ(n(log n)2 log log n), with a precise remainder term.