Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646261 | Applied Numerical Mathematics | 2008 | 14 Pages |
Abstract
Transparent boundary conditions (TBCs) are an important tool for the truncation of the computational domain in order to compute solutions on an unbounded domain. In this work we want to show how the standard assumption of ‘compactly supported data’ could be relaxed and derive TBCs for a generalized Schrödinger equation directly for the numerical scheme on the discrete level. With this inhomogeneous TBCs it is not necessary that the initial data lies completely inside the computational region. However, an increased computational effort must be accepted.
Related Topics
Physical Sciences and Engineering
Mathematics
Computational Mathematics