Brief paperConstrained two-sided coupled Sylvester-type quaternion matrix equations☆
Introduction
Sylvester-type matrix equations play an important role in control systems (Syrmos & Lewis, 1993), image processing (Calvetti & Reichel, 1996), statistics and probability (Barbour & Utev, 1998), neural network (Zhang, Jiang, & Wang, 2002), eigenvalue assignment problems (Brahma & Datta, 2009), graph theory (Dmytryshyn & Kågström, 2015), and so on.
Quaternions and quaternion matrices have been used in many fields such as control theory, signal and color image processing, orbital mechanics and computer science. (e.g. Bihan and Mars, 2004, He et al., 2016, He et al., 2019, Jia et al., 2018, Leo and Scolarici, 2000, Took and Mandic, 2011). Sylvester-type matrix equations over the quaternion algebra have attracted the attention of many researchers (e.g., Futorny et al., 2016, He et al., 2017, Wang, 2004). For instance, Rodman considered the standard one-sided Sylvester quaternion matrix equation (page 117, Rodman, 2014). Wang et al. considered some systems of one-sided coupled Sylvester-type quaternion matrix equations (He and Wang, 2017, He et al., 2018, Wang and He, 2013, Wang and He, 2014, Wang et al., 2016).
The numerical solution to the system of two-sided coupled Sylvester-type matrix equations was first considered by Byers and Rhee (1995). Jonsson and Kågström (2002) gave algorithms to solve some triangular systems of two-sided generalized Sylvester equations. Hajarian (2015) gave an iterative method for solving the system of two-sided coupled Sylvester-type complex matrix equations Note that most of the research work related to two-sided coupled Sylvester-type matrix equations build upon existing works for the complex matrix and numerical solution cases. However, so far there has been little information on the solvability conditions and general solution to two-sided coupled Sylvester-type matrix equations over the quaternion algebra. Due to the noncommutativity, one cannot directly extend various results on real or complex numbers to quaternions. Motivated by the wide applications of Sylvester-type quaternion matrix equations and in order to improve the theoretical development of two-sided Sylvester-type equations, we in this paper consider the solvability conditions and general solution to a system of constrained two-sided coupled Sylvester-type quaternion matrix equations. More specifically, where are given quaternion matrices, and are unknowns.
The remainder of the paper is organized as follows. In Section 2, we discuss the special systems of quaternion matrix equations. In Section 3, we give some necessary and sufficient conditions for the existence of a solution to the system (1). We also present the general solution to the system (1) when it is solvable. A numerical example is presented to illustrate that our results are feasible. Finally, a brief conclusion is given in Section 4.
Throughout this paper, let and stand, respectively, for the real number field and the set of all matrices over the quaternion algebra For more definitions and properties of quaternions, we refer the reader to the recent book (Rodman, 2014). The symbols and stand for the rank of a given quaternion matrix and the conjugate transpose of , respectively. The identity matrix and zero matrix with appropriate sizes are denoted by and , respectively. The Moore–Penrose inverse of a quaternion matrix , is defined to be the unique matrix such that Furthermore, and stand for the projectors and induced by , respectively.
Section snippets
Preliminaries
In this section, we consider some quaternion matrix equations, which will be used in proving the main result. The following lemma gives the solvability condition and general solution to the system of quaternion matrix equations where and are given quaternion matrices.
Lemma 2.1 The system (2) is consistent if and only if In this case, the general solution to (2) can be expressed as where is an arbitrary matrix over withWang, van der Woude, & Chang, 2009
Some solvability conditions and the general solution to (1)
In this section, we give some necessary and sufficient conditions for the existence of a solution to the system (1). We also present the expression of the general solution to the system (1) when it is solvable. In addition, a numerical example is presented to illustrate the main result.
Now we give the fundamental theorem of this paper. For simplicity, put
Conclusion
We have derived some necessary and sufficient conditions for the existence of a solution to the system of constrained two-sided coupled generalized Sylvester quaternion matrix equations (1). We have also given the general solution to the system (1) when it is solvable. The results in this paper are also valid over the real number field and complex number field as special cases.
Qing-Wen Wang was born in Shandong Province, China, in 1964. He achieved his Ph.D. degree from the University of Science and Technology of China. Since January 2004, he has been a Full Professor and the head of the Department of Mathematics at Shanghai University. His research interests include matrix theory, linear algebra and its applications in systems and control, operator algebra, numerical linear algebra, and quantum computing. He has authored or co-authored more than 100 papers in
References (30)
- et al.
An optimization approach for minimum norm and robust partial quadratic eigenvalue assignment problems for vibrating structures
Journal of Sound and Vibration
(2009) - et al.
Roths solvability criteria for the matrix equations and over the skew field of quaternions with an involutive automorphism
Linear Algebra and its Applications
(2016) - et al.
Two-sided coupled generalized sylvester matrix equations solving using a simultaneous decomposition for fifteen matrices
Linear Algebra and its Applications
(2016) - et al.
A system of quaternary coupled sylvester-type real quaternion matrix equations
Automatica
(2018) - et al.
A simultaneous decomposition for seven matrices with applications
Journal of Computational and Applied Mathematics
(2019) - et al.
A new real structure-preserving quaternion QR algorithm
Journal of Computational and Applied Mathematics
(2018) A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity
Linear Algebra and its Applications
(2004)- et al.
Solvability conditions and general solution for the mixed Sylvester equations
Automatica
(2013) - et al.
Systems of coupled generalized sylvester matrix equations
Automatica
(2014) - et al.
Constraint generalized Sylvester matrix equations
Automatica
(2016)
A system of real quaternion matrix equations with applications
Linear Algebra and its Applications
Solving the stein equation in compound poisson approximation
Advances in Applied Probability
Singular value decomposition of quaternion matrices: A new tool for vector-sensor signal processing
Signal Processing
Cyclic Schur and Hessenberg-Schur numerical methods for solving periodic Lyapunov and Sylvester equations
Journal of Psychology & Human Sexuality
Application of ADI iterative methods to the restoration of noisy images
SIAM Journal of Mathematical Analysis
Cited by (57)
Combined real and imaginary parts method for solving generalized Lyapunov matrix equation
2022, Applied Numerical MathematicsClosed-form solution of non-symmetric algebraic Riccati matrix equation
2022, Applied Mathematics LettersA new approximation algorithm for solving generalized Lyapunov matrix equations
2022, Journal of Computational and Applied MathematicsA System of Sylvester-like Quaternion Tensor Equations with an Application
2024, Frontiers of MathematicsA coupled quaternion matrix equations with applications
2023, Journal of Applied Mathematics and Computing
Qing-Wen Wang was born in Shandong Province, China, in 1964. He achieved his Ph.D. degree from the University of Science and Technology of China. Since January 2004, he has been a Full Professor and the head of the Department of Mathematics at Shanghai University. His research interests include matrix theory, linear algebra and its applications in systems and control, operator algebra, numerical linear algebra, and quantum computing. He has authored or co-authored more than 100 papers in refereed journals. He has also been active in his service as the Editor-in-Chief and editors for several refereed journals.
Zhuo-Heng He was born in Zhejiang Province, China, in 1987. He received his Bachelor degree, Master Degree and Ph.D. degree from the Department of Mathematics at Shanghai University, in 2010, 2013 and 2016, respectively. He was a joint Ph.D. student in the Department of Electrical Engineering (ESAT), KU Leuven, Belgium, from 2014 to 2015. From 2016 to 2018, he was a visiting Assistant Professor of the Department of Mathematics and Statistics at Auburn University. Since 2018, he has been an Assistant Professor of the Department of Mathematics at Shanghai University. His research interests include matrix theory, linear algebra and its applications in systems and control, numerical linear algebra.
Yang Zhang was born in Henan Province, China, in 1965. He received his Ph.D. degree from the University of Western Ontario, Canada. Since July of 2008, he has been an Associate Professor in Department of Mathematics at the University of Manitoba, Canada. His recent research interest is Symbolic Computation, in particular, efficient algorithms for matrices over noncommutative rings, factoring skew polynomials, Gröbner bases and applications. His research is supported by The Natural Sciences and Engineering Research Council of Canada (NSERC).
- ☆
This research is supported by the grants from the National Natural Science Foundation of China (11571220) and (11801354), the Macao Science and Technology Development Fund (185/2017/A3), and the Natural Sciences and Engineering Research Council of Canada (NSERC) (RGPIN 312386-2015). The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Delin Chu under the direction of Editor Ian R. Petersen.