Computational Ergodic Theory (Algorithms and Computation in Mathematics #13) (Hardcover)

Computational Ergodic Theory (Algorithms and Computation in Mathematics #13) By Geon Ho Choe Cover Image

Computational Ergodic Theory (Algorithms and Computation in Mathematics #13) (Hardcover)


At Distributor - We Can Usually Get It in 3-8 Days!
NON-RETURNABLE - Arrival Times Vary, Often 1-2 Weeks

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.

Product Details ISBN: 9783540231219
ISBN-10: 3540231218
Publisher: Springer
Publication Date: February 11th, 2005
Pages: 453
Language: English
Series: Algorithms and Computation in Mathematics