On continued fraction algorithms
Promotor: Robert Tijdeman, Co-promotor: Cornelis Kraaikamp
- Ionica Smeets
- 16 June 2010
- Thesis in Leiden Repository
Is there a good continued fraction approximation between every two bad ones? What is the entropy of the natural extension for alpha-Rosen fractions? How do you find multi-dimensional continued fractions with a guaranteed quality in polynomial time? These, and many more, questions are answered in this thesis.