“…Combined with Theorem 1 and Theorem 2, we can give a lower matrix bound of the positive definite solution P of UALE (8). Theorem 3.…”
Section: Lemma 7 ([5]mentioning
confidence: 96%
“…Next, we prove that the matrix sequence {P k } generated by (22) converges to the positive definite solution of UALE (8).…”
Section: Fixed Point Algorithmmentioning
confidence: 97%
“…Theorem 7. Assume that the conditions given in the Theorem 6 are satisfied, the sequence {P k } generated by the iterative scheme (22) converges, and converges to the unique positive definite solution P + of UALE (8).…”
Section: Fixed Point Algorithmmentioning
confidence: 99%
“…Zhang et al in [7] extended the upper and lower bound of the solution of UALE on δ-domain. Besides, UALE can be transformed into a quasi-standard form of the DALE by using a bilinear transformation proposed in [8]. Thus, by extending this approach for CALE associated with linear algebraic techniques, Lee present several upper and lower matrix bounds of the solution of UALE in [9].…”
In this paper, applying some properties of matrix inequality and Schur complement, we give new upper and lower bounds of the solution for the unified algebraic Lyapunov equation that generalize the forms of discrete and continuous Lyapunov matrix equations. We show that its positive definite solution exists and is unique under certain conditions. Meanwhile, we present three numerical algorithms, including fixed point iterative method, the acceleration fixed point method and the alternating direction implicit method, to solve the unified algebraic Lyapunov equation. The convergence analysis of these algorithms is discussed. Finally, some numerical examples are presented to verify the feasibility of the derived upper and lower bounds, and numerical algorithms.
“…Combined with Theorem 1 and Theorem 2, we can give a lower matrix bound of the positive definite solution P of UALE (8). Theorem 3.…”
Section: Lemma 7 ([5]mentioning
confidence: 96%
“…Next, we prove that the matrix sequence {P k } generated by (22) converges to the positive definite solution of UALE (8).…”
Section: Fixed Point Algorithmmentioning
confidence: 97%
“…Theorem 7. Assume that the conditions given in the Theorem 6 are satisfied, the sequence {P k } generated by the iterative scheme (22) converges, and converges to the unique positive definite solution P + of UALE (8).…”
Section: Fixed Point Algorithmmentioning
confidence: 99%
“…Zhang et al in [7] extended the upper and lower bound of the solution of UALE on δ-domain. Besides, UALE can be transformed into a quasi-standard form of the DALE by using a bilinear transformation proposed in [8]. Thus, by extending this approach for CALE associated with linear algebraic techniques, Lee present several upper and lower matrix bounds of the solution of UALE in [9].…”
In this paper, applying some properties of matrix inequality and Schur complement, we give new upper and lower bounds of the solution for the unified algebraic Lyapunov equation that generalize the forms of discrete and continuous Lyapunov matrix equations. We show that its positive definite solution exists and is unique under certain conditions. Meanwhile, we present three numerical algorithms, including fixed point iterative method, the acceleration fixed point method and the alternating direction implicit method, to solve the unified algebraic Lyapunov equation. The convergence analysis of these algorithms is discussed. Finally, some numerical examples are presented to verify the feasibility of the derived upper and lower bounds, and numerical algorithms.
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.