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

Embedded Runge–Kutta scheme for step-size control in the interaction picture method

Abstract: To cite this version:Stéphane Balac, Fabrice Mahé. Embedded Runge-Kutta scheme for step-size control in the interaction picture method. Computer Physics Communications, Elsevier, 2013, 184 (4) AbstractWhen solving certain evolution type PDE such as the Schrödinger equation, the Interaction Picture method is a valuable alternative to Split-Step methods. The Interaction Picture method has good computational features when used together with the standard 4th order Runge-Kutta scheme (giving rise to the RK4-IP met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 46 publications
(42 citation statements)
references
References 19 publications
0
42
0
Order By: Relevance
“…[32,27,21]. Recently an efficient embedded RK method based on Dormand and Prince RK4(3)-T formula [12] and specifically designed for the IP method has been proposed in [3]. The name "Interaction Picture" and the change of unknown at the heart of the method originate from quantum mechanics [30,17] where it is usual to chose an appropriate "picture" in which the physical properties of the studied system can be easily revealed and the calculation made simpler.…”
Section: Presentation Of the Numerical Approachmentioning
confidence: 99%
See 3 more Smart Citations
“…[32,27,21]. Recently an efficient embedded RK method based on Dormand and Prince RK4(3)-T formula [12] and specifically designed for the IP method has been proposed in [3]. The name "Interaction Picture" and the change of unknown at the heart of the method originate from quantum mechanics [30,17] where it is usual to chose an appropriate "picture" in which the physical properties of the studied system can be easily revealed and the calculation made simpler.…”
Section: Presentation Of the Numerical Approachmentioning
confidence: 99%
“…As well, any other value z in the set ]z k , z k+1 [ could have been chosen rather than the particular value z k+ 1 2 in the change of unknown (2.2); however the benefit of the cancellation of 4 exponential operator terms in (2.10) would have been lost. An embedded Runge-Kutta scheme for the IP method preserving these nice features has been proposed in [3].…”
Section: Computing the Exp(mentioning
confidence: 99%
See 2 more Smart Citations
“…Numerical methods involved finite-difference approach [19,21,22], bi-k-Lagrange elements [23], spectral collocation methods with Chebyshev polynomials of the first and second kind [24] as well as basis set expansion technique [25]. Time-dependent equations were solved with implicit and semi-implicit Crank-Nicolson methods [26,27,18,28,29], Euler scheme [22], third and fourth-order adaptive Runge-Kutta methods [30], splitstep finite difference method [22] and time-splitting sine and Fourier pseudospectral methods [31,32]. In the latter case, space was discretized with second-and fourth-order finite differences, exponential splines [29] or with Chebyshev-Tau spectral discretization method [26].…”
Section: Introductionmentioning
confidence: 99%