In this note, we present upper matrix bounds for the solution of the discrete algebraic Riccati equation (DARE). Using the matrix bound of Theorem 2.2, we then give several eigenvalue upper bounds for the solution of the DARE and make comparisons with existing results. The advantage of our results over existing upper bounds is that the new upper bounds of Theorem 2.2 and Corollary 2.1 are always calculated if the stabilizing solution of the DARE exists, whilst all existing upper matrix bounds might not be calculated because they have been derived under stronger conditions. Finally, we give numerical examples to demonstrate the effectiveness of the derived results.
New 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.