Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseОткрытый API экосистемы
Статья

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

Anton ArnoldInstitut fr Numerische Mathematik, Universitt Mnster, Einsteinstr. 62, D-48149 Mnster, GermanyMatthias EhrhardtInstitut fr Mathematik, Technische Universitt Berlin, Str. des 17. Juni 136, D-10623 Berlin, GermanyIvan SofronovKeldysh Institute of Applied Mathematics, Russian Academy of Sciences, Miusskaya sq. 4, Moscow, Russia
2003en
ABI

Аннотация

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.

Перевод пока недоступен

Идентификаторы

Цитирования и источники

Цитирований: 8Использованных источников: 0