Next Article in Journal
Exact Solvability Conditions for the Non-Local Initial Value Problem for Systems of Linear Fractional Functional Differential Equations
Next Article in Special Issue
Stieltjes Property of Quasi-Stable Matrix Polynomials
Previous Article in Journal
Modeling Electricity Price Dynamics Using Flexible Distributions
Previous Article in Special Issue
A Modified Conjugate Residual Method and Nearest Kronecker Product Preconditioner for the Generalized Coupled Sylvester Tensor Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Sylvester-Type Matrix Equation over the Hamilton Quaternions with an Application

by
Long-Sheng Liu
1,
Qing-Wen Wang
1,2,* and
Mahmoud Saad Mehany 
1,3
1
Department of Mathematics, Shanghai University, Shanghai 200444, China
2
Collaborative Innovation Center for the Marine Artificial Intelligence, Shanghai 200444, China
3
Department of Mathematics, Ain Shams University, Cairo 11566, Egypt
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(10), 1758; https://doi.org/10.3390/math10101758
Submission received: 2 April 2022 / Revised: 3 May 2022 / Accepted: 19 May 2022 / Published: 21 May 2022

Abstract

:
We derive the solvability conditions and a formula of a general solution to a Sylvester-type matrix equation over Hamilton quaternions. As an application, we investigate the necessary and sufficient conditions for the solvability of the quaternion matrix equation, which involves η -Hermicity. We also provide an algorithm with a numerical example to illustrate the main results of this paper.
MSC:
15A03; 15A09; 15A24; 15B33; 15B57

1. Introduction

Let R stand for the real number field and
H = { u 0 + u 1 i + u 2 j + u 3 k | i 2 = j 2 = k 2 = ijk = 1 , u 0 , u 1 , u 2 , u 3 R } .
H is called the Hamilton quaternion algebra, which is a non-commutative division ring. Hamilton quaternions and Hermitian quaternion matrices have been utilized in statistics of quaternion random signals [1], quaternion matrix optimization problems [2], signal and color image processing, face recognition [3,4], and so on.
Sylvester and Sylvester-type matrix equations have a large number of applications in different disciplines and fields. For example, the Sylvester matrix equation
A 1 X + X B 1 = C 1
and the Sylvester-type matrix equation
A 1 X + Y B 1 = C 1
have been applied in singular system control [5], system design [6], perturbation theory [7], sensitivity analysis [8], H α -optimal control [9], linear descriptor systems [10], and control theory [11]. Roth [12] gave the Sylvester-type matrix Equation (2) for the first time over the polynomial integral domain. Baksalary and Kala [13] established the solvability conditions for Equation (2) and gave an expression of its general solution. In addition, Baksalary and Kala [14] derived the necessary and sufficient conditions for a two-sided Sylvester-type matrix equation
A 11 X 1 B 11 + C 11 X 2 D 11 = E 11
to be consistent. Özgüler [15] studied (3) over a principal ideal domain. Wang [16] investigated (3) over an arbitrary regular ring with an identity element.
Due to the wide applications of quaternions, the investigations on Sylvester-type matrix equations have been extended to H in the last decade (see, e.g., [17,18,19,20,21,22,23,24]). They are applied for signal processing, color-image processing, and maximal invariant semidefinite or neutral subspaces, etc. (see, e.g., [25,26,27,28]). For instance, the general solution to Sylvester-type matrix Equation (2) can be used in color-image processing. He [29] derived the matrix Equation (2) as an essential finding. Roman [25] established the necessary and sufficient conditions for Equation (1) to have a solution. Kychei [30] investigated Cramer’s rules to drive the necessary and sufficient conditions for Equation (3) to be solvable. As an extension of Equations (2) and (3), Wang and He [31] gave the solvability conditions and the general solution to the Sylvester-type matrix equation
A 1 X 1 + X 2 B 1 + C 3 X 3 D 3 + C 4 X 4 D 4 = E 1
over the complex number field C , which can be generalized to H and applicable in some Sylvester-type matrix equations over H (see, e.g., [29,32]).
We know that in system and control theory, the more unknown matrices that a matrix equation has, the wider its application will be. Consequently, for the sake of developing theoretical studies and the applications mentioned above of Sylvester-type matrix equation and their generalizations, in this paper, we aim to establish some necessary and sufficient conditions for the Sylvester-type matrix equation
A 1 X 1 + X 2 B 1 + A 2 Y 1 B 2 + A 3 Y 2 B 3 + A 4 Y 3 B 4 = B
to have a solution in terms of the rank equalities and Moore–Penrose inverses of some coefficient quaternion matrices in Equation (5) over H . We derive a formula of its general solution when it is solvable. It is clear that Equation (5) provides a proper generalization of Equation (4), and we carry out an algorithm with a numerical example to calculate the general solution of Equation (5). As a special case of Equation (5), we also obtain the solvability conditions and the general solution for the two-sided Sylvester-type matrix equation
A 11 Y 1 B 11 + A 22 Y 2 B 22 + A 33 Y 3 B 33 = T 1 .
To the best of our knowledge, so far, there has been little information on the solvability conditions and an expression of the general solution to Equation (6) by using generalized inverses.
As usual, we use A to denote the conjugate transpose of A. Recall that a quaternion matrix A, for η { i , j , k } , is said to be η -Hermitian if A = A η , where A η = η A η  [33]. For more properties and information on η -quaternion matrices, we refer to [33]. We know that η -Hermitian matrices have some applications in linear modeling and statistics of quaternion random signals [1,33]. As an application of Equation (5), we establish some necessary and sufficient conditions for the quaternion matrix equation
A 1 X 1 + ( A 1 X 1 ) η + A 2 Y 1 A 2 η + A 3 Y 2 A 3 η + A 4 Y 3 A 4 η = B
to be consistent. Moreover, we derive a formula of the general solution to Equation (7) where B = B η , Y i = Y i η ( i = 1 , 3 ¯ ) over H .
The rest of this paper is organized as follows. In Section 2, we review some definitions and lemmas. In Section 3, we establish some necessary and sufficient conditions for Equation (5) to have a solution. In addition, we give an expression of its general solution to Equation (5) when it is solvable. In Section 4, as an application of Equation (5), we consider some solvability conditions and the general solution to Equation (7), where Y i = Y i η ( i = 1 , 3 ¯ ) . Finally, we give a brief conclusion to the paper in Section 5.

2. Preliminaries

Throughout this paper, H m × n stands for the space of all m × n matrices over H . The symbol r ( A ) denotes the rank of A. I and 0 represent an identity matrix and a zero matrix of appropriate sizes, respectively. In general, A stands for the Moore–Penrose inverse of A H l × k , which is defined as the solution of A Y A = A , Y A Y = Y , ( A Y ) = A Y and ( Y A ) = Y A . Moreover, L A = I A A and R A = I A A represent two projectors along A.
The following lemma is due to Marsaglia and Styan [34], which can be generalized to  H .
Lemma 1
([34]). Let A H m × n ,   B H m × k ,   C H l × n ,   D H j × k and E H l × i be given. Then, we have the following rank equality:
r A B L D R E C 0 = r A B 0 C 0 E 0 D 0 r ( D ) r ( E ) .
Lemma 2
([35]). Let A H m × n be given. Then,
( 1 ) ( A η ) = ( A ) η , ( A η ) = ( A ) η . ( 2 ) r ( A ) = r ( A η ) = r ( A η ) = r ( A η A η ) = r ( A η A η ) . ( 3 ) ( L A ) η = η ( L A ) η = ( L A ) η = L A = R A η . ( 4 ) ( R A ) η = η ( R A ) η = ( R A ) η = R A = L A η . ( 5 ) ( A A ) η = ( A ) η A η = ( A A ) η = A η ( A ) η . ( 6 ) ( A A ) η = A η ( A ) η = ( A A ) η = ( A ) η A η .
Lemma 3
([16]). Let A i i , B i i and C i ( i = 1 , 2 ) be given matrices with suitable sizes over H . A 1 = A 22 L A 11 , T = R B 11 B 22 , F = B 22 L T , G = R A 1 A 22 . Then, the following statements are equivalent:
( 1 ) The system
A 11 X 1 B 11 = C 1 , A 22 X 1 B 22 = C 2
has a solution.
( 2 )
A i i A i i C i B i i B i i = C i ( i = 1 , 2 )
and
G ( A 22 C 2 B 22 A 11 C 1 B 11 ) F = 0 .
( 3 )
r ( A i i   C i )   =   r ( A i i ) , r C i B i i = r ( B i i ) ( i = 1 , 2 ) , r A 11 C 1 0 A 22 0 C 2 0 B 11 B 22 = r A 11 A 22 + r ( B 11 , B 22 ) .
Lemma 4
([13]). Let A 1 , B 1 and C 1 be given matrices with suitable sizes. Then, the Sylvester-type Equation (2) is solvable if and only if
R A 1 C 1 L B 1 = 0 .
In this case, the general solution to Equation (2) can be expressed as
X = A 1 C 1 A 1 U 1 B 1 + L A 1 U 2 , Y = R A 1 C 1 B 1 + A 1 A 1 U 1 + U 3 R B 1 ,
where U 1 , U 2 , and U 3 are arbitrary matrices with appropriate sizes.
Lemma 5
([31]). Let A 1 , B 1 , C 3 , D 3 , C 4 , D 4 and E 1 be given matrices over H . Put
A = R A 1 C 3 , B = D 3 L B 1 , C = R A 1 C 4 , D = D 4 L B 1 , E = R A 1 E 1 L B 1 , M = R A C , N = D L B , S = C L M .
Then, the following statements are equivalent:
( 1 ) Equation (4) has a solution.
( 2 )
R M R A E = 0 , E L B L N = 0 , R A E L D = 0 , R E L B = 0 .
( 3 )
r E 1 C 4 C 3 A 1 B 1 0 0 0 = r ( B 1 ) + r ( C 4 , C 3 , A 1 ) , r E 1 A 1 D 3 0 D 4 0 B 1 0 = r D 3 D 4 B 1 + r ( A 1 ) , r E 1 C 3 A 1 D 4 0 0 B 1 0 0 = r ( A 1 , C 3 ) + r D 4 B 1 , r E 1 C 4 A 1 D 3 0 0 B 1 0 0 = r ( A 1 C 4 ) + r D 3 B 1 .
In this case, the general solution to Equation (4) can be expressed as
X 1 = A 1 ( E 1 C 3 X 3 D 3 C 4 X 4 D 4 ) A 1 T 7 B 1 + L A 1 T 6 , X 2 = R A 1 ( E 1 C 3 X 3 D 3 C 4 X 4 D 4 ) B 1 + A 1 A 1 T 7 + T 8 R B 1 , X 3 = A E B A C M E B A S C E N D B A S T 2 R N D B + L A T 4 + T 5 R B , X 4 = M E D + S S C E N + L M L S T 1 + L M T 2 R N + T 3 R D ,
where T 1 , . . . , T 8 are arbitrary matrices with appropriate sizes over H .

3. Some Solvability Conditions and a Formula of the General Solution

In this section, we establish the solvability conditions and a formula of the general solution to Equation (5). We begin with the following lemma, which is used to reach the main results of this paper.
Lemma 6.
Let A 11 , B 11 , C 11 , and D 11 be given matrices with suitable sizes over H , A 11 L A 22 = 0 and R B 11 B 22 = 0 . Set
A 1 = A 22 L A 11 , C 11 = C 2 A 22 A 11 C 1 B 11 B 22 .
Then, the following statements are equivalent:
( 1 ) The system (8) is consistent.
( 2 )
R A i i C i = 0 , C i L B i i = 0 ( i = 1 , 2 ) , R A 1 C 11 = 0 .
( 3 )
A i i A i i C i B i i B i i = C i ( i = 1 , 2 ) , C 1 B 11 B 22 = A 11 A 22 C 2 .
( 4 )
r ( A i i , C i ) = r ( A i i ) , r B i i C i = r ( B i i ) ( i = 1 , 2 ) , r C 1 0 A 11 0 C 2 A 22 B 11 B 22 0 = r A 22 + r ( B 11 ) .
In this case, the general solution to system (8) can be expressed as
X 1 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 + L A 22 V 1 + V 2 R B 11 + L A 11 V 3 R B 22 ,
where V 1 , V 2 , and V 3 are arbitrary matrices with appropriate sizes over H .
Proof .
( 1 ) ( 2 ) It follows from Lemma 3 that
G ( A 22 C 2 B 22 A 11 C 1 B 11 ) F = 0 R A 1 ( A 1 + A 22 A 11 A 11 ) A 22 C 2 B 22 A 11 C 1 B 11 B 22 = 0 R A 1 A 22 A 11 A 11 A 22 C 2 B 22 B 22 A 22 A 11 C 1 B 11 B 22 = 0 R A 1 A 22 A 11 A 11 A 22 A 22 A 22 C 2 B 22 B 22 A 22 A 11 C 1 B 11 B 22 = 0 R A 1 ( A 22 A 1 ) A 22 A 22 A 22 C 2 B 22 B 22 A 22 A 11 C 1 B 11 B 22 = 0 R A 1 C 2 A 22 A 11 C 1 B 11 B 22 = 0 R A 1 C 11 = 0 ,
where G and F are given in Lemma 3.
( 1 ) ( 3 ) If the system (8) has a solution, then there exists a solution X 0 such that
A 11 X 0 B 11 = C 1 , A 22 X 0 B 22 = C 2 .
It is easy to show that
R A i i C i = 0 , C i L B i i = 0 ( i = 1 , 2 ) .
Thus, A i i A i i C i B i i B i i = C i ( i = 1 , 2 ) . It follows from R B 11 B 22 = 0 , A 11 L A 22 = 0 that
C 1 B 11 B 22 = A 11 X 0 B 11 B 11 B 22 = A 11 X 0 B 22 = A 11 A 22 A 22 X 0 B 22 = A 11 A 22 C 2 .
( 3 ) ( 2 ) Since A 22 A 1 = A 22 A 11 A 11 and C 1 B 11 B 22 = A 11 A 22 C 2 , we have that
R A 1 C 11 = R A 1 C 2 R A 1 A 22 A 11 C 1 B 11 B 22 = R A 1 C 2 R A 1 A 22 A 11 A 11 A 22 C 2 = R A 1 C 2 R A 1 ( A 22 A 1 ) A 22 C 2 = R A 1 C 2 R A 1 A 22 A 22 C 2 = 0 .
( 2 ) ( 4 ) It follows from R B 11 B 22 = 0 and A 11 L A 22 = 0 that
r ( B 22 , B 11 ) = r ( B 11 ) , A 11 A 22 = r ( A 22 ) .
By Lemma 1,
R A i i C i = 0 r ( R A i i C i ) = 0 r ( A i i , C i ) = r ( A i i ) ( i = 1 , 2 ) , C i L B i i = 0 r ( C i L B i i ) = 0 r B i i C i = r ( B i i ) ( i = 1 , 2 ) , R A 1 C 11 = 0 r ( R A 1 C 11 ) = 0 r ( C 11 , A 1 ) = r ( A 1 ) r C 11 A 22 L A 11 R B 11 B 22 0 = r ( A 22 L A 11 ) + r ( R B 11 B 22 ) r C 2 A 22 A 11 C 1 B 11 B 22 A 22 0 B 22 0 B 11 0 A 11 0 = r A 11 A 22 + r ( B 11 , B 22 ) r C 1 0 A 11 0 C 2 A 22 B 11 B 22 0 = r A 11 A 22 + r ( B 11 , B 22 ) = r ( A 22 ) + r ( B 11 ) .
We now prove that X 1 in (10) is the general solution of the system (8). We prove it in two steps. We show that X 1 is a solution of system (8) in Step 1. In Step 2, if the system (8) is consistent, then the general solution to system (8) can be expressed as (10).
Step 1. In this step, we show that X 1 is a solution of system (8). Substituting X 1 in (10) into the system (8) yields
A 11 X 1 B 11 = A 11 X 0 B 11 , A 22 X 1 B 22 = A 22 X 0 B 22 ,
where X 0 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 . Since R A 11 C 1 = 0 and C 1 L B 11 = 0 , we have that
A 11 X 0 B 11 = A 11 A 11 C 1 B 11 + L A 11 A 1 A 22 A 22 C 11 B 22 B 11 = A 11 A 11 C 1 B 11 B 11 + A 11 L A 11 A 1 C 11 R A 22 C 11 B 22 B 11 = A 11 A 11 C 1 B 11 B 11 = R A 11 C 1 B 11 B 11 C 1 L B 11 + C 1 = C 1 .
By
R B 11 B 22 = 0 , R A 22 C 22 = 0 , C 2 L B 22 = 0 and C 1 B 11 B 22 = A 11 A 22 C 2 ,
we have that
A 22 X 0 B 22 = A 22 ( A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 ) B 22 = A 22 A 11 C 1 B 11 B 22 + A 22 A 22 C 2 B 22 B 22 A 22 A 11 A 11 A 22 C 2 B 22 B 22 = C 2 + A 22 A 11 C 1 B 11 B 22 A 22 A 11 C 1 B 11 B 22 = C 2 .
Thus, A 11 X 1 B 11 = C 1 , A 22 X 1 B 22 = C 2 . X 1 is a solution of system (8).
Step 2. In this step, we show that the general solution to the system (8) can be expressed as (10). It is sufficient to show that for an arbitrary solution, say, X 01 of (8), X 01 can be expressed in form (10). Put
V 1 = X 01 B 22 B 22 , V 2 = X 01 , V 3 = X 01 B 11 B 11 .
It follows from B 22 = B 11 B 11 B 22 and A 11 = A 11 A 22 A 22 that
X 1 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 + L A 22 V 1 + V 2 R B 11 + L A 11 V 3 R B 22 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 + L A 22 X 01 B 22 B 22 + X 01 R B 11 + L A 11 X 01 B 11 B 11 R B 22 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 + X 01 B 22 B 22 A 22 A 22 X 01 B 22 B 22 + X 01 X 01 B 11 B 11 + X 01 B 11 B 11 R B 22 A 11 A 11 X 01 B 11 B 11 R B 22 = A 11 C 1 B 11 + L A 11 A 22 C 2 B 22 X 01 R B 11 B 22 B 22 + X 01 A 22 A 22 X 01 B 22 B 22 A 11 A 11 X 01 B 11 B 11 + A 11 A 11 X 01 B 11 B 11 B 22 B 22 = X 01 + A 11 A 11 X 01 B 11 B 11 B 22 B 22 A 11 A 11 A 22 A 22 X 01 B 22 B 22 = X 01 + A 11 A 11 X 01 B 22 B 22 A 11 A 11 X 01 B 22 B 22 = X 01 .
Hence, X 01 can be expressed as (10). To sum up, (10) is the general solution of the system (8).    □
Now, we give the fundamental theorem of this paper.
Theorem 1.
Let A i , B i , and B ( i = 1 , 4 ¯ ) be given quaternion matrices with appropriate sizes over H . Set
R A 1 A 2 = A 11 , R A 1 A 3 = A 22 , R A 1 A 4 = A 33 , B 2 L B 1 = B 11 , B 22 L B 11 = N 1 , B 3 L B 1 = B 22 , B 4 L B 1 = B 33 , R A 11 A 22 = M 1 , S 1 = A 22 L M 1 , R A 1 B L B 1 = T 1 ,
C = R M 1 R A 11 , C 1 = C A 33 , C 2 = R A 11 A 33 , C 3 = R A 22 A 33 , C 4 = A 33 , D = L B 11 L N 1 , D 1 = B 33 , D 2 = B 33 L B 22 , D 3 = B 33 L B 11 , D 4 = B 33 D , E 1 = C T 1 , E 2 = R A 11 T 1 L B 22 , E 3 = R A 22 T 1 L B 11 , E 4 = T 1 D ,
C 11 = ( L C 2 , L C 4 ) , D 11 = R D 1 R D 3 , C 22 = L C 1 , D 22 = R D 2 , C 33 = L C 3 , D 33 = R D 4 , E 11 = R C 11 C 22 , E 22 = R C 11 C 33 , E 33 = D 22 L D 11 , E 44 = D 33 L D 11 , M = R E 11 E 22 , N = E 44 L E 33 , F = F 2 F 1 , E = R C 11 F L D 11 , S = E 22 L M ,
F 11 = C 2 L C 1 , G 1 = E 2 C 2 C 1 E 1 D 1 D 2 , F 22 = C 4 L C 3 , G 2 = E 4 C 4 C 3 E 3 D 3 D 4 , F 1 = C 1 E 1 D 1 + L C 1 C 2 E 2 D 2 , F 2 = C 3 E 3 D 3 + L C 3 C 4 E 4 D 4 .
Then, the following statements are equivalent:
( 1 ) Equation (5) is consistent.
( 2 )
R C i E i = 0 , E i L D i = 0 ( i = 1 , 4 ¯ ) , R E 11 E L E 44 = 0 .
( 3 )
r B A 2 A 3 A 4 A 1 B 1 0 0 0 0 = r ( B 1 ) + r ( A 2 , A 3 , A 4 , A 1 ) ,
r B A 2 A 4 A 1 B 3 0 0 0 B 1 0 0 0 = r ( A 2 , A 4 , A 1 ) + r B 3 B 1 ,
r B A 3 A 4 A 1 B 2 0 0 0 B 1 0 0 0 = r ( A 3 , A 4 , A 1 ) + r B 2 B 1 ,
r B A 4 A 1 B 2 0 0 B 3 0 0 B 1 0 0 = r B 2 B 3 B 1 + r ( A 4 , A 1 ) ,
r B A 2 A 3 A 1 B 4 0 0 0 B 1 0 0 0 = r ( A 2 , A 3 , A 1 ) + r B 4 B 1 ,
r B A 2 A 1 B 3 0 0 B 4 0 0 B 1 0 0 = r B 3 B 4 B 1 + r ( A 2 , A 1 ) ,
r B A 3 A 1 B 2 0 0 B 4 0 0 B 1 0 0 = r B 2 B 4 B 1 + r ( A 3 , A 1 ) ,
r B A 1 B 2 0 B 3 0 B 4 0 B 1 0 = r B 2 B 3 B 4 B 1 + r ( A 1 ) ,
r B A 2 A 1 0 0 0 A 4 B 3 0 0 0 0 0 0 B 1 0 0 0 0 0 0 0 0 0 B A 3 A 1 A 4 0 0 0 B 2 0 0 0 0 0 0 B 1 0 0 0 B 4 0 0 B 4 0 0 0
= r B 3 0 B 1 0 0 B 2 0 B 1 B 4 B 4 + r A 2 A 1 0 0 A 4 0 0 A 3 A 1 A 4 .
Proof .
( 1 ) ( 2 ) Equation (5) can be written as
A 1 X 1 + X 2 B 1 = B ( A 2 Y 1 B 2 + A 3 Y 2 B 3 + A 4 Y 3 B 4 ) .
Clearly, Equation (5) is solvable if and only if Equation (26) has a solution. By Lemma 4, Equation (26) is consistent if and only if there exist Y i ( i = 1 , 3 ¯ ) in Equation (26) such that
R A 1 B ( A 2 Y 1 B 2 + A 3 Y 2 B 3 + A 4 Y 3 B 4 ) L B 1 = 0 ,
i.e.,
A 11 Y 1 B 11 + A 22 Y 2 B 22 + A 33 Y 3 B 33 = T 1 ,
where A i i , B i i ( i = 1 , 3 ¯ ) , and T 1 are defined by (12). In addition, when Equation (26) has a solution, we get the following:
X 1 = A 1 ( B A 2 Y 1 B 2 A 3 Y 2 B 3 A 4 Y 3 B 4 ) A 1 U 1 B 1 + L A 1 U 2 , X 2 = R A 1 ( B A 2 Y 1 B 2 A 3 Y 2 B 3 A 4 Y 3 B 4 ) B 1 + A 1 A 1 U 1 + U 3 R B 1 ,
where U i ( i = 1 , 3 ¯ ) are any matrices with appropriate dimensions over H . Hence, Equation (26) has a solution if and only if there exist Y i ( i = 1 , 3 ¯ ) in Equation (26) such that Equation (28) is solvable. According to Equation (28), we have that
A 11 Y 1 B 11 + A 22 Y 2 B 22 = T 1 A 33 Y 3 B 33 .
Hence, Equation (28) is consistent if and only if Equation (29) is solvable. It follows from Lemma 5 that Equation (29) has a solution if and only if there exists Y 3 in Equation (29) such that
R M 1 R A 11 ( A 33 Y 3 B 33 T 1 ) = 0 , R A 11 ( T 1 A 33 Y 3 B 33 ) L B 22 = 0 , R A 22 ( T 1 A 33 Y 3 B 33 ) L B 11 = 0 , ( T 1 A 33 Y 3 B 33 ) L B 11 L N 1 = 0 ,
i.e.,
C 1 Y 3 D 1 = E 1 , C 2 Y 3 D 2 = E 2 , C 3 Y 3 D 3 = E 3 , C 4 Y 3 D 4 = E 4 ,
where C i , D i , E i ( i = 1 , 4 ¯ ) are defined by (13). When Equation (29) is solvable, we have that
Y 1 = A 11 T B 11 A 11 A 22 M 1 T B 11 A 11 S 1 A 22 T N 1 B 22 B 11 A 11 S 1 U 4 R N 1 B 22 B 11 + L A 11 U 5 + U 6 R B 11 , Y 2 = M 1 T B 22 + S 1 S 1 A 22 T N 1 + L M 1 L S 1 U 7 + U 8 R B 22 + L M 1 U 4 R N 1 ,
where A i i , B i i ( i = 1 , 3 ¯ ) , M 1 , N 1 , S 1 , T 1 are defined by (12), T = T 1 A 33 Y 3 B 33 and U j ( j = 4 , 8 ¯ ) are any matrices with the appropriate dimensions over H .
It is easy to infer that
C 1 L C 2 = 0 , R D 1 D 2 = 0 , C 3 L C 4 = 0 , R D 3 D 4 = 0 .
Thus, according to Lemma 6, we have that the system (31) is consistent if and only if
R C i E i = 0 , E i L D i = 0 ( i = 1 , 2 , 3 , 4 ) , R F 11 G 1 = 0 , R F 22 G 2 = 0 .
In this case, the general solution to system (31) can be expressed as
Y 3 = F 1 + L C 2 V 1 + V 2 R D 1 + L C 1 V 3 R D 2 ,
Y 3 = F 2 L C 4 W 1 W 2 R D 3 L C 3 W 3 R D 4 ,
where F 1 , F 2 are defined by (15) and V i , W i ( i = 1 , 3 ¯ ) are any matrices with the appropriate dimensions over H . Thus, system (31) has a solution if and only if (33) holds and there exist V i , W i ( i = 1 , 3 ¯ ) such that (34) equals to (35), namely
( L C 2 , L C 4 ) V 1 W 1 + ( V 2 , W 2 ) R D 1 R D 3 + L C 1 V 3 R D 2 + L C 3 W 3 R D 4 = F ,
i.e.,
C 11 V 1 W 1 + ( V 2 , W 2 ) D 11 + C 22 V 3 D 22 + C 33 W 3 D 33 = F ,
where F, C i i and D i i ( i = 1 , 3 ¯ ) are defined by (14). It follows from Lemma 5 that Equation (36) has a solution if and only if
R M R E 11 E = 0 , E L E 33 L N = 0 , R E 11 E L E 44 = 0 , R E 22 E L E 33 = 0 .
In this case, the general solution to Equation (36) can be expressed as
V 1 = ( I m , 0 ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 , W 1 = ( 0 , I m ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 ,
W 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 C 11 U 11 + U 21 R D 11 0 I n , V 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 ( C 11 ) U 11 + U 21 R D 11 I n 0 , V 3 = E 11 F E 33 E 11 E 22 M F E 33 E 11 S E 22 F N E 44 E 33 E 11 S U 31 R N E 44 E 33 + L E 11 U 32 + U 33 R E 33 , W 3 = M F E 44 + S S E 22 F N + L M L S U 41 + L M U 31 R N U 42 R E 44 ,
where U 11 , U 12 , U 21 , U 31 , U 32 , U 33 , U 41 , and U 42 are any matrices with the suitable dimensions over H . M, E, N, S, C 11 , D 11 , and E i i ( i = 1 , 4 ¯ ) are defined by (14), m is the column number of A 4 and n is the row number of B 4 . We summarize up that (28) has a solution if and only if (33) and (37) hold. Hence, Equation (5) is solvable if and only if (33) and (37) hold.
In fact, R C 2 E 2 = 0 , E 1 L D 1 = 0 R F 11 G 1 = 0 ; R C 4 E 4 = 0 , E 3 L D 3 = 0 R F 22 G 2 = 0 ; R C 3 E 3 = 0 , E 1 L D 1 = 0 R M R E 11 E = 0 ; R C 4 E 4 = 0 , E 1 L D 1 = 0 E L E 33 L N = 0 ; R C 4 E 4 = 0 , E 2 L D 2 = 0 R E 22 E L E 33 = 0 . The specific proof is as follows.
Firstly, we prove that R C 2 E 2 = 0 , E 1 L D 1 = 0 R F 11 G 1 = 0 ; R C 4 E 4 = 0 , E 3 L D 3 = 0 R F 22 G 2 = 0 . It follows from Lemma 1 and elementary transformations that
R C 1 E 1 = 0 r ( E 1 , C 1 ) = r ( C 1 ) = r ( C T 1 , C A 33 ) = r ( C A 33 ) r ( T 1 , A 33 , A 11 , A 22 ) = r ( A 33 , A 11 , A 22 ) ,
R C 2 E 2 = 0 r ( E 2 , C 2 ) = r ( C 2 ) r T 1 A 33 A 11 B 22 0 0 = r ( A 33 , A 11 ) + r ( B 22 ) ,
R C 3 E 3 = 0 r ( E 3 , C 3 ) = r ( C 3 ) r T 1 A 33 A 22 B 11 0 0 = r ( A 33 , A 22 ) + r ( B 11 ) ,
R C 4 E 4 = 0 r ( E 4 , C 4 ) = r ( C 4 ) r T 1 A 33 B 11 0 B 22 0 = r ( A 33 ) + r B 11 B 22 ,
E 1 L D 1 = 0 r E 1 D 1 r T 1 A 11 A 22 B 33 0 0 = r ( A 11 , A 22 ) + r ( B 33 ) ,
E 2 L D 2 = 0 r E 2 D 2 = r ( D 2 ) r T 1 A 11 B 33 0 B 22 0 = r B 33 B 22 + r ( A 11 ) ,
E 3 L D 3 = 0 r E 3 D 3 = r ( D 3 ) r T 1 A 22 B 33 0 B 11 0 = r B 33 B 11 + r ( A 22 ) , .
E 4 L D 4 = 0 r E 4 D 4 = r ( D 4 ) r T 1 B 33 B 11 B 22 = r B 33 B 11 B 22 .
It follows from Lemma 6 and (32) that R F 11 G 1 = 0 and R F 22 G 2 = 0 are equivalent to
r E 1 0 C 1 0 E 2 C 2 D 1 D 2 0 = r C 1 C 2 + r ( D 1 , D 2 ) ,
r E 3 0 C 3 0 E 4 C 4 D 3 D 4 0 = r C 3 C 4 + r ( D 3 , D 4 ) .
According to Lemma 1, we have that
( 46 ) r T 1 0 0 A 11 A 22 0 0 T 1 A 33 0 0 A 11 B 33 0 0 0 0 0 0 B 22 0 0 0 0 = r 0 A 11 A 22 0 A 33 0 0 A 11 + r B 33 0 0 B 22 r T 1 A 11 A 22 0 0 0 B 33 0 0 0 0 0 0 0 0 T 1 A 33 A 11 0 0 0 B 22 0 0 = r A 11 A 22 0 0 0 0 A 33 A 11 + r B 33 0 0 B 22 .
Thus, it follows from (48) that (46) holds when (39) and (42) hold. Similarly, if (41) and (44) hold, then (47) holds.
Secondly, we prove that R C 3 E 3 = 0 , E 1 L D 1 = 0 R M R E 11 E = 0 ; R C 4 E 4 = 0 , E 1 L D 1 = 0 E L E 33 L N = 0 ; R C 4 E 4 = 0 , E 2 L D 2 = 0 R E 22 E L E 33 = 0 . According to Lemma 5 and (32), we have that (37) are equivalent to
r F L C 1 L C 3 R D 1 0 0 R D 3 0 0 = r ( L C 1 , L C 3 ) + r R D 1 R D 3 ,
r F L C 2 L C 4 R D 2 0 0 R D 4 0 0 = r ( L C 2 , L C 4 ) + r R D 2 R D 4 ,
r F L C 1 L C 4 R D 1 0 0 R D 4 0 0 = r ( L C 1 , L C 4 ) + r R D 1 R D 4 ,
r F L C 2 L C 3 R D 2 0 0 R D 3 0 0 = r ( L C 2 , L C 3 ) + r R D 2 R D 3 ,
respectively. By Lemma 1, we have that
( 49 ) r F I I 0 0 I 0 0 D 1 0 I 0 0 0 D 3 0 C 1 0 0 0 0 0 C 3 0 0 = r I D 1 0 I 0 D 3 + r I I C 1 0 0 C 3 r E 1 0 C 1 0 E 3 C 3 D 1 D 3 0 = r C 1 C 3 + r ( D 1 , D 3 ) .
Similarly, we can show that (50)–(52) are equivalent to
r E 1 0 C 1 0 E 4 C 4 D 1 D 4 0 = r C 1 C 4 + r ( D 1 , D 4 ) ,
r E 2 0 C 2 0 E 3 C 3 D 2 D 3 0 = r C 2 C 3 + r ( D 2 , D 3 ) ,
r E 2 0 C 2 0 E 4 C 4 D 2 D 4 0 = r C 2 C 4 + r ( D 2 , D 4 ) .
Substituting C i , D i , and E i ( i = 1 , 3 ) in (13) into the rank equality (53) and by Lemma 1, we have that
( 53 ) r T 1 0 0 A 11 A 22 0 0 T 1 A 33 0 0 A 22 B 33 0 0 0 0 0 0 B 11 0 0 0 0 = r 0 A 11 A 22 0 A 33 0 0 A 22 + r B 33 0 0 B 11 r T 1 A 11 A 22 0 0 0 B 33 0 0 0 0 0 0 0 0 T 1 A 33 A 22 0 0 0 B 11 0 0 = r A 11 A 22 0 0 0 0 A 33 A 22 + r B 33 0 0 B 11 .
Hence, it follows from (40) and (42) that (57) holds. Similarly, we can prove that when (41), (42) hold and (41), (43) hold, we can get that (54) and (56) hold, respectively. Thus, Equation (28) has a solution if and only if (16) holds. That is to say, Equation (5) has a solution if and only if (16) holds.
( 2 ) ( 3 ) We prove the equivalence in two parts. In the first part, we want to show that (38) to (45) are equivalent to (17) to (24), respectively. In the second part, we want to show that (55) is equivalent to (25).
Part 1. We want to show that (38) to (45) are equivalent to (17) to (24), respectively. It follows from Lemma 1 and elementary operations to (38) that
( 38 ) r ( R A 1 B L B 11 , R A 1 A 4 , R A 1 A 2 , R A 1 A 3 ) = r ( R A 1 A 4 , R A 1 A 2 , R A 1 A 3 ) r B A 4 A 2 A 3 A 1 B 1 0 0 0 0 = r ( A 4 , A 2 , A 3 , A 1 ) + r ( B 1 ) ( 17 ) .
Similarly, we can show that (39) to (41) are equivalent to (18) to (20), respectively. Now, we turn to prove that (42) is equivalent to (19). It follows from the Lemma 1 and elementary transformations that
( 42 ) r R A 1 B L B 1 R A 1 A 2 R A 1 A 3 B 4 L B 1 0 0 = r ( R A 1 A 2 , R A 1 A 3 ) + r ( B 4 L B 1 ) r B A 2 A 3 A 1 B 4 0 0 0 B 1 0 0 0 = r ( A 2 , A 3 , A 1 ) + r B 4 B 1 ( 21 ) .
Similarly, we can show that (43) to (45) are equivalent to (22) to (24). Hence, (38) to (45) are equivalent to (17) to (24), respectively.
Part 2. We want to show that ( 55 ) ( 25 ) . It follows from Lemma 1 and elementary operations to (55) that
( 55 ) r R A 11 T 1 L B 22 0 R A 11 A 33 0 R A 22 T 1 L B 11 R A 22 A 33 B 33 L B 22 B 33 L B 11 0 = r R A 11 A 33 R A 22 A 33 + r ( B 33 L B 22 , B 33 L B 11 ) r T 1 0 A 11 0 A 33 0 T 1 0 A 22 A 33 B 22 0 0 0 0 0 B 11 0 0 0 B 33 B 33 0 0 0 = r B 22 0 0 B 11 B 33 B 33 + r A 11 0 A 33 0 A 22 A 33
r B 3 0 0 B 2 B 4 B 4 B 1 0 0 B 1 + r A 2 0 A 4 A 1 0 0 A 3 A 4 0 A 1 = r B 0 A 2 0 A 4 A 1 0 0 B 0 A 3 A 4 0 A 1 B 3 0 0 0 0 0 0 0 B 2 0 0 0 0 0 B 4 B 4 0 0 0 0 0 B 1 0 0 0 0 0 0 0 B 1 0 0 0 0 0 ( 25 ) .
Hence, (38) to (45) and (55) are equivalent to (17) to (25), respectively.    □
Next, we give the formula of general solution to matrix Equation (5) by using Moore–Penrose. According to Theorem 1, we get the following theorem:
Theorem 2.
Let matrix Equation (5) be solvable. Then, the general solution to matrix Equation (5) can be expressed as
X 1 = A 1 ( B A 2 Y 1 B 2 A 3 Y 2 B 3 A 4 Y 3 B 4 ) A 1 U 1 B 1 + L A 1 U 2 , X 2 = R A 1 ( B A 2 Y 1 B 2 A 3 Y 2 B 3 A 4 Y 3 B 4 ) B 1 + A 1 A 1 U 1 + U 3 R B 1 , Y 1 = A 11 T B 11 A 11 A 22 M 1 T B 11 A 11 S 1 A 22 T N 1 B 22 B 11 A 11 S 1 U 4 R N 1 B 22 B 11 + L A 11 U 5 + U 6 R B 11 , Y 2 = M 1 T B 22 + S 1 S 1 A 22 T N 1 + L M 1 L S 1 U 7 + U 8 R B 22 + L M 1 U 4 R N 1 , Y 3 = F 1 + L C 2 V 1 + V 2 R D 1 + L C 1 V 3 R D 2 , o r Y 3 = F 2 L C 4 W 1 W 2 R D 3 L C 3 W 3 R D 4 ,
where T = T 1 A 33 Y 3 B 33 , U i ( i = 1 , 8 ¯ ) are arbitrary matrices with appropriate sizes over H ,
V 1 = ( I m , 0 ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 , W 1 = ( 0 , I m ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 , W 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 C 11 U 11 + U 21 R D 11 0 I n , V 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 C 11 U 11 + U 21 R D 11 I n 0 , V 3 = E 11 F E 33 E 11 E 22 M F E 33 E 11 S E 22 F N E 44 E 33 E 11 S U 31 R N E 44 E 33 + L E 11 U 32 + U 33 R E 33 , W 3 = M F E 44 + S S E 22 F N + L M L S U 41 + L M U 31 R N U 42 R E 44 ,
U 11 , U 12 , U 21 , U 31 , U 32 , U 33 , U 41 , and U 42 are arbitrary matrices with appropriate sizes over H , m is the column number of A 4 and n is the row number of B 4 .

Algorithm with a Numerical Example

In this section, we give Algorithm 1 with a numerical example to illustrate the main results.
Algorithm 1: Algorithm for computing the general solution of Equation (5)
(1)   Input the quaternion matrices A i , B i ( i = 1 , 4 ¯ ) and B with conformable shapes.
(2)   Compute all matrices given by (12)–(15).
(3)   Check equalities in (16) or (17)–(25). If not, it returns inconsistent.
(4)   Else, compute X i Y j ( i = 1 , 2 ¯ , j = 1 , 3 ¯ ) .
Example 1.
Consider the matrix Equation (5). Put
A 1 = i 0 0 0 , B 1 = 0 i 0 0 , A 2 = 0 0 i 0 , B 2 = 0 0 0 i , A 3 = 1 i 0 0 , B 3 = 1 j 0 0 , A 4 = 1 k 0 0 , B 4 = 0 0 k i , B = 3 i i 1 0 j .
Computation directly yields
r B A 2 A 3 A 4 A 1 B 1 0 0 0 0 = r ( B 1 ) + r ( A 2 , A 3 , A 4 , A 1 ) = 3 , r B A 2 A 4 A 1 B 3 0 0 0 B 1 0 0 0 = r ( A 2 , A 4 , A 1 ) + r B 3 B 1 = 4 , r B A 3 A 4 A 1 B 2 0 0 0 B 1 0 0 0 = r ( A 3 , A 4 , A 1 ) + r B 2 B 1 = 4 , r B A 4 A 1 B 2 0 0 B 3 0 0 B 1 0 0 = r B 2 B 3 B 1 + r ( A 4 , A 1 ) = 3 , r B A 2 A 3 A 1 B 4 0 0 0 B 1 0 0 0 = r ( A 2 , A 3 , A 1 ) + r B 4 B 1 = 4 , r B A 2 A 1 B 3 0 0 B 4 0 0 B 1 0 0 = r B 3 B 4 B 1 + r ( A 2 , A 1 ) = 3 , r B A 3 A 1 B 2 0 0 B 4 0 0 B 1 0 0 = r B 2 B 4 B 1 + r ( A 3 , A 1 ) = 3 , r B A 1 B 2 0 B 3 0 B 4 0 B 1 0 = r B 2 B 3 B 4 B 1 + r ( A 1 ) = 3 , r B A 2 A 1 0 0 0 A 4 B 3 0 0 0 0 0 0 B 1 0 0 0 0 0 0 0 0 0 B A 3 A 1 A 4 0 0 0 B 2 0 0 0 0 0 0 B 1 0 0 0 B 4 0 0 B 4 0 0 0 = r B 3 0 B 1 0 0 B 2 0 B 1 B 4 B 4 + r A 2 A 1 0 0 A 4 0 0 A 3 A 1 A 4 = 7 .
All rank equalities in (17) to (25) hold. Hence, according to Theorem 1, Equation (5) has a solution. Moreover, by Theorem 2, we have that
X 1 = 1 i 0 0 , X 2 = 1 j 0 0 , Y 1 = i j 0 0 , Y 2 = i k 0 0 , Y 3 = i j k 0 .
Remark 1.
Chu et al. gave potential applications of the maximal and minimal ranks in the discipline of control theory (e.g., [36,37,38]). We may consider the rank bounds of the general solution of Equation (5).

4. The General Solution to Equation with η -Hermicity

In this section, as an application of (5), we establish some necessary and sufficient conditions for quaternion matrix Equation (7) to have a solution and derive a formula of its general solution involving η -Hermicity.
Theorem 3.
Let A i ( i = 1 , 4 ¯ ) and B be given matrices with suitable sizes over H , B = B η . Set
R A 1 A 2 = A 11 , R A 1 A 3 = A 22 , R A 1 A 4 = A 33 , R A 11 A 22 = M 1 , S 1 = A 22 L M 1 , R A 1 B ( R A 1 ) η = T 1 , C = R M 1 R A 11 , C 1 = C A 33 , C 2 = R A 11 A 33 , C 3 = R A 22 A 33 , C 4 = A 33 , E 1 = C T 1 , E 2 = R A 11 T 1 ( R A 22 ) η , E 3 = R A 22 T 1 ( R A 11 ) η , E 4 = T 1 C η , C 11 = ( L C 2 , L C 4 ) , C 22 = L C 1 , C 33 = L C 3 , E 11 = R C 11 C 22 , E 22 = R C 11 C 33 , M = R E 11 E 22 , N = ( R E 22 E 11 ) η , F = F 2 F 1 , E = R C 11 F ( R C 11 ) η , S = E 22 L M , F 11 = C 2 L C 1 , G 1 = E 2 C 2 C 1 E 1 ( C 4 η ) C 3 η , F 22 = C 4 L C 3 , G 2 = E 4 C 4 C 3 E 3 ( C 2 η ) C 1 η , F 1 = C 1 E 1 ( C 4 η ) + L C 1 C 2 E 2 ( C 3 η ) , F 2 = C 3 E 3 ( C 2 η ) + L C 3 C 4 E 4 ( C 1 η ) .
Then, the following statements are equivalent:
( 1 ) Equation (7) is consistent.
( 2 ) R C i E i = 0 ( i = 1 , 4 ¯ ) , R E 22 E ( R E 22 ) η = 0 .
( 3 )
r B A 2 A 3 A 4 A 1 A 1 η 0 0 0 0 = r ( A 1 ) + r ( A 2 , A 3 , A 4 , A 1 ) , r B A 2 A 3 A 1 A 4 η 0 0 0 A 1 η 0 0 0 = r ( A 2 , A 3 , A 1 ) + r ( A 4 , A 1 ) , r B A 2 A 4 A 1 A 3 η 0 0 0 A 1 η 0 0 0 = r ( A 2 , A 4 , A 1 ) + r ( A 3 , A 1 ) , r B A 3 A 4 A 1 A 2 η 0 0 0 A 1 η 0 0 0 = r ( A 3 , A 4 , A 1 ) + r ( A 2 , A 1 ) , r B 0 A 2 0 A 4 A 1 0 0 B 0 A 3 A 4 0 A 1 A 3 η 0 0 0 0 0 0 0 A 2 η 0 0 0 0 0 A 4 η A 4 η 0 0 0 0 0 A 1 η 0 0 0 0 0 0 0 A 1 η 0 0 0 0 0 = 2 r A 2 0 A 4 A 1 0 0 A 3 A 4 0 A 1 .
In this case, the general solution to Equation (7) can be expressed as
X 1 = X 1 ^ + ( X 2 ^ ) η 2 , Y 1 = Y 1 ^ + ( Y 1 ^ ) η 2 , Y 2 = Y 2 ^ + ( Y 2 ^ ) η 2 , Y 3 = Y 3 ^ + ( Y 3 ^ ) η 2 , X 1 ^ = A 1 ( C 1 A 2 Y 1 A 2 η A 3 Y 2 A 3 η A 4 Y 3 A 4 η ) + L A 1 U 2 , X 2 ^ = R A 1 ( C 1 A 2 Y 1 A 2 η A 3 Y 2 A 3 η A 4 Y 3 A 4 η ) ( A 1 ) η + A 1 A 1 U 1 + U 3 R A 1 η , Y 1 ^ = A 11 T ( A 11 ) η A 11 A 22 M 1 T ( A 11 ) η A 11 U 4 A 22 T ( M 1 ) η ( A 22 ) η + L A 11 U 5 + U 6 R A 11 η , Y 2 ^ = M 1 T ( A 22 ) η + S 1 S 1 A 22 T ( M 1 ) η + L M 1 L S 1 U 7 + U 8 R A 22 η + L M 1 U 4 R M 1 η , Y 3 ^ = F 1 + L C 2 V 1 + V 2 R C 4 η + L C 1 V 3 R C 3 η , o r Y 3 ^ = F 2 L C 4 W 1 W 2 R C 2 η L C 3 W 3 R C 1 η ,
where T = T 1 A 33 Y 3 ( A 33 ) η ,
V 1 = ( I m , 0 ) C 11 ( F C 22 V 3 C 33 η C 33 W 3 C 22 η ) C 11 U 11 C 11 η + L C 11 U 12 , W 1 = ( 0 , I m ) C 11 ( F C 22 V 3 C 33 η C 33 W 3 C 22 η ) C 11 U 11 C 11 η + L C 11 U 12 , W 2 = R C 11 ( F C 22 V 3 C 33 η C 33 W 3 C 22 η ) ( C 11 η ) + C 11 C 11 U 11 + U 21 L C 11 η 0 I n , V 2 = R C 11 ( F C 22 V 3 C 33 η C 33 W 3 C 22 η ) ( C 11 η ) + C 11 C 11 U 11 + U 21 L C 11 η I n 0 , V 3 = E 11 F ( E 22 η ) E 11 E 22 M F ( E 22 η ) E 11 S E 22 F N E 11 η ( E 22 η ) E 11 S U 31 R N E 11 η ( E 22 η ) + L E 11 U 32 + U 33 L E 22 η , W 3 = M F ( E 11 η ) + S S E 22 F N + L M L S U 41 + L M U 31 R N U 42 L E 11 η ,
U 11 , U 12 , U 21 , U 31 , U 32 , U 33 , U 41 , and U 42 are any matrices with suitable dimensions over H .
Proof. 
It is easy to show that (7) has a solution if and only if the following matrix equation has a solution:
A 1 X 1 ^ + X 2 ^ A 1 η + A 2 Y 1 ^ A 2 η + A 3 Y 2 ^ A 3 η + A 4 Y 3 ^ A 4 η = B .
If (7) has a solution, say, ( X 1 , Y 1 , Y 2 , Y 3 ) , then
( X 1 ^ , X 2 ^ , Y 1 ^ , Y 2 ^ , Y 3 ^ ) : = ( X 1 , X 1 η , Y 1 , Y 2 , Y 3 )
is a solution of (58). Conversely, if (58) has a solution, say
( X 1 ^ , X 2 ^ , Y 1 ^ , Y 2 ^ , Y 3 ^ ) .
It is easy to show that (7) has a solution
( X 1 , Y 1 , Y 2 , Y 3 ) : = X 1 ^ + ( X 2 ^ ) η 2 , Y 1 ^ + ( Y 1 ^ ) η 2 , Y 2 ^ + ( Y 2 ^ ) η 2 , Y 3 ^ + ( Y 3 ^ ) η 2 .
Letting A 1 and B 1 vanish in Theorem 1, it yields to the following result.
Corollary 1.
Let A i i , B i i ( i = 1 , 3 ¯ ) , and T 1 be given matrices with appropriate sizes over H . Set
M 1 = R A 11 A 22 , N 1 = B 22 L B 11 , S 1 = A 22 L M 1 , C = R M 1 R A 11 , C 1 = C A 33 , C 2 = R A 11 A 33 , C 3 = R A 22 A 33 , C 4 = A 33 , D = L B 11 L N 1 , D 1 = B 33 , D 2 = B 33 L B 22 , D 3 = B 33 L B 11 , D 4 = B 33 D , E 1 = C T 1 , E 2 = R A 11 T 1 L B 22 , E 3 = R A 22 T 1 L B 11 , E 4 = T 1 D , C 11 = ( L C 2 , L C 4 ) , D 11 = R D 1 R D 3 , C 22 = L C 1 , D 22 = R D 2 , C 33 = L C 3 , D 33 = R D 4 , E 11 = R C 11 C 22 , E 22 = R C 11 C 33 , E 33 = D 22 L D 11 , E 44 = D 33 L D 11 , M = R E 11 E 22 , N = E 44 L E 33 , F = F 2 F 1 , E = R C 11 F L D 11 , S = E 22 L M , F 11 = C 2 L C 1 , G 1 = E 2 C 2 C 1 E 1 D 1 D 2 , F 22 = C 4 L C 3 , G 2 = E 4 C 4 C 3 E 3 D 3 D 4 , F 1 = C 1 E 1 D 1 + L C 1 C 2 E 2 D 2 , F 2 = C 3 E 3 D 3 + L C 3 C 4 E 4 D 4 .
Then, the following statements are equivalent:
( 1 ) Equation (6) is consistent.
( 2 ) R C i E i = 0 , E i L D i = 0 ( i = 1 , 4 ¯ ) , R E 22 E L E 33 = 0 .
( 3 )
r ( T 1 , A 11 , A 22 , A 33 ) = r ( A 11 , A 22 , A 33 ) , r T 1 B 11 B 22 B 33 = r B 11 B 22 B 33 , r T 1 A 11 A 22 B 33 0 0 = r ( A 11 , A 22 ) + r ( B 33 ) , r T 1 A 11 A 33 B 22 0 0 = r ( A 11 , A 33 ) + r ( B 22 ) , r T 1 A 33 A 22 B 11 0 0 = r ( A 33 , A 22 ) + r ( B 11 ) , r T 1 A 33 B 11 0 B 22 0 = r B 11 B 22 + r ( A 33 ) , r T 1 0 A 11 0 A 33 0 T 1 0 A 22 A 33 B 22 0 0 0 0 0 B 11 0 0 0 B 33 B 33 0 0 0 = r B 22 0 0 B 11 B 33 B 33 + r A 11 0 A 33 0 A 22 A 33 , r T 1 A 22 B 11 0 B 33 0 = r B 11 B 33 + r ( A 22 ) , r T 1 A 11 B 33 0 B 22 0 = r B 33 B 22 + r ( A 11 ) .
In this case, the general solution to Equation (6) can be expressed as
Y 1 = A 11 T B 11 A 11 A 22 M 1 T B 11 A 11 S 1 A 22 T N 1 B 22 B 11 A 11 S 1 U 4 R N 1 B 22 B 11 + L A 11 U 5 + U 6 R B 11 , Y 2 = M 1 T B 22 + S 1 S 1 A 22 T N 1 + L M 1 L S 1 U 7 + U 8 R B 22 + L M 1 U 4 R N 1 , Y 3 = F 1 + L C 2 V 1 + V 2 R D 1 + L C 1 V 3 R D 2 , o r Y 3 = F 2 L C 4 W 1 W 2 R D 3 L C 3 W 3 R D 4 ,
where T = T 1 A 33 Y 3 B 33 , U i ( i = 1 , . . . , 8 ) are any matrices with suitable dimensions over H ,
V 1 = ( I m , 0 ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 , W 1 = ( 0 , I m ) C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) C 11 U 11 D 11 + L C 11 U 12 ,
W 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 C 11 U 11 + U 21 R D 11 0 I n , V 2 = R C 11 ( F C 22 V 3 D 22 C 33 W 3 D 33 ) D 11 + C 11 C 11 U 11 + U 21 R D 11 I n 0 , V 3 = E 11 F E 33 E 11 E 22 M F E 33 E 11 S E 22 F N E 44 E 33 E 11 S U 31 R N E 44 E 33 + L E 11 U 32 + U 33 R E 33 , W 3 = M F E 44 + S S E 22 F N + L M L S U 41 + L M U 31 R N U 42 R E 44 ,
U 11 , U 12 , U 21 , U 31 , U 32 , U 33 , U 41 , and U 42 are any matrices with suitable dimensions over H .

5. Conclusions

We have established the solvability conditions and an exact formula of a general solution to quaternion matrix Equation (5). As an application of Equation (5), we also have established some necessary and sufficient conditions for Equation (7) to have a solution and derived a formula of its general solution involving η -Hermicity. The quaternion matrix Equation (5) plays a key role in studying the solvability conditions and general solutions of other types of matrix equations. For example, we can use the results on Equation (5) to investigate the solvability conditions and the general solution of the following system of quaternion matrix equations
A 2 Y 1 = C 2 , Y 1 B 2 = D 2 , A 3 Y 2 = C 3 , Y 2 B 3 = D 3 , A 4 Y 3 = C 4 , Y 3 B 4 = D 4 , G 1 Y 1 H 1 + G 2 Y 2 H 2 + G 3 Y 3 H 3 = G
where Y 1 , Y 2 and Y 3 are unknown quaternion matrices and the others are given.
It is worth mentioning that the main results of (5) are available over not only R and C but also any division ring. Moreover, inspired by [39], we can investigate Equation (5) in tensor form.

Author Contributions

All authors have equal contributions in conceptualization, formal analysis, investigation, methodology, software, validation, writing an original draft, writing a review, and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the grants from the National Natural Science Foundation of China (1197294) and (12171369).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank Natural Science Foundation of China under grant No. 11971294 and 12171369.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Took, C.C.; Mandic, D.P. Augmented second-order statistics of quaternion random signals. Signal Process. 2011, 91, 214–224. [Google Scholar] [CrossRef] [Green Version]
  2. Qi, L.; Luo, Z.Y.; Wang, Q.W.; Zhang, X.Z. Quaternion matrix optimization: Motivation and analysis. J. Optim. Theory Appl. 2021, 193, 621–648. [Google Scholar] [CrossRef]
  3. Jia, Z.G.; Ling, S.T.; Zhao, M.X. Color two-dimensional principal component analysis for face recognition based on quaternion model. In Proceedings of the International Conference on Intelligent Computing: Intelligent Computing Theories and Application, Liverpool, UK, 7–10 August 2017; pp. 177–189. [Google Scholar]
  4. Wang, Q.W.; Wang, X.X. Arnoldi method for large quaternion right eigenvalue problem. J. Sci. Comput. 2020, 82, 58. [Google Scholar] [CrossRef]
  5. Shahzad, A.; Jones, B.L.; Kerrigan, E.C.; Constantinides, G.A. An efficient algorithm for the solution of a coupled sylvester equation appearing in descriptor systems. Automatica 2011, 47, 24–48. [Google Scholar] [CrossRef] [Green Version]
  6. Syrmos, V.L.; Lewis, F.L. Coupled and constrained Sylvester equations in system design. Circuits Syst. Signal Process. 1994, 13, 66–94. [Google Scholar] [CrossRef]
  7. Li, R.C. A bound on the solution to a structured Sylvester equation with an application to relative perturbation theory. SIAM J. Matrix Anal. Appl. 1999, 21, 44–45. [Google Scholar] [CrossRef] [Green Version]
  8. Barraud, A.; Lesecq, S.; Christov, N. From sensitivity analysis to random floating point arithmetics-application to Sylvester equations. In Proceedings of the International Conference on Numerical Analysis and Its Applications, Rousse, Bulgaria, 11–15 June 2000; Volume 1998, p. 351. [Google Scholar]
  9. Saberi, A.; Stoorvogel, A.A.; Sannuti, P. Control of Linear Systems with Regulation and Input Constraints; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  10. Darouach, M. Solution to Sylvester equation associated to linear descriptor systems. Syst. Control Lett. 2006, 55, 835–838. [Google Scholar] [CrossRef] [Green Version]
  11. Castelan, E.B.; da Silva, G.V. On the solution of a Sylvester matrix equation appearing in descriptor systems control theory. Syst. Control Lett. 2005, 54, 109–117. [Google Scholar] [CrossRef]
  12. Roth, W.E. The equations AXYB = C and AXXB = C in matrices. Proc. Am. Math. Soc. 1952, 3, 392–396. [Google Scholar] [CrossRef]
  13. Baksalary, J.K.; Kala, R. The matrix equations AXYB = C. Linear Algebra Appl. 1979, 25, 41–43. [Google Scholar] [CrossRef] [Green Version]
  14. Baksalary, J.K.; Kala, R. The matrix equations AXB + CYD = E. Linear Algebra Appl. 1979, 30, 141–147. [Google Scholar] [CrossRef] [Green Version]
  15. Özgüler, A.B. The matrix equation AXB + CYD = E over a principal ideal domain. SIAM J. Matrix Anal. Appl. 1991, 12, 581–591. [Google Scholar] [CrossRef]
  16. Wang, Q.W. A system of matrix equations and a linear matrix equation over arbitrary regular ring with identity. Linear Algebra Appl. 2004, 384, 43–54. [Google Scholar] [CrossRef]
  17. Liu, X. The η-anti-Hermitian solution to some classic matrix equations. Appl. Math. Comput. 2018, 320, 264–270. [Google Scholar] [CrossRef]
  18. Liu, X.; Zhang, Y. Consistency of split quaternion matrix equations AX − XB = CY + D and XAXB = CY + D. Adv. Appl. Clifford Algebras 2019, 29, 64. [Google Scholar] [CrossRef]
  19. Liu, X.; Song, G.J.; Zhang, Y. Determinantal representations of the solutions to systems of generalized sylvester equations. Adv. Appl. Clifford Algebras 2019, 30, 12. [Google Scholar] [CrossRef]
  20. Mehany, M.S.; Wang, Q.W. Three symmetrical systems of coupled Sylvester-like quaternion matrix equations. Symmetry 2022, 14, 550. [Google Scholar] [CrossRef]
  21. Jiang, J.; Li, N. An iterative algorithm for the generalized reflexive solution group of a system of quaternion matrix equations. Symmetry 2022, 14, 776. [Google Scholar] [CrossRef]
  22. Liu, L.S.; Wang, Q.W.; Chen, J.F.; Xie, Y.Z. An exact solution to a quaternion matrix equation with an application. Symmetry 2022, 14, 375. [Google Scholar] [CrossRef]
  23. Wang, Q.W.; Rehman, A.; He, Z.H.; Zhang, Y. Constrained generalized Sylvester matrix equations. Automatica 2016, 69, 60–64. [Google Scholar] [CrossRef]
  24. Wang, Q.W.; He, Z.H.; Zhang, Y. Constrained two-sided coupled Sylvester-type quaternion matrix equations. Automatica 2019, 101, 207–213. [Google Scholar] [CrossRef]
  25. Rodman, L. Topics in Quaternion Linear Algebra; Princeton University Press: Princeton, NJ, USA, 2014. [Google Scholar]
  26. Jia, Z.G.; Ng, M.K.; Song, G.J. Robust quaternion matrix completion with applications to image inpainting. Numer. Linear Algebra Appl. 2019, 26, e2245. [Google Scholar] [CrossRef]
  27. Yu, S.W.; He, Z.H.; Qi, T.C.; Wang, X.X. The equivalence canonical form of five quaternion matrices with applications to imaging and Sylvester-type equations. J. Comput. Appl. Math. 2021, 393, 113494. [Google Scholar] [CrossRef]
  28. Yuan, S.F.; Wang, Q.W.; Duan, X.F. On solutions of the quaternion matrix equation AX = B and their applications in color image restoration. J. Comput. Appl. Math. 2013, 221, 10–20. [Google Scholar] [CrossRef]
  29. He, Z.H. Some new results on a system of Sylvester-type quaternion matrix equations. Linear Multilinear Algebra 2021, 69, 3069–3091. [Google Scholar] [CrossRef]
  30. Kyrchei, I. Cramers rules for Sylvester quaternion matrix equation and its special cases. Adv. Appl. Clifford Algebras 2018, 28, 90. [Google Scholar] [CrossRef]
  31. Wang, Q.W.; He, Z.H. Some matrix equations with applications. Linear Multilinear Algebra 2012, 60, 1327–1353. [Google Scholar] [CrossRef]
  32. Zhang, Y.; Wang, R.H. The exact solution of a system of quaternion matrix equations involving η-Hermicity. Appl. Math. Comput. 2013, 222, 201–209. [Google Scholar] [CrossRef]
  33. Took, C.C.; Mandic, D.P.; Zhang, F.Z. On the unitary diagonalization of a special class of quaternion matrices. Appl. Math. Lett. 2011, 24, 1806–1809. [Google Scholar] [CrossRef] [Green Version]
  34. Marsaglia, G.; Styan, G.P. Equalities and inequalities for ranks of matrices. Linear Multilinear Algebra 1974, 2, 269–292. [Google Scholar] [CrossRef]
  35. He, Z.H.; Wang, Q.W. A real quaternion matrix equation with applications. Linear Multilinear Algebra 2013, 61, 725–740. [Google Scholar] [CrossRef]
  36. Chu, D.L.; Chan, H.; Ho, D.W.C. Regularization of singular systems by derivative and proportional output feedback. SIAM J. Math. Anal. 1998, 19, 21–38. [Google Scholar] [CrossRef]
  37. Chu, D.L.; De Lathauwer, L.; Moor, B. On the computation of restricted singular value decomposition via cosine-sine decomposition. SIAM J. Math. Anal. 2000, 22, 550–601. [Google Scholar] [CrossRef]
  38. Chu, D.L.; Hung, Y.S.; Woerdeman, H.J. Inertia and rank characterizations of some matrix expressions. SIAM J. Math. Anal. 2009, 31, 1187–1226. [Google Scholar] [CrossRef] [Green Version]
  39. Li, T.; Wang, Q.W.; Zhang, X.F. A Modified conjugate residual method and nearest kronecker product preconditioner for the generalized coupled Sylvester tensor equations. Mathematics 2022, 10, 1730. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Liu, L.-S.; Wang, Q.-W.; Mehany , M.S. A Sylvester-Type Matrix Equation over the Hamilton Quaternions with an Application. Mathematics 2022, 10, 1758. https://doi.org/10.3390/math10101758

AMA Style

Liu L-S, Wang Q-W, Mehany  MS. A Sylvester-Type Matrix Equation over the Hamilton Quaternions with an Application. Mathematics. 2022; 10(10):1758. https://doi.org/10.3390/math10101758

Chicago/Turabian Style

Liu, Long-Sheng, Qing-Wen Wang, and Mahmoud Saad Mehany . 2022. "A Sylvester-Type Matrix Equation over the Hamilton Quaternions with an Application" Mathematics 10, no. 10: 1758. https://doi.org/10.3390/math10101758

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop