We investigate least-squares (LS) solutions of Sylvester-type matrix equations formulated via the general semi-tensor product (GSTP) of matrices. In particular, we consider generalized linear systems of the form $ A \ltimes x = B $, where $ A $ and $ B $ are given rectangular matrices and $ x $ is an unknown column vector, with $ \ltimes $ denoting the GSTP that extends both the conventional matrix product and the semi-tensor product. By analyzing the derivative of the LS error associated with the equation, we show that LS solutions can be obtained by solving an equivalent linear system under the usual matrix product. Using matrix partitioning techniques, these results are further extended to several Sylvester-type equations, including $ A \ltimes X = B $, $ X \ltimes \mathrm{A} = B $, and $ A \ltimes X \ltimes B = C $, where $ X $ is an unknown matrix of compatible size. This framework unifies the classical and semi-tensor product cases under a generalized algebraic setting. Furthermore, we develop a gradient-descent iterative algorithm to compute approximate LS solutions efficiently. Numerical experiments confirm the convergence, capability, and effectiveness of the proposed method.
Citation: Janthip Jaiprasert, Thanaphon Phoonphiphat, Pattrawut Chansangiam, Yang Zhang. Least-squares solutions of generalized linear systems and the matrix equation $ AXB = C $ under the general semi-tensor products[J]. Electronic Research Archive, 2026, 34(2): 676-693. doi: 10.3934/era.2026031
We investigate least-squares (LS) solutions of Sylvester-type matrix equations formulated via the general semi-tensor product (GSTP) of matrices. In particular, we consider generalized linear systems of the form $ A \ltimes x = B $, where $ A $ and $ B $ are given rectangular matrices and $ x $ is an unknown column vector, with $ \ltimes $ denoting the GSTP that extends both the conventional matrix product and the semi-tensor product. By analyzing the derivative of the LS error associated with the equation, we show that LS solutions can be obtained by solving an equivalent linear system under the usual matrix product. Using matrix partitioning techniques, these results are further extended to several Sylvester-type equations, including $ A \ltimes X = B $, $ X \ltimes \mathrm{A} = B $, and $ A \ltimes X \ltimes B = C $, where $ X $ is an unknown matrix of compatible size. This framework unifies the classical and semi-tensor product cases under a generalized algebraic setting. Furthermore, we develop a gradient-descent iterative algorithm to compute approximate LS solutions efficiently. Numerical experiments confirm the convergence, capability, and effectiveness of the proposed method.
| [1] | G. E. Dulleru, F. Paganini, A Course in Robust Control Theory: A Convex Approach, Springer, 2000. https://doi.org/10.1007/978-1-4757-3290-0 |
| [2] | J. R. Magnus, H. Neudecker, Matrix Differential Calculus with Applications in Statistics and Econometrics, 3rd edition, John Wiley & Sons, 2019. |
| [3] |
D. Cheng, Semi-tensor product of matrices and its application to Morgan's problem, Sci. China Ser. Inf. Sci., 44 (2001), 195–212. https://doi.org/10.1007/BF02714570 doi: 10.1007/BF02714570
|
| [4] | D. Cheng, H. Qi, Y. Zhao, An Introduction to Semi-Tensor Product of Matrices and Its Applications, World Scientific Publishing, 2012. https://doi.org/10.1142/8323 |
| [5] |
D. Cheng, H. Qi, A. Xue, A survey on semi-tensor product of matrices, J. Syst. Sci. Complex., 20 (2007), 304–322. https://doi.org/10.1007/s11424-007-9027-0 doi: 10.1007/s11424-007-9027-0
|
| [6] |
D. Cheng, X. Hu, Y. Wang, Non-regular feedback linearization of nonlinear systems via a normal form algorithm, Automatica, 40 (2004), 439–447. https://doi.org/10.1016/j.automatica.2003.10.014 doi: 10.1016/j.automatica.2003.10.014
|
| [7] |
D. Cheng, Input-state approach to Boolean networks, IEEE Trans. Neural Networks, 20 (2009), 512–521. https://doi.org/10.1109/TNN.2008.2011359 doi: 10.1109/TNN.2008.2011359
|
| [8] |
D. Cheng, T. Xu, H. Qi, Evolutionarily stable strategy of networked evolutionary games, IEEE Trans. Neural Networks Learn. Syst., 25 (2013), 1335–1345. https://doi.org/10.1109/TNNLS.2013.2293149 doi: 10.1109/TNNLS.2013.2293149
|
| [9] |
Y. Yan, D. Cheng, J. Feng, H. Li, J. Yue, Survey on applications of algebraic state space theory of logical systems to finite state machines, Sci. China Inf. Sci., 66 (2023), 111201. https://doi.org/10.1007/s11432-022-3538-4 doi: 10.1007/s11432-022-3538-4
|
| [10] |
J. Yao, J. Feng, M. Meng, On solutions of the matrix equation $AX = B$ with respect to semi-tensor product, J. Franklin Inst., 353 (2016), 1109–1131. https://doi.org/10.1016/j.jfranklin.2015.04.004 doi: 10.1016/j.jfranklin.2015.04.004
|
| [11] |
J. F. Li, T. Li, W. Li, Y. M. Chen, R. Huang, Solvability of matrix equations $AX = B, XC = D$ under semi-tensor product, Linear Multilinear Algebra, 65 (2016), 1705–1733. https://doi.org/10.1080/03081087.2016.1253664 doi: 10.1080/03081087.2016.1253664
|
| [12] |
Z. D. Ji, J. F. Li, X. L. Zhou, F. J. Duan, T. Li, On solutions of matrix equation $AXB = C$ under semi-tensor product, Linear Multilinear Algebra, 69 (2019), 1935–1963. https://doi.org/10.1080/03081087.2019.1650881 doi: 10.1080/03081087.2019.1650881
|
| [13] |
J. Jaiprasert, P. Chansangiam, Solving the Sylvester-transpose matrix equation under the semi-tensor product, Symmetry, 14 (2022), 1094. https://doi.org/10.3390/sym14061094 doi: 10.3390/sym14061094
|
| [14] | P. Chansangiam, S. V. Sabau, Sylvester matrix equation under the semi-tensor product of matrices, An. Stiint. Univ. Al. I. Cuza Iasi. Mat. (N.S.), 68 (2022), 263–278. |
| [15] |
F. Zhang, Y. Li, J. Zhao, The semi-tensor product method for special least squares solutions of the complex generalized Sylvester matrix equation, AIMS Math., 8 (2023), 5200–5215. https://doi.org/10.3934/math.2023261 doi: 10.3934/math.2023261
|
| [16] |
J. Sun, Y. Li, M. Zhang, Z. Liu, A. Wei, A new method based on semi-tensor product of matrices for solving reduced biquaternion matrix equation $\sum_{p = 1}^l A_p X B_p = C$ and its application in color image restoration, Math. Modell. Control, 3 (2023), 218–232. https://doi.org/10.3934/mmc.2023019 doi: 10.3934/mmc.2023019
|
| [17] |
M. Zhang, Y. Li, J. Sun, X. Fan, A. Wei, A new method based on the semi-tensor product of matrices for solving communicative quaternion matrix equation $\sum_{i = 1}^k A_i X B_i = C$ and its application, Bull. Sci. Math., 199 (2025), 103576. https://doi.org/10.1016/j.bulsci.2025.103576 doi: 10.1016/j.bulsci.2025.103576
|
| [18] | T. Phoonphiphat, P. Chansangiam, Derivatives of matrix-valued functions involving semi-tensor products in vector variables, IAENG Int. J. Appl. Math., 54 (2024), 2290–2298. |
| [19] | R. A. Horn, C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, 1991. https://doi.org/10.1017/CBO9780511840371 |
| [20] |
D. Tracy, R. Singh, A new matrix product and its applications in partitioned matrix differentiation, Stat. Neerl., 26 (1972), 143–157. https://doi.org/10.1111/j.1467-9574.1972.tb00199.x doi: 10.1111/j.1467-9574.1972.tb00199.x
|
| [21] | D. A. Turkington, Matrix Calculus & Zero-One Matrices: Statistical and Econometric Applications, Cambridge University Press, 2009. https://doi.org/10.1017/CBO9780511528460 |
| [22] |
K. Tansri, P. Chansangiam, Gradient-descent iterative algorithm for solving exact and weighted least-squares solutions of rectangular linear systems, AIMS Math., 8 (2023), 11781–11798. https://doi.org/10.3934/math.2023596 doi: 10.3934/math.2023596
|
Figures(2) / Tables(1)
Janthip Jaiprasert, Thanaphon Phoonphiphat, Pattrawut Chansangiam, Yang Zhang. Least-squares solutions of generalized linear systems and the matrix equation $ AXB = C $ under the general semi-tensor products[J]. Electronic Research Archive, 2026, 34(2): 676-693. doi: 10.3934/era.2026031
DownLoad: