Dynamic Programming for the Partitioning of Numerical Simulations with Hybrid Computer Applications

The principle of dynamic programming is used to develop a digital computer software package for determining for each of several subsystems the optimal numerical integration algorithm from among given candidate techniques. As by-products, the corresponding optimal step sizes and error contributions of the subsystems are provided to the user. The developed program minimizes subsystem sum-squared errors subject to the constraint that the total time available for executing all subsystem integrations is specified in advance. After the basic concept of dynamic programming has been reviewed briefly, the details of the computer software package are presented. Numerical results are given for two examples, including a limited hybrid partitioning problem for a six-degree-of-freedom air-defense missile simulation. Finally, general considerations for hybrid partitioning are discussed, and extensions to the developed program are suggested.