Discrete transparent boundary conditions for the Schrödinger equation: fast calculation, approximation, and stability

Anton Arnold, Matthias Ehrhardt, Ivan Sofronov

Communications in Mathematical Sciences · 2003 · 183 citations · 30 references

DOIFull text

Open access

Concepts

Abstract

We propose a way to efficiently treat the well-known transparent boundary conditions for the Schrdinger equation. Our approach is based on two ideas: to write out a discrete transparent boundary condition (DTBC) using the Crank-Nicolson finite difference scheme for the governing equation, and to approximate the discrete convolution kernel of DTBC by sum-of-exponentials for a rapid recursive calculation of the convolution.

References

30