2005
DOI: 10.1016/j.cpc.2004.11.002
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of some special optimized fourth-order Runge–Kutta methods for the numerical solution of the Schrödinger equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0
1

Year Published

2009
2009
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 78 publications
(4 citation statements)
references
References 30 publications
(52 reference statements)
0
3
0
1
Order By: Relevance
“…In this work, we consider modified TSH methods with frequency dependent coefficients so that the harmonic oscillator y=w2y is integrated exactly. This approach has been used for Numerov‐type methods and was introduced by Simos in the framework of Runge–Kutta methods , and also applied to the construction of Runge–Kutta‐Nystrom methods . In Section 2, we give a short survey of TSH methods.…”
Section: Introductionmentioning
confidence: 99%
“…In this work, we consider modified TSH methods with frequency dependent coefficients so that the harmonic oscillator y=w2y is integrated exactly. This approach has been used for Numerov‐type methods and was introduced by Simos in the framework of Runge–Kutta methods , and also applied to the construction of Runge–Kutta‐Nystrom methods . In Section 2, we give a short survey of TSH methods.…”
Section: Introductionmentioning
confidence: 99%
“…Some numerical methodologies have been used to solve differential equations of mathematical physics including 1/ N expansion,1, 2 finite element,3, 4 homotopy analysis,5, 6 multipole,7 Runge–Kutta techniques,8, 9 and so forth. Although these techniques are completely reliable, they have their own complexity and cumbersomeness.…”
Section: Introductionmentioning
confidence: 99%
“…is the most commonly used general purpose time stepping algorithm given that it combines ease of implementation, su cient stability, good computational cost, a good order of convergence, and usually performs su ciently well on a very large class of problems [44,45,46]. However, before choosing a time propagation scheme we must consider two important aspects of the behaviour of the Once the simulation diverges we must scrap it completely and restart it with an altered time step.…”
Section: Algorithmmentioning
confidence: 99%