Abstract
AbstractNew lower matrix bounds are derived for the solution of the continuous algebraic Lyapunov equation (CALE). Following each bound derivation, an iterative algorithm is proposed to derive tighter matrix bounds. In comparison to existing results, the presented results are more concise and are always valid when the CALE has a non‐negative definite solution. We finally give numerical examples to show the effectiveness of the derived bounds and make comparisons with existing results. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society
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.
