Loading [a11y]/accessibility-menu.js
Fast Hybrid Computer Implementation of the Dynostat Algorithm | IEEE Journals & Magazine | IEEE Xplore

Fast Hybrid Computer Implementation of the Dynostat Algorithm


Abstract:

In optimal resource allocation problems the Dynostat algorithm separates the overall optimization task into less complicated optimum seeking techniques working in paralle...Show More

Abstract:

In optimal resource allocation problems the Dynostat algorithm separates the overall optimization task into less complicated optimum seeking techniques working in parallel. A hybrid computer implementation is shown to provide a much faster optimizer than was previously the case using a digital computer. Solution accuracies are considered adequate for many practical applications. The improved formulation presented of gradient search is advantageous for high-speed optimization. Confidence is increased in analog computer solutions by introducing auxiliary algorithms that check on solution feasibility and also improve accuracy.
Published in: IEEE Transactions on Computers ( Volume: C-21, Issue: 8, August 1972)
Page(s): 872 - 880
Date of Publication: 29 May 2009

ISSN Information:


References

References is not available for this document.