Abstract
Iterative techniques for function optimization have been considered extensivezy for use in all-digital computation. Relatively little has been done to take advantage of the much higher integration speed of hybrid computation systems. This paper demonstrates application of one simple procedure in a hybrid envi ronment and compares the results to those obtained by an efficient digital procedure. Even though a much more efficient procedure was used on the digital, time-saving factors between 8 and 2 were obtained via the simpler hybrid implementation. Since the dollar cost of the hybrid is much less than that of the digital, the hybrid has a large advantage per solution.
Get full access to this article
View all access options for this article.
