Abstract:By utilizing some linear algebraic techniques, new upper bounds of the solution of the continuous algebraic Riccati equation (CARE) are derived. According to the present bounds, iterative procedures are also developed for obtaining more precise estimations. Comparing with existing results, the obtained bounds are less restrictive.
“…This upper bound of eigenvalues is always solvable if there exists a unique, positive definite solution for CARE (1).…”
Section: The Upper Matrix Bounds Of Carementioning
confidence: 99%
“…Here, we will discuss the existence condition of the upper bounds in this paper and [1][2][3][4][5][6][7]. The existence condition of the previous upper matrix bounds in [4][5][6] is that BB T must be nonsingular.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…Although this assumption was improved in some literatures, it has some constraints. In [1,3,7], the upper bounds can be obtained with satisfying the condition (26). In [2], Q must be nonsingular.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…We provide some examples to illustrate related problem. Example 1 in the following illustrates that the upper bounds in [1][2][3][4][5][6][7] are conservative. For any system, the upper bounds (3) and (18) are solvable.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…where A ∈ R n×n is the state matrix, B ∈ R n×r is the input matrix, Q ∈ R n×n is a given positive (semi-) definite matrix, R ∈ R r×r is a given positive definite matrix, and V ∈ R n×n is the unique positive definite solution of CARE (1). The pair (A, B) and the pair (A, Q 1/2 ) are respectively assumed to be controllable and observable.…”
In this paper, for the solution of the continuous algebraic Riccati equation (CARE), we derived two new upper matrix bounds. Compared with the existing results, the newly obtained bounds are less conservative and more practical, which means that the condition for the existence of the upper bounds derived here is much weaker. The advantage of the results is shown by theoretical analysis and numerical examples. Moreover, in redundant optimal control, when we increase the columns of the input matrix, some sufficient conditions are presented to strictly decrease the largest singular value of the feedback matrix by utilizing these upper bounds. We also give some examples to illustrate the effectiveness of these sufficient conditions.
“…This upper bound of eigenvalues is always solvable if there exists a unique, positive definite solution for CARE (1).…”
Section: The Upper Matrix Bounds Of Carementioning
confidence: 99%
“…Here, we will discuss the existence condition of the upper bounds in this paper and [1][2][3][4][5][6][7]. The existence condition of the previous upper matrix bounds in [4][5][6] is that BB T must be nonsingular.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…Although this assumption was improved in some literatures, it has some constraints. In [1,3,7], the upper bounds can be obtained with satisfying the condition (26). In [2], Q must be nonsingular.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…We provide some examples to illustrate related problem. Example 1 in the following illustrates that the upper bounds in [1][2][3][4][5][6][7] are conservative. For any system, the upper bounds (3) and (18) are solvable.…”
Section: Theorem 2 If Condition (4) Is Satisfied Then Solutionmentioning
confidence: 99%
“…where A ∈ R n×n is the state matrix, B ∈ R n×r is the input matrix, Q ∈ R n×n is a given positive (semi-) definite matrix, R ∈ R r×r is a given positive definite matrix, and V ∈ R n×n is the unique positive definite solution of CARE (1). The pair (A, B) and the pair (A, Q 1/2 ) are respectively assumed to be controllable and observable.…”
In this paper, for the solution of the continuous algebraic Riccati equation (CARE), we derived two new upper matrix bounds. Compared with the existing results, the newly obtained bounds are less conservative and more practical, which means that the condition for the existence of the upper bounds derived here is much weaker. The advantage of the results is shown by theoretical analysis and numerical examples. Moreover, in redundant optimal control, when we increase the columns of the input matrix, some sufficient conditions are presented to strictly decrease the largest singular value of the feedback matrix by utilizing these upper bounds. We also give some examples to illustrate the effectiveness of these sufficient conditions.
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.