Computational Ergodic Theory

  • Geon Ho Choe

Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 13)

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Pages 1-46
  3. Pages 47-84
  4. Pages 155-182
  5. Pages 237-268
  6. Pages 363-390
  7. Pages 391-416
  8. Pages 417-437
  9. Back Matter
    Pages 439-453

About this book


Ergodic theory is hard to study because it is based on measure theory, which is a technically difficult subject to master for ordinary students, especially for physics majors. Many of the examples are introduced from a different perspective than in other books and theoretical ideas can be gradually absorbed while doing computer experiments. Theoretically less prepared students can appreciate the deep theorems by doing various simulations. The computer experiments are simple but they have close ties with theoretical implications. Even the researchers in the field can benefit by checking their conjectures, which might have been regarded as unrealistic to be programmed easily, against numerical output using some of the ideas in the book. One last remark: The last chapter explains the relation between entropy and data compression, which belongs to information theory and not to ergodic theory. It will help students to gain an understanding of the digital technology that has shaped the modern information society.


Lyapunov exponent Maple simulations dynamical systems entropy ergodic theory linear optimization simulation

Authors and affiliations

  • Geon Ho Choe
    • 1
  1. 1.Department of MathematicsKorea Advanced Institute of Science and TechnologyDaejeonKOREA, REPUBLIC OF

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-540-23121-9
  • Online ISBN 978-3-540-27305-9
  • Series Print ISSN 1431-1550
  • Buy this book on publisher's site