2016
DOI: 10.1002/9781119121534
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Methods for Ordinary Differential Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
616
0
6

Year Published

2016
2016
2018
2018

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 1,088 publications
(626 citation statements)
references
References 0 publications
4
616
0
6
Order By: Relevance
“…[20], there are many numerical examples demonstrating that the k-step scheme admits k-order convergence rate in solving FBSDEs, where k ≤ 6. However, when k > 6 the scheme becomes unstable, as classical numerical ODE theory predicts [3]. Our main purpose here is to provide a theoretical justification for such high-order convergence.…”
Section: Multistep Numerical Schemesmentioning
confidence: 98%
“…[20], there are many numerical examples demonstrating that the k-step scheme admits k-order convergence rate in solving FBSDEs, where k ≤ 6. However, when k > 6 the scheme becomes unstable, as classical numerical ODE theory predicts [3]. Our main purpose here is to provide a theoretical justification for such high-order convergence.…”
Section: Multistep Numerical Schemesmentioning
confidence: 98%
“…Based on the topology snapshot interval η and the satellites initial positions V0, the position matrix Vt={Vt|t=t0+nη} in the next snapshot can be calculated by using the satellite dynamic model and the Runge-Kutta algorithm [36]. Then, by repeating Step 1, the strategy obtains the topologies of the satellite cluster at every time of snapshot, Gt={Gt|t=t0+nη}.…”
Section: Reliability Assurance Topology Control Strategymentioning
confidence: 99%
“…As the sampling period in this study (5 s) is short in relation to the speed of the system, Euler's implicit method [33] is …”
Section: A Discretization Of the Differential Equationsmentioning
confidence: 99%