Hypercube implementations of parallel shooting

摘要

We consider parallel shooting for linear two-point boundary-value problems with separated boundary conditions. Two different strategies are considered for mapping associated tasks onto the nodes of a hypercube. One of these (the domain strategy) corresponds to a decomposition by subintervals of the independent variable, and the other (the column strategy) to decomposition by dependent variable. Under suitable assumptions the two strategies are compared in terms of estimated computational times. Estimated regions of efficiency, in terms of various parameters, are obtained for the two strategies.