Page 1 Next

Displaying 1 – 20 of 54

Showing per page

Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems

Brigitte Vallée (2000)

Journal de théorie des nombres de Bordeaux

We obtain new results regarding the precise average-case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory and provide...

Ergodic averages with deterministic weights

Fabien Durand, Dominique Schneider (2002)

Annales de l’institut Fourier

We study the convergence of the ergodic averages 1 N k = 0 N - 1 θ ( k ) f T u k where ( θ ( k ) ) k is a bounded sequence and ( u k ) k a strictly increasing sequence of integers such that Sup α | k = 0 N - 1 θ ( k ) exp ( 2 i π α u k ) | = O ( N δ ) for some δ < 1 . Moreover we give explicit such sequences θ and u and we investigate in particular the case where θ is a q -multiplicative sequence.

Currently displaying 1 – 20 of 54

Page 1 Next