• Views 588
• Citations 3
• ePub 18
• PDF 337
`Abstract and Applied AnalysisVolume 2013 (2013), Article ID 685753, 7 pageshttp://dx.doi.org/10.1155/2013/685753`
Research Article

## On the Iterative Method for the System of Nonlinear Matrix Equations

Faculty of Science and Arts, Qassim University, Buraydah 51431, P.O. Box 1162, Saudi Arabia

Received 15 November 2012; Accepted 20 February 2013

Copyright © 2013 Asmaa M. Al-Dubiban. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The positive definite solutions for the system of nonlinear matrix equations are considered, where are two positive integers and A, B are nonsingular complex matrices. Some sufficient conditions for the existence of positive definite solutions for the system are derived. Under some conditions, an iterative algorithm for computing the positive definite solutions for the system is proposed. Also, the estimation of the error is obtained. Finally, some numerical examples are given to show the efficiency of the proposed iterative algorithm.

#### 1. Introduction

Linear and nonlinear matrix equations have been widely used for solving many problems in several areas such as control theory, optimal control, optimization control, stability theory, communication system, dynamic programming, signal processing, and stochastic filtering and statistics, [13]. Many authors studied the existence of solutions for several classes of the matrix equations (see, e.g., [414]), in particular, Lyapunov matrix equation [15], Sylvester matrix equations [11, 14], algebraic Riccati equations [3], some special case of linear and nonlinear matrix equations [1621], and coupled matrix equations [2224].

In recent years, many types of algebraic Riccati equations have been the subject of great activity, the aim being to achieve a fast and reliable algorithm that generates numerical positive definite solutions.

In this paper, we will consider the system (Sys.) of nonlinear matrix equations that can be expressed in the form: where are two positive integers,   are unknown matrices,   is the identity matrix, and   are nonsingular matrices. All matrices are defined over the complex field. The system of nonlinear matrix equations with the form of (1) is a special case of the system of algebraic discrete-type Riccati equations of the form: where , [2, 3]. The efficient numerical solutions for some special case of the system (2) have been extensively studied by several authors [410, 2226]. For example, Mukaidani [22] proposed a new algorithm for solving cross-coupled sign-indefinite algebraic Riccati equations for weakly coupled large-scale systems, while in [4, 5] Al-Dubiban has studied special cases of Sys. (2) by obtained sufficient conditions for the existence of positive definite solutions for the systems and proposed iterative algorithms to calculate the solutions. In [10], Davies proposed upper bounds for the sum of the maximal eigenvalues of the solutions of the continuous and discrete coupled algebraic Riccati equations. In [25], Ivanov has studied a set of discrete-time coupled algebraic Riccati equations which arise in quadratic optimal control and proposed two iterations for computing a symmetric solution of this system.

In this paper, we derive the sufficient conditions of the existence of solutions for the Sys. (1). We introduce an iterative algorithm to obtain the positive definite solutions of Sys. (1). We discuss the convergence of this iterative algorithm. Finally, some numerical examples are given to illustrate the efficiency for suggested algorithm.

The following notations are used throughout the rest of the paper. The notation    means that is positive semidefinite (positive definite), denotes the complex conjugate transpose of , and is the identity matrix. Moreover,    is used as a different notation for   . We denote by the spectral radius of  ;   represent the eigenvalues of and , respectively. The norm used in this paper is the spectral norm of the matrix ; that is,   unless otherwise noted.

#### 2. Main Theorems

In this section, we will introduce an iterative algorithm which is applicable for computing the positive definite solutions of the Sys. (1). We start with some results which will be used throughout this paper.

Lemma 1 (see [27, 28]). If (or ), then (or ) for all , and (or ) for all .

Theorem 2 (see [29]). Let the matrices , and be positive definite matrices, such that the integral exists and then the matrix is the solution of the matrix equation:

The solution of Sys. (1) can be found by the following iterative algorithm.

Algorithm 3.

Theorem 4. If there exist numbers satisfying , and the following conditions hold:(i), (ii), then the sequences defined by Algorithm 3 converge to a positive definite solution of Sys. (1).

Proof. From Algorithm 3, we get Also, we have That is,  , similarly we get Also, we have That is,  .
Suppose that Now, we will prove that and .
By using the inequalities (12), we have Also, we have Similarly, we get Also, we have Therefore, the inequalities (12) are true for all .
Hence, the sequences are monotonically decreasing and bounded from below by the matrix . Consequently, the sequences converge to a positive definite limit which is a solution of Sys. (1).

