University of Cambridge > Talks.cam > Applied and Computational Analysis > Computing the Schrödinger equation with no fear of commutators

Computing the Schrödinger equation with no fear of commutators

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

  • UserArieh Iserles (DAMTP, University of Cambridge)
  • ClockThursday 11 October 2012, 15:00-16:00
  • HouseMR 14, CMS.

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

In this talk I report recent work on the solution of the linear Schrödinger equation (LSE) by exponential splitting in a manner that separates different frequency scales. The main problem in discretizing LSE is the presence of a very small parameter, which generates exceedingly rapid oscillation in the solution. However, it is possible to exploit the features of the graded free Lie algebra spanned by the Laplacian and by multiplication with the interaction potential to split the evolution operator in a symmetric Zassenhaus splitting so that the arguments of consecutive exponentials constitute an asymptotic expansion in the small parameter. Once we replace the Laplacian by an appropriate differentiation matrix, this results in a high-order algorithm whose computational cost scales like O(N log N), where N is the number of degrees of freedom and whose error is uniform in the small parameter.

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-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity