2020
DOI: 10.1007/s10915-020-01235-8
|View full text |Cite
|
Sign up to set email alerts
|

Deferred Correction Methods for Ordinary Differential Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 67 publications
0
8
0
Order By: Relevance
“…Suppose that the integrator used to construct the provisional solution has order p 0 , the integrator used to compute the correction approximation at level k has order p k , and m correction steps are taken. If we have p groups of N uniformly distributed nodes, then the SDC methods can attain order [26,27] O(h min(P m ,p+1) ),…”
Section: Order Of Convergencementioning
confidence: 99%
“…Suppose that the integrator used to construct the provisional solution has order p 0 , the integrator used to compute the correction approximation at level k has order p k , and m correction steps are taken. If we have p groups of N uniformly distributed nodes, then the SDC methods can attain order [26,27] O(h min(P m ,p+1) ),…”
Section: Order Of Convergencementioning
confidence: 99%
“…Finally, we use the Arenstorf orbit problem [27,36] for further illustration of the proposed method's capabilities. The Arenstorf orbit problem describes a three body problem, where the movement of a light object is influenced by two heavy objects.…”
Section: Arenstorf Orbitmentioning
confidence: 99%
“…The solution is a closed orbit with a period of 17.065216560159. Similar to [36], we choose 10 5 equidistant timesteps to simulate one period of the problem. We choose the HBPC*(8, k max ) method with Alg.…”
Section: Arenstorf Orbitmentioning
confidence: 99%
See 1 more Smart Citation
“…On other hand, the deferred correction method, proposed originally by Fox [32], is a well-established method for designing high-order approximations to the solution of the partial differential equations based on simple lower-order numerical methods by a process of iterated corrections (see [33] for a survey). Further, Skeel [34] has obtained computational estimates of the local discretization error by the deferred correction method without the necessity of demonstrating the existence of asymptotic expansions of the global error.…”
mentioning
confidence: 99%