CaltechAUTHORS
Published May 1989 | Version public
Journal Article Metadata-only

Hypercube implementations of parallel shooting

Creators

Abstract

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.

Additional Information

© 1989 Elsevier Inc. This research was partially supported by the U.S Department of Energy, under Contract No DE-AA03-76-SF00767. The work of Paul Nelson also was partially supported by a Faculty Development Leave from Texas Tech University, and by Contract No. DE-FG05-87ER25042 between Texas Tech and the Department of Energy.

Additional details

Identifiers

Eprint ID
79715
DOI
10.1016/0096-3003(89)90140-9
Resolver ID
CaltechAUTHORS:20170801-153045481

Funding

Department of Energy (DOE)
DE-AA03-76-SF00767
Texas Tech University
Department of Energy (DOE)
DE-FG05-87ER25042

Dates

Created
2017-08-01
Created from EPrint's datestamp field
Updated
2021-11-15
Created from EPrint's last_modified field