In this paper, we propose an efficient method for some special solutions of the quaternion matrix equation $ AXB+CYD = E $. By integrating real representation of a quaternion matrix with $ \mathcal{H} $-representation, we investigate the minimal norm least squares solution of the previous quaternion matrix equation over different constrained matrices and obtain their expressions. In this way, we first apply $ \mathcal{H} $-representation to solve quaternion matrix equation with special structure, which not only broadens the application scope of $ \mathcal{H} $-representation, but further expands the research idea of solving quaternion matrix equation. The algorithms only include real operations. Consequently, it is very simple and convenient, and it can be applied to all kinds of quaternion matrix equation with similar problems. The numerical example is provided to illustrate the feasibility of our algorithms.
Citation: Anli Wei, Ying Li, Wenxv Ding, Jianli Zhao. Three special kinds of least squares solutions for the quaternion generalized Sylvester matrix equation[J]. AIMS Mathematics, 2022, 7(4): 5029-5048. doi: 10.3934/math.2022280
In this paper, we propose an efficient method for some special solutions of the quaternion matrix equation $ AXB+CYD = E $. By integrating real representation of a quaternion matrix with $ \mathcal{H} $-representation, we investigate the minimal norm least squares solution of the previous quaternion matrix equation over different constrained matrices and obtain their expressions. In this way, we first apply $ \mathcal{H} $-representation to solve quaternion matrix equation with special structure, which not only broadens the application scope of $ \mathcal{H} $-representation, but further expands the research idea of solving quaternion matrix equation. The algorithms only include real operations. Consequently, it is very simple and convenient, and it can be applied to all kinds of quaternion matrix equation with similar problems. The numerical example is provided to illustrate the feasibility of our algorithms.
| [1] |
J. Z. Liu, Z. H. Huang, L. Zhu, Z. J. Huang, Theorems on Schur complement of block diagonally dominant matrices and their application in reducing the order for the solution of large scale linear systems, Linear Algebra Appl., 435 (2011), 3085–3100. http://dx.doi.org/10.1016/j.laa.2011.05.023 doi: 10.1016/j.laa.2011.05.023
|
| [2] |
A. G. Wu, Y. M. Fu, G. R. Duan, On solutions of matrix equations $ v-AVF = BW $ and $ v-a\bar{V}F = BW $, Math. Comput. Model., 47 (2008), 1181–1197. http://dx.doi.org/10.1016/j.mcm.2007.06.024 doi: 10.1016/j.mcm.2007.06.024
|
| [3] |
H. M. Zhang, Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications, Comput. Math. Appl., 70 (2015), 2049–2062. http://dx.doi.org/10.1016/j.camwa.2015.08.013 doi: 10.1016/j.camwa.2015.08.013
|
| [4] |
M. Dehghani-Madiseh, M. Dehghan, Generalized solution sets of the interval generalized Sylvester matrix equation $ \sum_{i = 1}^pA_iX_i+\sum_{j = 1}^qY_jB_j = C $ and some approaches for inner and outer estimations, Comput. Math. Appl., 68 (2014), 1758–1774. http://dx.doi.org/10.1016/j.camwa.2014.10.014 doi: 10.1016/j.camwa.2014.10.014
|
| [5] |
A. Navarra, P. L. Odell, D. M. Young, A representation of the general common solution to the matrix equations $ A_1XB_1 = C_1 $ and $ A_2XB_2 = C_2 $ with applications, Comput. Math. Appl., 41 (2001), 929–935. http://dx.doi.org/10.1016/S0898-1221(00)00330-8 doi: 10.1016/S0898-1221(00)00330-8
|
| [6] |
X. P. Sheng, A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations, J. Franklin I., 355 (2018), 4282–4297. http://dx.doi.org/10.1016/j.jfranklin.2018.04.008 doi: 10.1016/j.jfranklin.2018.04.008
|
| [7] |
S. L. Adler, Scattering and decay theory for quaternionic quantum mechanics, and the structure of induced T nonconservation, Phys. Rev. D, 37 (1988), 3564–3662. http://dx.doi.org/10.1103/PhysRevD.37.3654 doi: 10.1103/PhysRevD.37.3654
|
| [8] | N. L. Bihan, S. J. Sangwine, Color image decomposition using quaternion singular value decomposition, 2003 International Conference on Visual Information Engineering VIE 2003. IET, 2003,113–116. |
| [9] |
C. E. Moxey, S. J. Sangwine, T. A. Ell, Hypercomplex correlation techniques for vector images, IEEE T. Signal Proces., 51 (2003), 1941–1953. http://dx.doi.org/10.1109/TSP.2003.812734 doi: 10.1109/TSP.2003.812734
|
| [10] |
T. S. Jiang, L. Chen, Algebraic algorithms for least squares problem in quaternionic quantum theory, Comput. Phys. Commun., 176 (2007), 481–485. http://dx.doi.org/10.1016/j.cpc.2006.12.005 doi: 10.1016/j.cpc.2006.12.005
|
| [11] |
T. S. Jiang, L. Chen, An algebraic method for Schr $ \ddot{o} $ dinger equations in quaternionic quantum mechanics, Comput. Phys. Commun., 178 (2008), 795–799. http://dx.doi.org/10.1016/j.cpc.2008.01.038 doi: 10.1016/j.cpc.2008.01.038
|
| [12] |
S. F. Yuan, Q. W. Wang, Two special kinds of least squares solutions for the quaternion matrix equation $ AXB+CXD = E $, Electronic J. Linear Al., 23 (2012), 257–274. http://dx.doi.org/10.1017/is011004009jkt155 doi: 10.1017/is011004009jkt155
|
| [13] |
S. F. Yuan, A. P. Liao, Least squares solution of the quaternion matrix equation $ X-A\hat{X}B = C $ with the least norm, Linear Multilinear A., 59 (2011), 985–998. http://dx.doi.org/10.1080/03081087.2010.509928 doi: 10.1080/03081087.2010.509928
|
| [14] |
M. H. Wang, M. S. Wei, Y. Feng, An iterative algorithm for least squares problem in quaternionic quantum theory, Comput. Phys. Commun., 179 (2008), 203–207. http://dx.doi.org/10.1016/j.cpc.2008.02.016 doi: 10.1016/j.cpc.2008.02.016
|
| [15] |
J. D. Gardiner, A. J. Laub, J. J. Amato, C. B. Moler, Solution of the Sylvester matrix equation $ AXB^T+CXD^T = E $, ACM T. Math. Software, 18 (1992), 223–231. http://dx.doi.org/10.1145/146847.146929 doi: 10.1145/146847.146929
|
| [16] |
R. K. Cavin Iii, S. P. Bhattacharyya, Robust and well-conditioned eigenstructure assignment via Sylvester's equation, Optim. Contr. Appl. Met., 4 (1983), 205–212. http://dx.doi.org/10.1002/oca.4660040302 doi: 10.1002/oca.4660040302
|
| [17] |
G. L. Chen, J. W. Xia, G. M. Zhuang, Improved passivity analysis for neural networks with Markovian jumping parameters and interval time-varying delays, Neurocomputing, 155 (2015), 253–260. http://dx.doi.org/10.1016/j.neucom.2014.12.023 doi: 10.1016/j.neucom.2014.12.023
|
| [18] |
G. R. Duan, Eigenstructure assignment and response analysis in descriptor linear systems with state feedback control, Int. J. Control, 69 (1998), 663–694. http://dx.doi.org/10.1080/002071798222622 doi: 10.1080/002071798222622
|
| [19] |
S. K. Mitra, The matrix equation $ AXB+CXD = E $, SIAM J. Appl. Math., 32 (1977), 823–825. http://dx.doi.org/10.1080/002071798222622 doi: 10.1080/002071798222622
|
| [20] |
Y. Tian, The solvability of two linear matrix equations, Linear Multilinear A., 48 (2000), 123–147. http://dx.doi.org/10.1080/03081080008818664 doi: 10.1080/03081080008818664
|
| [21] |
L. P. Huang, The matrix equation $ AXB-GXD = E $ over the quaternion field, Linear Algebra Appl., 234 (1996), 197–208. http://dx.doi.org/10.1016/0024-3795(94)00103-0 doi: 10.1016/0024-3795(94)00103-0
|
| [22] |
S. F. Yuan, Q. W. Wang, X. Zhang, Least-squares problem for the quaternion matrix equation $ AXB+CYD = E $ over different constrained matrices, Int. J. Comput. Math., 90 (2013), 565–576. http://dx.doi.org/10.1080/00207160.2012.722626 doi: 10.1080/00207160.2012.722626
|
| [23] |
Y. Zhang, R. H. Wang, The exact solution of a system of quaternion matrix equations involving $ \eta $-Hermicity, Appl. Math. Comput., 222 (2013), 201–209. http://dx.doi.org/10.1016/j.amc.2013.07.025 doi: 10.1016/j.amc.2013.07.025
|
| [24] |
A. Altavilla, C. de Fabritiis, Equivalence of slice semi-regular functions via Sylvester operators, Linear Algebra Appl., 607 (2020), 151–189. http://dx.doi.org/10.1016/j.laa.2020.08.009 doi: 10.1016/j.laa.2020.08.009
|
| [25] |
A. Altavilla, C. de Fabritiis, Applications of the Sylvester operator in the space of slice semi-regular functions, Concr. Operators, 7 (2020), 1–12. http://dx.doi.org/10.1515/conop-2020-0001 doi: 10.1515/conop-2020-0001
|
| [26] | J. J. Sylvester, Sur l'equations en matrices $ px = xq $, C. R. Acad. Sci. Paris, 99 (1884). |
| [27] |
R. Bhatia, P. Rosenthal, How and why to solve the operator equation $ AX-XB = Y $, B. Lond. Math. Soc., 29 (1997), 1–21. http://dx.doi.org/10.1112/S0024609396001828 doi: 10.1112/S0024609396001828
|
| [28] |
F. X. Zhang, M. S. Wei, Y. Li, J. L. Zhao, An efficient real representation method for least squares problem of the quaternion constrained matrix equation $ AXB+CYD = E $, Int. J. Comput. Math., 98 (2021), 1408–1419. http://dx.doi.org/10.1080/00207160.2020.1821001 doi: 10.1080/00207160.2020.1821001
|
| [29] | J. L. Chen, X. H. Chen, Special matrices, Tsinghua University Press, 2001. |
| [30] |
W. H. Zhang, B. S. Chen, $ \mathcal{H} $-Representation and applications to generalized Lyapunov equations and linear stochastic systems, IEEE T. Automat. Contr., 57 (2012), 3009–3022. http://dx.doi.org/10.1109/TAC.2012.2197074 doi: 10.1109/TAC.2012.2197074
|
| [31] | G. H. Golub, C. F. Van Loan, Matrix computations, 4 Eds., Baltimore MD: The Johns Hopkins University Press, 2013. |
Figures(1)
Anli Wei, Ying Li, Wenxv Ding, Jianli Zhao. Three special kinds of least squares solutions for the quaternion generalized Sylvester matrix equation[J]. AIMS Mathematics, 2022, 7(4): 5029-5048. doi: 10.3934/math.2022280
DownLoad: