Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
