Three Symmetrical Systems of Coupled Sylvester-like Quaternion Matrix Equations

: The current study investigates the solvability conditions and the general solution of three symmetrical systems of coupled Sylvester-like quaternion matrix equations. Accordingly, the necessary and sufﬁcient conditions for the consistency of these systems are determined, and the general solutions of the systems are thereby deduced. An algorithm and a numerical example are constructed over the quaternions to validate the results of this paper.


Introduction
Sylvester-like matrix equations and their generalizations have applications in many scientific fields such as graph theory [1], image processing [2], output feedback control [3], neural networks [4], eigenvalue assignment problems [5], robust control [6] and so on (for example, see [7][8][9][10][11][12][13][14][15][16][17]). The iterative methods of solving linear and nonlinear Sylvesterlike matrix equations are built on numerical solution methods [18][19][20][21][22][23][24][25][26][27]. So far, there has not been fruitful information on the solvability conditions and the general solution to systems of mixed and coupled Sylvester-like quaternion matrix equations. For the sake of understanding, analyzing, and developing theoretical studies of generalized systems of Sylvester coupled matrix equations and their applications, we, in this paper, consider the solvability conditions and the general solutions of the following three symmetrical systems of coupled Sylvester-like quaternion matrix equations: where A i , B i and C i (i = 1,5) are the given matrices with compatible dimensions, while X, Y, Z, W, and V are the unknown matrices over H. This work is motivated by a variety of well-known results on the solvability conditions and the general solutions of linear matrix equations in the literature, especially the findings of the following generalized Sylvester matrix equation: Baksalary and Kala [28] came up with the general solution to (4). Lee and Vu [29] conducted a thorough examination of the general solution and solvability conditions for the following coupled system of matrix equations: where X, Y and Z are unknowns over the complex field with compatible sizes. Wang and He [30] derived the solvability conditions and the general solution for the following systems of symmetrical coupled Sylvester-like matrix equations: Meanwhile, Liu et al. [31] derive the determinantal representations of the general solution to (6). The solvability conditions and the general solution formulas for the matrix equations: and are given by [32,33], respectively, which have a fundamental role in inferring the main results of this paper. Here, we provide proper generalizations to the systems of Sylvesterlike matrix Equations (4)- (8). In particular, we reproduce the results of [11,29,33,34], see Section 3.1. In [30,33], He and Wang presented the solvability conditions and the general solution for the following Sylvester-like matrix equation: They presented these findings in terms of the Moore-Penrose inverse of certain given matrices. The resulting equation has wide applications in the linear matrix equations field, see [7,[34][35][36][37][38][39][40]. He and Meng [41] derived the rank equalities solvability conditions for the following quaternion matrix equation with two different restrictions: The solvability conditions and the general solution to the Sylvester-like matrix equa-tionÀ were given by [42], which is crucial to the proof in this study. We organize this paper as follows. Some definitions and lemmas are reviewed in Section 2. In Section 3, we carry out the solvability conditions and the general solution of (1). In Section 4, we consider similarly the systems (2) and (3). To close this paper, we give a conclusion in Section 5.

Preliminaries
We denote the real number field by R, while H stands for the quaternion algebra, which considered as a division ring [12,43,44]. H l×k expresses the set of all l × k matrices over H. The symbol A * represents the conjugate transpose of A. The Moore-Penrose inverse of A ∈ H l×k is denoted by A † ∈ H k×l . Furthermore, L A = I − A † A, R A = I − AA † stand for the two projectors of A and r(A) represents the rank of the matrix A.

Lemma 1 ([45]).
Let A ∈ H m×n , B ∈ H m×k and C ∈ H l×n be given. Then Lemma 2 ([32]). Let A, B, C and D be given. Then the quaternion matrix Equation (7) is solvable if and only if In this case, the general solution of (7) can be expressed as where V is an arbitrary matrix over H with suitable size.

Lemma 3 ([28]
). Let A 1 , B 1 and C 1 be given. Then the quaternion matrix Equation (4) is solvable if and only if In this case, the general solution of (4) can be expressed as where U i , (i = 1, 3) are arbitrary matrices over H with appropriate sizes.
In this case, the general solution of (11) can be expressed as Then the following statements are equivalent: In this case, the general solution of (1) can be expressed as where have a common solution. By using Lemma 2, we have the general common solution as where Q is an arbitrary matrix over H with suitable size. For the matrix equations when the conditions R A i C i L B i = 0 (i = 3, 4) are met, we have that (41) and (42) are solvable, respectively. By using Lemma 3, their general solutions can be expressed as where W i and V i (i = 1, 3) are arbitrary matrices with suitable sizes. Substituting (40), (43) and (44) into the equation we have the following Sylvester-like matrix equation: Now, by applying Lemma 4, the Equation (46) has a solution if and only if In this case, the expression of the general solution of (46) can be expressed as By using Lemma 1, it is easy to check that: Elementary rows (columns) Equation (22) ⇐= ==== =⇒ Elementary rows (columns) Equation (22) ⇐= ==== =⇒ Elementary rows (columns) ⇐= ============ =⇒ operations, Equation (48) (29).

Some Special Cases to the System (1)
In this section, we consider some special cases of the system (1). The following corollary coincides with one of the essential findings in [33]. Corollary 1. Let A 1 , B 1 , C 1 , D 1 and E 1 be given. Set Then the following statements are equivalent: (1) The matrix Equation (8) is solvable. (2) In this case, the general solution of (8) can be expressed as where W 1 , W 2 , W 3 , U and V are arbitrary matrices over the H with suitable sizes.
The following corollary is matching with the main result in [30].

Corollary 2. Let A i , B i and C i (i = 1, 3) be given. Set
Then the following statements are equivalent: is solvable. (2) In this case, the general solution of (49) can be expressed as where U 2 , V 2 , T 1 , . . . , T 8 are arbitrary matrices over H with suitable sizes.
The following corollary can be considered as an essential finding in [11,29,34]. Corollary 3. Let A i , B i and C i (i = 1, 2) be given. Set Then the following statements are equivalent: (1) The system (5) is solvable. (2) In this case, the general solution of (5) can be expressed as where W 1 , . . . , W 6 are arbitrary matrices with suitable sizes over H.

Algorithm with a Numerical Example
In this subsection, we carry out an algorithm(see Algorithm 1) and a numerical example to justify our main findings. The numerical calculations can be done using MATLAB 2018 (R2018b).

Algorithm 1
Calculate the general solution to the system (1).
1. Input the system (1) with coefficients A k , B k and C k , (k = 1, 5) with viable dimensions over H. 2. Compute all matrices that appeared in (12) and (22). 3. Check whether the Moore-Penrose inverses conditions in Theorem 1 are satisfied or not.
Note that the conditions in (3) can be exchange by rank equalities conditions (24)-(34).

Example 1.
Consider the system of Sylvester-like quaternion matrix (1), where Straightforward calculations in Algorithm 1, using the quaternion package on MatLab or Maple software, it can be found that these matrices obey all the equalities in (23). Upon computation, we observe that A 11 = 0, where I j is the identity matrix of order j. Consequently, the system (1) is solvable. Hence the general solution to (1) is where P 1 , P 2 , P 5 , P 6 , P 11 = P 7 + U 4 , P 8 , W 2 , P 3 and U 32 are arbitrary matrices over H, and

The Solvability Conditions and the General Solutions to the Systems (2) and (3)
We can easily investigate systems (2) and (3) by the same method and techniques we used in investigating the system (1). We merely present the main results of (2) and (3) in this part, omitting the intricacies of their proofs.
Let A i , B i and C i (i = 1, 5) be given. For simplicity, consider (12) such that Theorem 2. The following statements are equivalent: (1) The system (2) is solvable.