The numerical approximation of the Schrödinger equation with concentrated potential

08/04/2019 ∙ by Lehel Banjai, et al. ∙ 0

We present a family of algorithms for the numerical approximation of the Schrödinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms. These algorithms are special implementations of Lubich's Convolution Quadrature which allow, for certain applications in particular parabolic problems, to significantly reduce the computational cost and memory requirements. Recently it has been noticed that their use can be extended to some hyperbolic problems. Here we propose a new family of such efficient algorithms tailored to the features of the Green's function for Schrödinger equations. In this way, we are able to keep the computational cost and the storage significantly below more straightforward approaches. These features allow us to perform reliable numerical simulations for longer times even in cases when the solution becomes highly oscillatory or seems to develop finite time blow-up. We illustrate our new algorithm with several numerical experiments.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.