This paper presents a new decomposition procedure that reduces the highspeed memory requirement and interpolations, associated with the dynamic programming algorithm. It shows that an nth-order system described by k coupled difference or differential equations can be treated as a kth-order system with respect to the high-speed memory requirement and interpolations in the dynamic programming procedure.
No takes yet. Share an insight, caveat, or question.
Peter J. Wong (1970) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: