- Series
- CDSNS Colloquium
- Time
- Wednesday, June 17, 2020 - 9:00am for 1.5 hours (actually 80 minutes)
- Location
- Bluejeans: https://primetime.bluejeans.com/a2m/live-event/xsgxxwbh
- Speaker
- Caroline Wormell – University of Sydney – caroline.wormell@sydney.edu.au – http://www.maths.usyd.edu.au/u/caro/
- Organizer
- Alex Blumenthal
Full-branch uniformly expanding maps and their long-time statistical quantities are commonly used as simple models in the study of chaotic dynamics, as well as being of their own mathematical interest. A wide range of algorithms for computing these quantities exist, but they are typically unspecialised to the high-order differentiability of many maps of interest, and so have a weak tradeoff between computational effort and accuracy.
This talk will cover a rigorous method to calculate statistics of these maps by discretising transfer operators in a Chebyshev polynomial basis. This discretisation is highly efficient: I will show that, for analytic maps, numerical estimates obtained using this discretisation converge exponentially quickly in the order of the discretisation, for a polynomially growing computational cost. In particular, it is possible to produce (non-validated) estimates of most statistical properties accurate to 14 decimal places in a fraction of a second on a personal computer. Applications of the method to the study of intermittent dynamics and the chaotic hypothesis will be presented.