1980
DOI: 10.1007/bf01396367
|View full text |Cite
|
Sign up to set email alerts
|

Deferred corrections using uncentered end formulas

Abstract: Summary.The trapezoidal rule with deferred corrections using uncentered end formulas is shown to converge. While the proof technique is more specialized than the standard asymptotic expansion approach, it has some advantages. In addition to providing a more complete theoretical justification for current implementations of deferred corrections with the trapezoidal rule, the approach given here will hopefully apply for several other discretization methods.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

1980
1980
1990
1990

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(16 citation statements)
references
References 21 publications
0
16
0
Order By: Relevance
“…They suggest how this might be proved but do not follow through because "Such a proof would be quite tedious." In this paper we sketch a proof of this fact, which we believe is less tedious than that of Christiansen and Russell (1979) due to the way in which we break down the proof into smaller sinpZy stated results.…”
Section: Error Estimation and Iterative Improvement For The Numericalmentioning
confidence: 86%
See 3 more Smart Citations
“…They suggest how this might be proved but do not follow through because "Such a proof would be quite tedious." In this paper we sketch a proof of this fact, which we believe is less tedious than that of Christiansen and Russell (1979) due to the way in which we break down the proof into smaller sinpZy stated results.…”
Section: Error Estimation and Iterative Improvement For The Numericalmentioning
confidence: 86%
“…(Lindberg; Van Rosendale, Skeel) 3. The Order of Accuracy for a Deferred Corrections Algorithm (Skeel) This work will constitute the future paper mentioned in Skeel (1980, section 4, second paragraph) in which we give an error analysis for a sequence of iterations for the algorithm considered by Christiansen and Russell (1979). This is intended to be a realistic example of the application of the theoretical framework for proving accuracy results, which because of its length was not included in .…”
Section: Multistep Methods For Ordinary Differential Equationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Of course the key theoretical problem is to show that can be used h y to approximate T 1 y to 0(h 2 ), and similarly for the higher-order T k , and On the other hand defect correction [3,9,12,13] …”
Section: Introductionmentioning
confidence: 99%