On Optimal Shooting Intervals (Q3314889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3844957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Optimal Shooting Intervals |
scientific article; zbMATH DE number 3844957 |
Statements
1984
0 references
optimal shooting intervals
0 references
multiple shooting
0 references
mesh selection
0 references
adaptive mesh integrator
0 references
numerical examples
0 references
On Optimal Shooting Intervals (English)
0 references
0.8340058326721191
0 references
0.805435061454773
0 references
In this interesting and well written paper, the authors consider in detail the issue of the optimal positioning of shooting points in a multiple shooting algorithm, for first order linear boundary value problems. A good mix of theoretical insight and reasonable heuristic is used to derive strategies for optimizing the shooting points position, with respect to computing time and stability. The resulting criterium is that of ''equidistributing the shooting points.'' By this, it is meant that the shooting points should be chosen so that in each subinterval the number of mesh points used by the integrator is constant. A number of suggestions are made to improve the efficiency of (any) multiple shooting code. Among the most important we mention: a) Use the adaptive mesh integrator only once, when computing the particular solution, and then use the same mesh for computing the fundamental solution: b) Do condensation of several shooting intervals into one to diminish storage requirements, but still preserving stability. A number of numerical examples illustrate the main points of the paper.
0 references