On continued fraction algorithms Smeets, I.

On continued fraction algorithms

Smeets, I.

Citation

Smeets, I. (2010, June 16). On continued fraction algorithms. Retrieved from https://hdl.handle.net/1887/15693

Version: Not Applicable (or Unknown)

License: Leiden University Non-exclusive license Downloaded

from: https://hdl.handle.net/1887/15693

Note: To cite this publication please use the final published version (if applicable).

10 mm

5 mm5 mm

ON CONTINUED FRACTION ALGORITHMS IONICA SMEETS

UITNODIGING

voor het bijwonen van de openbare verdediging van het proefschrift

ON CONTINUED FRACTION

ALGORITHMS

van IONICA SMEETS

Op woensdag 16 juni 2010 om 15.00 uur in het Groot Auditorium van het Academiegebouw van de Universiteit Leiden, Rapenburg 73 te Leiden Na afl oop is er een receptie

Met tijdrovende parkeermoeilijkheden dient rekening gehouden te worden

Ionica Smeets

ionica.smeets@gmail.com 06-46018309

paranimfen:

Reijer Idema r.idema@tudelft.nl Han Keijzers

han.keijzers@gmail.com

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 fi nd multi-dimensional continued fractions with a guaranteed quality in polynomial time?

These, and many more, questions are answered in this thesis.

ON CONTINUED FRACTION ALGORITHMS IONICA SMEETS

ON C ON TI N U ED FR AC TI ON A LG OR IT H M S

IO N IC A S M E E TS