×

The least squares solution with the minimal norm to a system of mixed generalized Sylvester reduced biquaternion tensor equations. (English) Zbl 1515.15028

Summary: In this paper, we investigate the least squares solution with the minimal norm to the system (1.1) over reduced biquaternion via complex representation of reduced biquaternion tensors and the Moore-Penrose inverse of tensors. Besides, we establish some necessary and sufficient conditions for the solvability to the above system and give an expression of the general solution to the system when the solvability conditions are met. Moreover, the algorithm and numerical example are presented to verify the main results of this paper.

MSC:

15A69 Multilinear algebra, tensor calculus
15A09 Theory of matrix inversion and generalized inverses
15A24 Matrix equations and identities
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M. Brazell, N. Li, C. Navasca and C. Tamon, Solving multilinear systems via tensor inversion, SIAM J. Matrix Anal. Appl. 34 (2013), no. 2, 542-570. · Zbl 1273.15028
[2] Z. Chen and L. Lu, A projection method and Kronecker product preconditioner for solving Sylvester tensor equations, Sci. China Math. 55 (2012), no. 6, 1281-1292. · Zbl 1273.65048 · doi:10.1007/s11425-012-4363-5
[3] M. Dehghan and M. Hajarian, Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations, Appl. Math. Model. 35 (2011), no. 7, 3285-3300. · Zbl 1227.65037 · doi:10.1016/j.apm.2011.01.022
[4] G.-R. Duan and B. Zhou, Solution to the second-order Sylvester matrix equation \(MVF^2 + DVF + KV = BW\), IEEE Trans. Automat. Control 51 (2006), no. 5, 805-809. · Zbl 1366.15011
[5] A. Einstein, The foundation of the general theory of relativity, in: Kox AJ, Klein MJ, Schulmann R, editors. The Collected Papers of Albert Einstein 6, 146-200, Princeton University Press, Princeton, NJ, 2007.
[6] Q. He, L. Hou and J. Zhou, The solution of fuzzy Sylvester matrix equation, Soft Comput. 22 (2018), no. 19, 6515-6523. · Zbl 1402.15021
[7] Z.-H. He, The general solution to a system of coupled Sylvester-type quaternion tensor equations involving \(\eta \)-Hermicity, Bull. Iranian Math. Soc. 45 (2019), no. 5, 1407-1430. · Zbl 1423.15016
[8] Z. He and Q. Wang, A system of periodic discrete-time coupled Sylvester quaternion matrix equations, Algebra Colloq. 24 (2017), no. 1, 169-180. · Zbl 1361.15015
[9] B. Huang and C. Ma, An iterative algorithm to solve the generalized Sylvester tensor equations, Linear Multilinear Algebra 68 (2020), no. 6, 1175-1200. · Zbl 1453.65084
[10] T. Levi-Civita, The Absolute Differential Calculus: Calculus of tensors, Dover Phoenix Editions, Dover Publications, Mineola, New York, 2005. · Zbl 1206.53013
[11] T. Li, Q.-W. Wang and X.-F. Duan, Numerical algorithms for solving discrete Lyapunov tensor equation, J. Comput. Appl. Math. 370 (2020), 112676, 11 pp. · Zbl 1433.65078
[12] T. Li, Q.-W. Wang and X.-F. Zhang, Gradient based iterative methods for solving symmetric tensor equations, Numer. Linear Algebra Appl. 29 (2022), no. 2, Paper No. e2414, 14 pp. · Zbl 07511595
[13] L.-H. Lim, Singular values and eigenvalues of tensors: A variational approach, 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, (2005), 129-132.
[14] L. Qi, H. Chen and Y. Chen, Tensor Eigenvalues and Their Applications, Advances in Mechanics and Mathematics 39, Springer, Singapore, 2018. · Zbl 1398.15001
[15] L. Qi and Z. Luo, Tensor Analysis: Spectral theory and special tensors, Other Titles in Applied Mathematics, Society for Industrial and Applied Mathematics, 2017. · Zbl 1370.15001
[16] L. Qi, G. Yu and E. X. Wu, Higher order positive semidefinite diffusion tensor imaging, SIAM J. Imaging Sci. 3 (2010), no. 3, 416-433. · Zbl 1197.92032
[17] A. Rehman, Q.-W. Wang, I. Ali, M. Akram and M. O. Ahmad, A constraint system of generalized Sylvester quaternion matrix equations, Adv. Appl. Clifford Algebr. 27 (2017), no. 4, 3183-3196. · Zbl 1386.15035
[18] A. Shahzad, B. L. Jones, E. C. Kerrigan and G. A. Constantinides, An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems, Automatica J. IFAC 47 (2011), no. 1, 244-248. · Zbl 1210.65147
[19] A. Shashua and T. Hazan, Non-negative tensor factorization with applications to statistics and computer vision, Proceedings of the 22nd international conference on Machine learning, (2005), 792-799.
[20] G.-J. Song and S. Yu, The solution of a generalized Sylvester quaternion matrix equation and its application, Adv. Appl. Clifford Algebr. 27 (2017), no. 3, 2473-2492. · Zbl 1382.15024
[21] L. Sun, B. Zheng, C. Bu and Y. Wei, Moore-Penrose inverse of tensors via Einstein product, Linear Multilinear Algebra 64 (2016), no. 4, 686-698. · Zbl 1341.15019
[22] Q.-W. Wang, Z.-H. He and Y. Zhang, Constrained two-sided coupled Sylvester-type quaternion matrix equations, Automatica J. IFAC 101 (2019), 207-213. · Zbl 1409.15009 · doi:10.1016/j.automatica.2018.12.001
[23] Q.-W. Wang, R.-Y. Lv and Y. Zhang, The least-squares solution with the least norm to a system of tensor equations over the quaternion algebra, Linear Multilinear Algebra 70 (2022), no. 10, 1942-1962. · Zbl 1492.15017
[24] Q.-W. Wang and X. Wang, A system of coupled two-sided Sylvester-type tensor equations over the quaternion algebra, Taiwanese J. Math. 24 (2020), no. 6, 1399-1416. · Zbl 1462.15021
[25] Q.-W. Wang, X. Xu and X. Duan, Least squares solution of the quaternion Sylvester tensor equation, Linear Multilinear Algebra 69 (2021), no. 1, 104-130. · Zbl 1459.15020
[26] X.-F. Zhang and Q.-W. Wang, Developing iterative algorithms to solve Sylvester tensor equations, Appl. Math. Comput. 409 (2021), Paper No. 126403, 14 pp. · Zbl 1510.15044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.