Abstract
This paper addresses the issue of absolute stability in switched Lurie systems, where each subsystem is individually unstable. By introducing the discretized time-varying Lyapunov function method, sufficient conditions are presented that ensure all system solutions converge to zero. Furthermore, algorithms based on the binary search method are proposed to determine the upper and lower bounds of admissible dwell time, which reveal a larger stable region compared to the existing ones. Finally, two numerical examples illustrate the validity of our results.
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.