Theorem 5. If there exist numbers satisfying , and the following conditions hold: (i), (ii), (iii), where , then Sys. (1) has a positive definite solution which satisfies

Proof. From Theorem 4, the two sequences defined by Algorithm 3 are convergent to a positive definite solution of Sys. (1). We compute the spectral norm of the matrices . For that, we have We denote We use the following equality: Since for each , then by using Lemma 1 we have the matrix being a positive definite solution of the matrix equation: According to Theorem 2, we have Since are positive definite matrices, then the integral (22) exists, and By using (18) and (22), we have However, ; hence, Then, we have After times as above, we get Let be special case, then we have Since , then ; that is, Therefore, we get Also, we have We denote We use the following equality:
Since for each , then by using Lemma 1 we have the matrix being a positive definite solution of the matrix equation: According to Theorem 2, we have Since are positive definite matrices, then the integral (35) exists, and By using (31) and (35), we have However, ; hence, Then, we have After times as above, we get Let be special case, then we have
Since , then ; that is, Therefore, we get By using (43) in (30) and (30) in (43), we have which completes the proof.

#### 3. Numerical Examples

We will give some numerical examples for computing the positive definite solution of the Sys. (1). The solution is computed for some different matrices with different orders. Denote by the solutions which are obtained by Algorithm 3 and .

For computing for all , we use the iterative algorithm.

Algorithm 6.
See [30].

Example 7. Consider Sys. (1) with , and normal matrices By using Algorithms 3 and 6, we have
The results are given in Table 1.

Table 1: Error analysis for Example 7.

Example 8. Consider Sys. (1) with and normal matrices By using Algorithms 3 and 6, we have;
When ,
When ,
The results are given in Table 2.

Table 2: Error analysis for Example 8.

Example 9. Consider Sys. (1) with , and matrices By using Algorithms 3 and 6, we have
The results are given in Table 3.

Table 3: Error analysis for Example 9.

Example 10. Consider Sys. (1) with , and matrices By using Algorithms 3 and 6, we have
The results are given in Table 4.

Table 4: Error analysis for Example 10.

#### 4. Conclusion

In this paper, the positive definite solutions for Sys. (1) have been tackled. We presented sufficient conditions for the existence of positive definite solutions for Sys. (1). Moreover, we discussed an iterative algorithm from which solutions can always be calculated numerically whenever the system is solvable. Finally, we gave numerical examples that illustrated the behavior of the proposed algorithm.

#### References

