Abstract
A new approach is developed for the solution of linear interconnected dynamical systems. The algorithm is within the class of non-feasible methods. Its main feature is that it allows the transfer of information between the subsystems with each iteration. The convergence properties of this technique are given in detail. It is shown that the proposed methodology may be faster than the well-known prediction algorithm given in the literature since in each iteration better interconnection information is used within the period of the optimization horizon.
Sign-in/Register to access full text options 
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.
