1997
DOI: 10.1016/s0377-0427(96)00156-2
|View full text |Cite
|
Sign up to set email alerts
|

A finite-difference method for the numerical solution of the Schrödinger equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0
3

Year Published

2012
2012
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 233 publications
(44 citation statements)
references
References 33 publications
0
41
0
3
Order By: Relevance
“…Theorem 1 [21] and [24] The symmetric 2m-step method with characteristic equation given by (6) has phase-lag order q and phase-lag constant c given by:…”
Section: Phase-lag Analysis Of Symmetric Multistep Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 1 [21] and [24] The symmetric 2m-step method with characteristic equation given by (6) has phase-lag order q and phase-lag constant c given by:…”
Section: Phase-lag Analysis Of Symmetric Multistep Methodsmentioning
confidence: 99%
“…-In [9][10][11][12][13][14] exponentially and trigonometrically fitted Runge-Kutta and Runge-Kutta Nyström methods are obtained. -Multistep phase-fitted methods and multistep methods with minimal phase-lag are developed in [18][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37]. -Symplectic integrators are studied in .…”
Section: Introductionmentioning
confidence: 99%
“…[4], [5] We call phase-lag of an algorithm (2) with the related characteristic equation (7) the dominant term of the expression…”
Section: Definition 5 If the Interval Of Periodicity Of An Algorithmmentioning
confidence: 99%
“…Theorem 1. [4] In order to compute the order of the phase-lag t and the constant of the phase-lag c for an algorithm (2) with the related equation (7), we use the direct formula:…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation