1997
DOI: 10.1006/jcph.1997.5675
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Transparent Boundary Conditions for Schrödinger-Type Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
51
0

Year Published

1998
1998
2013
2013

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 65 publications
(51 citation statements)
references
References 12 publications
0
51
0
Order By: Relevance
“…For this, rational interpolatory functions approximating the symbol of the TBC in Fourier variables are used. With these ABC, and if we know a priori the velocity of the solution, it is possible to obtain a very high absorption, comparable to that obtained with TBC [20].…”
Section: Introductionmentioning
confidence: 61%
See 1 more Smart Citation
“…For this, rational interpolatory functions approximating the symbol of the TBC in Fourier variables are used. With these ABC, and if we know a priori the velocity of the solution, it is possible to obtain a very high absorption, comparable to that obtained with TBC [20].…”
Section: Introductionmentioning
confidence: 61%
“…For its numerical approximation, it is necessary to use artificial boundary conditions in order to work in a finite domain [x l , x r ] × R + . When, for x / ∈ (x l , x r ), the initial value u 0 (x) vanishes and the potential V is constant, transparent boundary conditions (TBC) for (1.1) have been studied in [5], [6], [14], [20]. With these TBC, the solution in the computational subdomain coincides with the original solution.…”
Section: Introductionmentioning
confidence: 99%
“…The importance of the stability problem is well-known for mesh methods with the approximate TBCs of solving time-dependent Schrödinger-like equations in unbounded domains see [1]- [6], [8,9,12], [15]- [17], [19]- [21]. In Part I of this study (see [10]), a new form of the approximate TBCs has been suggested, with a non-local operator S governing properties of the schemes.…”
Section: Introductionmentioning
confidence: 99%
“…There are many papers [1,2,3,4,5,6,7,8] developing TBCs and studying their difference approximations and stability. However, the obtained TBC through this way is nonlocal in t, thus requiring all the history data in memory.…”
Section: Introductionmentioning
confidence: 99%