University of Cambridge > Talks.cam > Applied and Computational Analysis > Successes and prospects of geometric numerical integration

Successes and prospects of geometric numerical integration

Add to your list(s) Download to your calendar using vCal

  • UserRobert McLachlan, Massey University, New Zealand
  • ClockThursday 03 October 2013, 15:00-16:00
  • HouseMR 5, CMS.

If you have a question about this talk, please contact ai10.

An LMS-NZMS Aitken Lecture

Geometric numerical integration emerged in the 1990s. Its roots lie in successful and widely used algorithms of computational physics, especially the symplectic leapfrog method, and in the numerical analysis of classical families of numerical integrators such as Runge- Kutta. Combining these two strands has led to better algorithms for physical simulations and also to a better understanding of the process of numerical integration. Today the behaviour of integration algorithms is studied with respect to a range of geometric properties, including preservation of invariant (symplectic and volume) forms and invariant sets, including those that emerge in an asymptotic limit.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity