Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

On optimal shooting intervals


Authors: R. M. M. Mattheij and G. W. M. Staarink
Journal: Math. Comp. 42 (1984), 25-40
MSC: Primary 65L10
DOI: https://doi.org/10.1090/S0025-5718-1984-0725983-0
MathSciNet review: 725983
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We develop an adaptive multiple shooting strategy, which is nearly optimal with respect to cpu time. Since the costs of integration are the most important components in this, we investigate in some detail how the gridpoints are chosen by an adaptive integration routine. We use this information to find out where the shooting points have to be selected. We also show that our final strategy is stable in the sense that rounding errors can be kept below a given tolerance. Finally we pay attention to the question how the need for memory can be minimized.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65L10

Retrieve articles in all journals with MSC: 65L10


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1984-0725983-0
Keywords: Multiple shooting, adaptive codes
Article copyright: © Copyright 1984 American Mathematical Society

American Mathematical Society