1. W. N. Anderson Jr., T. D. Morley, and G. E. Trapp, “Positive solutions to $X=A-B{X}^{-1}{B}^{\ast }$,” Linear Algebra and Its Applications, vol. 134, pp. 53–62, 1990.
2. P. Lancaster and L. Rodman, Algebraic Riccati Equations, Oxford Science, Oxford, UK, 1995.
3. B. Meini, “Matrix equations and structures: efficient solution of special discrete algebraic Riccati equations,” in Proceedings of the WLSSCOO, 2000.
4. A. M. Aldubiban, Iterative algorithms for computing the positive definite solutions for nonlinear matrix equations [Ph.D. thesis], Riyadh University for Girls, Riyadh, Saudi Arabia, 2008.
5. A. M. Aldubiban, “Iterative algorithm for solving a system of nonlinear matrix equations,” Journal of Applied Mathematics, vol. 2012, Article ID 461407, 15 pages, 2012.
6. O. L. V. Costa and R. P. Marques, “Maximal and stabilizing Hermitian solutions for discrete-time coupled algebraic Riccati equations,” Mathematics of Control, Signals, and Systems, vol. 12, no. 2, pp. 167–195, 1999.
7. O. L. V. Costa and J. C. C. Aya, “Temporal difference methods for the maximal solution of discrete-time coupled algebraic Riccati equations,” Journal of Optimization Theory and Applications, vol. 109, no. 2, pp. 289–309, 2001.
8. A. Czornik and A. Swierniak, “Lower bounds on the solution of coupled algebraic Riccati equation,” Automatica, vol. 37, no. 4, pp. 619–624, 2001.
9. A. Czornik and A. Świerniak, “Upper bounds on the solution of coupled algebraic Riccati equation,” Journal of Inequalities and Applications, vol. 6, no. 4, pp. 373–385, 2001.
10. R. Davies, P. Shi, and R. Wiltshire, “Upper solution bounds of the continuous and discrete coupled algebraic Riccati equations,” Automatica, vol. 44, no. 4, pp. 1088–1096, 2008.
11. F. Ding and T. Chen, “Iterative least-squares solutions of coupled Sylvester matrix equations,” Systems & Control Letters, vol. 54, no. 2, pp. 95–107, 2005.
12. F. Ding and T. Chen, “Gradient based iterative algorithms for solving a class of matrix equations,” IEEE Transactions on Automatic Control, vol. 50, no. 8, pp. 1216–1221, 2005.
13. F. Ding and T. Chen, “On iterative solutions of general coupled matrix equations,” SIAM Journal on Control and Optimization, vol. 44, no. 6, pp. 2269–2284, 2006.
14. F. Ding, P. X. Liu, and J. Ding, “Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle,” Applied Mathematics and Computation, vol. 197, no. 1, pp. 41–50, 2008.
15. B. Hashemi and M. Dehghan, “The interval Lyapunov matrix equation: analytical results and an efficient numerical technique for outer estimation of the united solution set,” Mathematical and Computer Modelling, vol. 55, no. 3-4, pp. 622–633, 2012.
16. J. Ding, Y. Liu, and F. Ding, “Iterative solutions to matrix equations of the form ${A}_{i}X{B}_{i}={F}_{i}$,” Computers & Mathematics with Applications, vol. 59, no. 11, pp. 3500–3507, 2010.
17. A. Liu and G. Chen, “On the Hermitian positive definite solutions of nonlinear matrix equation ${X}^{s}+{A}^{\ast }{X}^{-{t}_{1}}A+{B}^{\ast }{X}^{-{t}_{2}}B=Q$,” Mathematical Problems in Engineering, vol. 2011, Article ID 163585, 18 pages, 2011.
18. L. Xie, J. Ding, and F. Ding, “Gradient based iterative solutions for general linear matrix equations,” Computers & Mathematics with Applications, vol. 58, no. 7, pp. 1441–1448, 2009.
19. L. Xie, Y. Liu, and H. Yang, “Gradient based and least squares based iterative algorithms for matrix equations $AXB+C{X}^{T}D=F$,” Applied Mathematics and Computation, vol. 217, no. 5, pp. 2191–2199, 2010.
20. F. Yin and G.-X. Huang, “An iterative algorithm for the least squares generalized reflexive solutions of the matrix equations $AXB=E,CXD=F$,” Abstract and Applied Analysis, vol. 2012, Article ID 857284, 18 pages, 2012.
21. W. Zhao, H. Li, X. Liu, and F. Xu, “Necessary and sufficient conditions for the existence of a Hermitian positive definite solution of a type of nonlinear matrix equations,” Mathematical Problems in Engineering, vol. 2009, Article ID 672695, 13 pages, 2009.
22. H. Mukaidani, “Newton's method for solving cross-coupled sign-indefinite algebraic Riccati equations for weakly coupled large-scale systems,” Applied Mathematics and Computation, vol. 188, no. 1, pp. 103–115, 2007.
23. H. Mukaidani, S. Yamamoto, and T. Yamamoto, “A Numerical algorithm for finding solution of cross-coupled algebraic Riccati equations,” IEICE Transactions, vol. 91, pp. 682–685, 2008.
24. H. Mukaidani, “Numerical computation of cross-coupled algebraic Riccati equations related to ${H}_{\infty }$-constrained LQG control problem,” Applied Mathematics and Computation, vol. 199, no. 2, pp. 663–676, 2008.
25. I. G. Ivanov, “A method to solve the discrete-time coupled algebraic Riccati equations,” Applied Mathematics and Computation, vol. 206, no. 1, pp. 34–41, 2008.
26. I. G. Ivanov, “Stein iterations for the coupled discrete-time Riccati equations,” Nonlinear Analysis. Theory, Methods & Applications, vol. 71, no. 12, pp. 6244–6253, 2009.
27. R. Bhatia, Matrix Analysis, vol. 169 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 1997.
28. M. Fujii and Y. Seo, “Reverse inequalities of Araki, Cordes and Löwner-Heinz inequalities,” Nihonkai Mathematical Journal, vol. 16, no. 2, pp. 145–154, 2005.
29. P. Lancaster, Theory of Matrices, Academic Press, New York, NY, USA, 1969.
30. C.-H. Guo and N. J. Higham, “A Schur-Newton method for the matrix pth root and its inverse,” SIAM Journal on Matrix Analysis and Applications, vol. 28, no. 3, pp. 788–804, 2006.