Abstract
Abstract Computing of first-order sensitivity information is crucial for many gradient-base optimization strategies where the algorithms employed plays a key role on determining the computational efficiency of an optimization process. This paper presents an algorithm which is able to determine the state derivatives in a fully recursive manner so to significantly reduce the cost of determining analytic first-order sensitivity information for large scale tree-type dynamic systems. Qualitative and quantitative validation on the operational requirement of the present method are made through analytical means and empirical studies.
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.
