2000
DOI: 10.1103/physreve.61.920
|View full text |Cite
|
Sign up to set email alerts
|

Complex absorbing potential and Chebyshev propagation scheme

Abstract: This work presents a detailed analysis of complex absorbing potentials employed to eliminate reflection or wrap-around of wave packets at numerical grid boundaries. In particular, a limiting value for the maximum propagation time step is derived, beyond which the complex potential may introduce massive errors and the Chebyshev propagation scheme is found to fail.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…This could result in reflection of the wave packet back at the boundary of the numerical grid, causing interference which destroys the real dynamics (Manolopoulos 2002). Instead of enlarging the grid we solved the problem by employing a complex absorbing potential (Migdley andWang 2000, Muga et al 2004). As a consequence of using a formalism that is easy to implement we pay the price of having a non-Hermitian Hamiltonian operator and of losing some parts of the wave packet.…”
Section: Computational Proceduresmentioning
confidence: 99%
“…This could result in reflection of the wave packet back at the boundary of the numerical grid, causing interference which destroys the real dynamics (Manolopoulos 2002). Instead of enlarging the grid we solved the problem by employing a complex absorbing potential (Migdley andWang 2000, Muga et al 2004). As a consequence of using a formalism that is easy to implement we pay the price of having a non-Hermitian Hamiltonian operator and of losing some parts of the wave packet.…”
Section: Computational Proceduresmentioning
confidence: 99%
“…2. There have been many studies of a complex absorbing potential in the continuum limit based on various calculational schemes. [3][4][5][6][7][8][9][10][11][12] The approach followed in this paper requires the diagonalization of a complex symmetric Hamiltonian defined on a lattice, as will be described below.…”
Section: Introductionmentioning
confidence: 99%
“…Other popular techniques are based on polynomial expansions of exp(A). For example, the Chebyshev approximation method is based on the Chebyshev expansion of the matrix exponential about the point [λ min , λ max ] ∈ C, where λ min and λ max are the eigenvalues of A with the smallest and largest real values [19][20][21].…”
Section: Matrix Exponentiationmentioning
confidence: 99%