In this review article we discuss different techniques to solve numerically the time-dependent Schrödinger equation on unbounded domains. We present and compare several approaches to implement the classical transparent boundary condition into finite difference and finite element discretizations. We present in detail the approaches of the authors and describe briefly alternative ideas pointing out the relations between these works. We conclude with several numerical examples from different application areas to compare the presented techniques. We mainly focus on the one-dimensional problem but also touch upon the situation in two space dimensions and the cubic nonlinear case.
| [1] | Software |
|
There is a Matlab GUI written for numerical experiments; currently
it covers the following implementations of TBCs/ABCs:
(Antoine - Besse,
Arnold - Ehrhardt,
Baskakov-Popov,
Di Menza,
Fast convolution,
Fevens-Jiang,
Kuska,
Pade,
PML,
PML-FEM,
Pole Condition,
Shibata,
Szeftel) Click here for a Screenshot of the Software (Version 3) (jpg-format) |
ehrhardt@math.uni-wuppertal.de
