For any linear multi-step scheme, Feng Kang defines the step-transition operator characterizing it and defines the symplectlcity of the method for Hamiltonian systems through the operator. In this paper, the author gets a valuable expression of the step-transitlon operator (Lemma 1, Section 2) and p
β¦ LIBER β¦
Multi-step methods are essentially one-step methods
β Scribed by Urs Kirchgraber
- Publisher
- Springer-Verlag
- Year
- 1986
- Tongue
- English
- Weight
- 233 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The symplecticity of multi-step methods
β
Yi-Fa Tang
π
Article
π
1993
π
Elsevier Science
π
English
β 303 KB
Invariant curves of one-step methods
β
timo Eirola
π
Article
π
1988
π
Springer Netherlands
π
English
β 462 KB
Convergence of multi-time step integrati
β
P. Smolinski
π
Article
π
1990
π
Elsevier Science
π
English
β 570 KB
A-stable block implicit one-step methods
β
H. A. Watts; L. F. Shampine
π
Article
π
1972
π
Springer Netherlands
π
English
β 923 KB
One-step methods for ordinary differenti
β
D. P. Squier
π
Article
π
1969
π
Springer-Verlag
π
English
β 176 KB
Mean-square convergence of stochastic mu
β
Thorsten Sickenberger
π
Article
π
2008
π
Elsevier Science
π
English
β 267 KB
We study mean-square consistency, stability in the mean-square sense and mean-square convergence of drift-implicit linear multistep methods with variable step-size for the approximation of the solution of ItΓ΄ stochastic differential equations. We obtain conditions that depend on the step-size ratios