Preprint
Article

The Hermitian Solution to a New System of Commutative Quaternion Matrix Equations

Altmetrics

Downloads

99

Views

22

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

21 February 2024

Posted:

22 February 2024

You are already at the latest version

Alerts
Abstract
This paper considers the Hermitian solutions of a new system of commutative quaternion matrix equations, we establish both necessary and sufficient conditions for the existence of solutions. Furthermore, we derive an explicit general expression when it is solvable. To illustrate our main findings, we present two numerical algorithms and examples in this paper.
Keywords: 
Subject: Physical Sciences  -   Mathematical Physics

MSC:  15A09; 15A24; 15B33; 15B57

1. Introduction

In 1843, Hamilton introduced the concept of real quaternions which are defined by [1]
H = { q = q 0 + q 1 i + q 2 j + q 3 k : i 2 = j 2 = k 2 = 1 , i j k = 1 , q 0 , q 1 , q 2 , q 3 R } ,
which is a four-dimensional noncommutative associative algebra over real number field. Quaternions have been used in many areas such as statistic of quaternion random signals [2], color image processing [3] and face recognition [4]. Real quaternions are an extension of the complex numbers. However, the multiplication of the real quaternions is non-commutative which causes many difficulties.
A commutative quaternion, which was introduced by Segre [5] in 1892, is in the form of q = q 0 + q 1 i + q 2 j + q 3 k , where q 0 , q 1 , q 2 , q 3 belong to the real number field, and the imaginary identities i , j , k satisfy i 2 = k 2 = 1 , j 2 = 1 , i j k = 1 , i j = j i = k , j k = k j = i , k i = i k = j . The most prominent feature of a commutative quaternion is the satisfaction of the multiplication commutative rule. The collection of commutative quaternions comprises a four-dimensional Clifford algebra, forming a ring. Within this set, we can find noteworthy attributes such as nontrivial idempotents, zero divisors, and nilpotent elements. There are many applications of the commutative quaternion algebra in Hopfield neural netwoks, digital signal, image processing [6,7,8,9,10], and so on. Commutative quaternions are also extensively researched. K o ¨ sal et al. [11] gave complex representations of commutative quaternion matrices and discussed several related properties. In [12], K o ¨ sal et al. proposed the real representation of a commutative quaternion matrix, and derived some explicit expression of the solutions of the commutative quaternion matrix equations X A X ¯ ¯ B = C , X A X ˜ ¯ B = C and X A X ¯ ˜ B = C , which are called the Kalman-Yakubovich-conjugate matrix equations, by means of real representation of a commutative quaternion matrix. Based on this, K o ¨ sal et al. [13] gave an expression of the general solution to the matrix equation A X = B over the commutative quaternion ring.
Hermitian matrix has drawn a lot of attentions due to its great importance. In [14], Yu et al. studied Hermitian solutions to the generalizaed quaternion matrix equation A X B + C X * D = E through the real representation method. Yuan et al. [15] discussed Hermitian solutions to the split quaternion matrix equation A X B + C X D = E by using the complex representation method. In  [24], Kyrchei obtained the determinantal representation formulas of η -( η -skew)-Hermitian solutions to the quaternion matrix equations A X = B and A X A η * = B . As far as we know that the Sylvester matrix equations have a large number of applications in different fields. For example, the Sylvester matrix equation A 1 X + X B 1 = C 1 and the Sylvester-like matrix equation A 1 X + Y B 1 = C 1 have been applied in singular system control [16], perturbation theory [17], sensitivity analysis [18] and control theory [19]. Wang et al. [20,21] considered the system of coupled Sylvester-like quaternion matrix equations. In [22], Wang et al. derived solvability conditions and expressions of the general solution to the system of two-sides coupled Sylvester-like quaternion matrix equations. Kyrchei [23] gave the determinantal representation formulas of solutions to the generalized Sylvester quaternion matrix equation A 1 X 1 B 1 + A 2 X 2 B 2 = C .
Motivated by keeping interests in Hermitian solutions and applications of the system of commutative quaternion matrix equations, we in this paper intend to investigate the solvability conditions and the Hermitian solutions to the following system of commutative quaternion matrix equations
A 1 X = C 1 , Y B 1 = D 1 , A 2 Z = C 2 , Z B 2 = D 2 , A 3 W = C 3 , W B 3 = D 3 , A 4 W B 4 = C 4 , A 5 X + Y B 5 + A 6 Z B 6 + A 7 W B 7 = C 5 ,
where X , Y , Z , W are unknown Hermitian commutative quaternion matrices.
This paper is organized as follows. In Section 2, we review some useful properties and the structures of vec ( A X B ) over the commutative quaternion algebra when X is a Hermitian commutative quaternion matrix. In Section 3, we derive some practical necessary and sufficient conditions for the existence of Hermitian solutions to the system (1) over H c , and the numerical examples are given in Section 4.

2. Preliminaries

Throughout this paper, let R m × n , SR m × n , ASR m × n , C m × n , H c , H c n , H c m × n be the set of all m × n real matrices, the set of all n × n real symmetric matrices, the set of all n × n real anti-symmetric matrices, the set of all m × n complex matrices, the set of commutative quaternions, the set of n dimensional commutative quaternion column vectors, and the set of all m × n commutative quaternion matrices, respectively. The symbol r ( A ) denotes the rank of A. Let the symbols I , O , A T , A stand for the identity matrix, the zero matrix with appropriate size, the transpose of A, and the Moore-Penrose inverse of a matrix A, respectively. A ¯ and A H denote the conjugate matrix, the conjugate transpose matrix of A, respectively. We call A H c n × n is a Hermitian matrix if A H = A , and denote it by A HH c n × n , where HH c n × n is the set of all Hermitian commutative quaternion matrices with the size of n × n .
For any A H c m × n , A can be uniquely expressed as A = A 0 + A 1 i + A 2 j + A 3 k , where A 0 , A 1 , A 2 , A 3 R m × n . It can also be uniquely expressed as A = C 1 + C 2 j , where C 1 = A 0 + A 1 i , C 2 = A 2 + A 3 i C m × n .
Proposition 1.
 [11]The complex representation matrix for commutative quaternion q = d 1 + d 2 j , d 1 = q 0 + q 1 i , d 2 = q 2 + q 3 i is denoted as
g ( q ) = d 1 d 2 d 2 d 1 C 2 × 2 .
Similarly, for any given A = A 1 + A 2 j H c m × n , the complex representation matrix of A is
G ( A ) = A 1 A 2 A 2 A 1 C 2 m × 2 n .
Obviously, G ( A ) is uniquely determined by A. It is straightforward to confirm that the following statements are valid.
Proposition 2.
 [11]If A , B H c n × n , then
(a)
A = B if and only if G ( A ) = G ( B ) ,
(b)
G ( A + B ) = G ( A ) + G ( B ) ,
(c)
G ( I n ) = I 2 n ,
(d)
G ( A B ) = G ( A ) G ( B ) .
Suppose A = ( a i j ) H c m × n and B = ( b i j ) H c s × t , the Kronecker product of A and B is defined as A B = ( a i j B ) H c m s × n t . Considering commutative quaternion matrices A , B , C , D , E with appropriate dimensions, along with the real number p, we establish
( p A ) B = A ( p B ) = p ( A B ) , ( A , B , C ) D = ( A D , B D , C D ) , A B C D E = A E B E C E D E .
The vec-operator of A = ( a i j ) H c m × n is defined as
vec ( A ) = ( a 1 , a 2 , , a n ) T , a j = ( a 1 j , a 2 j , , a m j ) , j = 1 , 2 , , n .
To investigate the Hermitian solutions of a system of matrix equations (1) within the framework of the commutative quaternion algebra, we need to review some certain definitions and fundamental properties.
Assume that A = A 1 + A 2 j H c m × n , A 1 , A 2 C m × n , then we have
A 1 + A 2 j = A Φ A = ( A 1 , A 2 ) ,
where the symbol ≅ represents an equivalence relation. For a given matrix A = ( a i j ) C m × n , the corresponding Frobenius norm is defined as follows:
| | A | | = i = 1 m j = 1 n a i j 2 , a i j 2 = Re a i j 2 + Im a i j 2 .
According to the previously mentioned definition of Frobenius norm for complex matrices, we can define the Frobenius norm for commutative quaternion matrix A = A 1 + A 2 j H c m × n as follows:
A ´ = Re A 1 2 + Im A 1 2 + Re A 2 2 + Im A 2 2 ,
where A ´ = Re ( A 1 ) Im ( A 1 ) Re ( A 2 ) Im ( A 2 ) , then we have
| | Φ A | | = | | A ´ | | = | | vec Φ A | | .
Theorem 1.
 [28]Let p R , A , B H c m × n and C H c n × s . Then
(a)
A = B if and only if Φ A = Φ B ,
(b)
Φ A + B = Φ A + Φ B , Φ p A = p Φ A ,
(c)
( A C ) T = C T A T ,
(d)
( A C ) 1 = C 1 A 1 , if the matrices A , C and A C are invertible,
(e)
Φ A C = Φ A G ( C ) .
For the purpose of deriving the Hermitian solutions of the system (1), we introduce some relevant definitions and conclusions.
Definition 1.
 [15]For the matrix A = a i j H c n × n , set a 1 = a 11 , 2 a 21 , , 2 a n 1 , a 2 = a 22 , 2 a 32 , , 2 a n 2 , , a n 1 = a ( n 1 ) ( n 1 ) , 2 a n ( n 1 ) , a n = a n n , and denote by vec S ( A ) the following vector:
vec S ( A ) = a 1 , a 2 , , a n 1 , a n T H c ( n ( n + 1 ) ) / 2 .
Definition 2.
 [15]For the matrix B = b i j H c n × n , set b 1 = b 21 , b 31 , , b n 1 , b 2 = b 32 , b 42 , , b n 2 , , b n 2 = b ( n 1 ) ( n 2 ) , b n ( n 2 ) , b n 1 = b n ( n 1 ) , and denote by vec A ( B ) the following vector:
vec A ( B ) = 2 b 1 , b 2 , , b n 2 , b n 1 T H c ( n ( n 1 ) ) / 2 .
Proposition 3.
 [25]Suppose that X R n × n , then
(1)
X SR n × n vec ( X ) = K S vec S ( X ) ,
where the matrix K S R n 2 × ( n ( n + 1 ) / 2 ) is of the following form:
K S = 1 2 2 e 1 e 2 e n 1 e n 0 0 0 0 0 0 0 e 1 0 0 2 e 2 e 3 e n 0 0 0 0 0 0 0 0 e 2 0 0 0 0 0 0 e 1 0 0 0 0 2 e n 1 e n 0 0 0 0 e 1 0 0 e 2 0 e n 1 2 e n ,
and e i is the ith column of the identity matrix of order n.
(2)
X ASR n × n vec ( X ) = K A vec A ( X ) ,
vec A ( X ) is described as (4) and the matrix K A R n 2 × ( n ( n 1 ) / 2 ) is of the following form:
K A = 1 2 e 2 e 3 e n 1 e n 0 0 0 0 e 1 0 0 0 e 3 e n 1 e n 0 0 e 1 0 0 e 2 0 0 0 0 0 0 0 0 e 1 0 0 e 2 0 e n 0 0 0 e 1 0 0 e 2 e n 1 ,
where e i is the column of the identity matrix of order n. It is apparent that K S T K S = I ( n ( n + 1 ) ) / 2 , K A T K A = I ( n ( n 1 ) ) / 2 .
Next, we explore the relationships between the Hermitian commutative quaternion matrices and symmetric matrices, as well as anti-symmetric matrices.
If X = X 1 + X 2 j HH c n × n , where X 1 , X 2 C n × n , we can get
X HH c n × n Re X 1 T = Re X 1 , Im X 1 T = Im X 1 , Re X 2 T = Re X 2 , Im X 2 T = Im X 2 .
Apparently, Re ( X 1 ) is symmetric, and Im ( X 1 ) , Re ( X 2 ) , Im ( X 2 ) are antisymmetric. By means of Proposition 3, we have the following:
Theorem 2.
 [29]Assume that X = X 1 + X 2 j HH c n × n , then we obtain
vec ( X 1 ) vec ( X 2 ) = M vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) ,
in which
M = K S i K A 0 0 0 0 K A i K A .
Theorem 3.
 [29]Suppose that A = A 1 + A 2 j H c m × n , B = B 1 + B 2 j H c s × t and X = X 1 + X 2 j H c n × s , where A 1 , A 2 C m × n , B 1 , B 2 C s × t and X 1 , X 2 C n × s . Then
vec ( Φ A X B ) = G ( B 1 T A 1 + B 2 T A 2 ) + ( B 2 T A 1 + B 1 T A 2 ) j vec ( X 1 ) vec ( X 2 ) .
Note that the results of vec ( Φ A X B ) is very important for figuring out the system of commutative quaternion matrix equations (1). Analogous methods and related conclusions can be found in [15]. By incorporating Theorem 3 with Theorem 2, we can gain the following outcome.
Theorem 4.
 [29]If A = A 1 + A 2 j H c m × n , X = X 1 + X 2 j HH c n × n , and B = B 1 + B 2 j H c n × s , where A i C m × n , X i C n × n , and B i C n × s ( i = 1 , 2 ) . Consequently,
vec ( Φ A X B ) = G ( B 1 T A 1 + B 2 T A 2 ) + ( B 2 T A 1 + B 1 T A 2 ) j M vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) .
Lemma 1.
 [26]The matrix equation A x = b , with A R m × n and b R m , has a solution x R n if and only if
A A b = b ,
In this case, it has the general solution
x = A b + ( I n A A ) y ,
where y R n is an arbitrary vector, and it has the unique solution x = A b for the case when r ( A ) = n . The solution of the matrix equation A x = b with the least norm is x = A b .

3. The Hermitian solution to the system

In accordance with the above discussion, now we focus on solving the system (1), for ease of description, We firstly state the following notations.
Let A 1 = A 11 + A 12 j , A 2 = A 21 + A 22 j , A 3 = A 31 + A 32 j H c m × n , C 1 , C 2 , C 3 H c m × n , B 1 = B 11 + B 12 j , B 2 = B 21 + B 22 j , B 3 = B 31 + B 32 j H c n × k , D 1 , D 2 , D 3 H c n × k , A 4 = A 41 + A 42 j H c s × n , B 4 = B 41 + B 42 j H c n × t , C 4 H c s × t , A 5 = A 51 + A 52 j , A 6 = A 61 + A 62 j , A 7 = A 71 + A 72 j , B 5 = B 51 + B 52 j , B 6 = B 61 + B 62 j , B 7 = B 71 + B 72 j H c n × n and C 5 H c n × n . We set
E = G [ ( I A 11 ) + ( I A 12 ) j ] 0 0 0 0 0 0 G [ ( I A 51 ) + ( I A 52 ) j ] M , F = 0 0 0 G [ ( B 11 T I ) + ( B 12 T I ) j ] 0 0 0 G [ ( B 51 T I ) + ( B 52 T I ) j ] M ,
P = 0 G [ ( I A 21 ) + ( I A 22 ) j ] 0 0 G [ ( B 21 T I ) + ( B 22 T I ) j ] 0 0 G [ ( B 61 T A 61 + B 62 T A 62 ) + ( B 62 T A 61 + B 61 T A 62 ) j ] M ,
Q = 0 0 G [ ( I A 31 ) + ( I A 32 ) j ] 0 0 G [ ( B 31 T I ) + ( B 32 T I ) j ] G [ ( B 41 T A 41 + B 42 T A 42 ) + ( B 42 T A 41 + B 41 T A 42 ) j ] G [ ( B 71 T A 71 + B 72 T A 72 ) + ( B 72 T A 71 + B 71 T A 72 ) j ] M ,
T = vec Φ C 1 vec Φ C 2 vec Φ C 3 vec Φ D 1 vec Φ D 2 vec Φ D 3 vec Φ C 4 vec Φ C 5 , T 1 = vec Re Φ C 1 vec Re Φ C 2 vec Re Φ C 3 vec Re Φ D 1 vec Re Φ D 2 vec Re Φ D 3 vec Re Φ C 4 vec Re Φ C 5 , T 2 = vec Im Φ C 1 vec Im Φ C 2 vec Im Φ C 3 vec Im Φ D 1 vec Im Φ D 2 vec Im Φ D 3 vec Im Φ C 4 vec Im Φ C 5 , ϵ = T 1 T 2 ,
W = K S 0 0 0 0 K A 0 0 0 0 K A 0 0 0 0 K A , W = W 0 0 0 0 W 0 0 0 0 W 0 0 0 0 W ,
vec ( X ) = vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) , vec ( Y ) = vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) ,
vec ( Z ) = vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) , vec ( W ) = vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) ,
and
E 1 = Re E , E 2 = Im E , F 1 = Re F , F 2 = Im F , P 1 = Re P , P 2 = Im P , Q 1 = Re Q , Q 2 = Im Q , U 1 = ( E 1 , F 1 , P 1 , Q 1 ) , U 2 = ( E 2 , F 2 , P 2 , Q 2 ) .
For further study the structure of Hermitian solution of the system of matrix equations (1), it is necessary to study the generalized inverse of matrix in the form of column blocks. The following notations are required. Let
d = 6 m n + 6 k n + 2 s t + 2 n 2 , H = I 8 n 2 4 n U 1 U 1 U 2 T , K = I d + I d H H U 2 U 1 U 1 T U 2 T I d H H 1 , J = H + I d H H K U 2 U 1 U 1 T I 8 n 2 4 n U 2 T H , R 11 = I d U 1 U 1 + U 1 T U 2 T K I d H H U 2 U 1 , R 12 = U 1 T U 2 T I d H H K , R 22 = I d H H K .
From the findings [27] presented above, it can be inferred that
U 1 U 2 = U 1 J T U 2 U 1 , J T , U 1 U 2 U 1 U 2 = U 1 U 1 + H H ,
and
I 2 d U 1 U 2 U 1 U 2 = R 11 R 12 R 12 T R 22 .
Taking into account the aforementioned results, we then turn our attention to the Hermitian solution of the system (1).
Theorem 5.
Let A 1 , A 2 , A 3 , C 1 , C 2 , C 3 H c m × n , B 1 , B 2 , B 3 , D 1 , D 2 , D 3 H c n × k , A 4 H c s × n , B 4 H c n × t , C 4 H c s × t , A 5 , A 6 , A 7 , B 5 , B 6 , B 7 H c n × n and C 5 H c n × n . U 1 , U 2 and ϵ are in the form of (Section 3) and (14), respectively. Then the system of commutative quaternion matrix equations (1) has a solution X , Y , Z , W HH c n × n if and only if
U 1 U 2 U 1 U 2 ϵ = ϵ .
In this case, the set of Hermitian solutions is as follows:
Λ = ( X , Y , Z , W ) | vec ( X ´ ) vec ( Y ´ ) vec ( Z ´ ) vec ( W ´ ) = W U 1 U 2 ϵ + W ( I 8 n 2 4 n U 1 U 2 U 1 U 2 ) y ,
where y is an arbitrary vector of appropriate order. Then the system (1) has a unique solution ( X , Y , Z , W ) Λ if and only if
r U 1 U 2 = 8 n 2 4 n .
If this condition satisfies, then
Λ = ( X , Y , Z , W ) | vec ( X ´ ) vec ( Y ´ ) vec ( Z ´ ) vec ( W ´ ) = W U 1 U 2 ϵ .
Proof. 
By virtue of Theorem 1 and Theorem 4 , we obtain
A 1 X = C 1 , Y B 1 = D 1 , A 2 Z = C 2 , Z B 2 = D 2 , A 3 W = C 3 , W B 3 = D 3 , A 4 W B 4 = C 4 , A 5 X + Y B 5 + A 6 Z B 6 + A 7 W B 7 = C 5 , Φ A 1 X = Φ C 1 , Φ Y B 1 = Φ D 1 , Φ A 2 Z = Φ C 2 , Φ Z B 2 = Φ D 2 , Φ A 3 W = Φ C 3 , Φ W B 3 = Φ D 3 , Φ A 4 W B 4 = Φ C 4 , Φ A 5 X + Φ Y B 5 + Φ A 6 Z B 6 + Φ A 7 W B 7 = Φ C 5 , E vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + F vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + P vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + Q vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) = T , ( Re E + i Im E ) vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + ( Re F + i Im F ) vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + ( Re P + i Im P ) vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) + ( Re Q + i Im Q ) vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) = T 1 + i T 2 ,
Re E Re F Re P Re Q Im E Im F Im P Im Q vec ( X ) vec ( Y ) vec ( Z ) vec ( W ) = ϵ , U 1 U 2 vec ( X ) vec ( Y ) vec ( Z ) vec ( W ) = ϵ .
By Lemma 2, we conclude that the system (1) has a Hermitian solution ( X , Y , Z , W ) Λ if and only if (17) satisfy, thus we have
vec ( X ) vec ( Y ) vec ( Z ) vec ( W ) = U 1 U 2 ϵ + I 8 n 2 4 n U 1 U 2 U 1 U 2 y .
On account of
vec ( X ´ ) = vec ( error ) vec ( error ) vec ( error ) vec ( error ) = K S 0 0 0 0 K A 0 0 0 0 K A 0 0 0 0 K A vec S ( error ) vec A ( error ) vec A ( error ) vec A ( error ) = W vec ( X ) ,
similarly, we can derive vec ( Y ´ ) = W vec ( Y ) , vec ( Z ´ ) = W vec ( Z ) and vec ( W ´ ) = W vec ( W ) , then we have
vec ( X ´ ) vec ( Y ´ ) vec ( Z ´ ) vec ( W ´ ) = W 0 0 0 0 W 0 0 0 0 W 0 0 0 0 W vec ( X ) vec ( Y ) vec ( Z ) vec ( W ) = W vec ( X ) vec ( Y ) vec ( Z ) vec ( W ) = W U 1 U 2 ϵ + W ( I 8 n 2 4 n U 1 U 2 U 1 U 2 ) y .
It means that (18) is true, if (17) holds, the system (1) has a unique solution ( X , Y , Z , W ) Λ if and only if
U 1 U 2 U 1 U 2 = I 8 n 2 4 n .
Thus by (19), we can obtain (20).    □
Corollary 1.
The system (1) has a solution X , Y , Z , W HH c if and only if
R 11 R 12 R 12 T R 22 ϵ = 0 .
Under this circumstances, the set of Hermitian solution of the system (1) can be represented as follows:
Λ = ( X , Y , Z , W ) | vec ( X ´ ) vec ( Y ´ ) vec ( Z ´ ) vec ( W ´ ) = W U 1 J T U 2 U 1 , J T ϵ + W ( I 8 n 2 4 n U 1 U 1 H H ) y ,
in which y is an arbitrary vector of appropriate size. Then the system (1) has an unique solution ( X , Y , Z , W ) Λ when (21) and (19) are obeyed. In this case,
Λ = ( X , Y , Z , W ) | vec ( X ´ ) vec ( Y ´ ) vec ( Z ´ ) vec ( W ´ ) = W U 1 J T U 2 U 1 , J T ϵ .

4. Numerical exemplification

In this section, on the basis of discussions in Section 2 and Section 3, we provide two algorithms for solving the system (1), and present two numerical examples to verify the feasibility of algorithms.
Preprints 99545 i001
Preprints 99545 i002
From the previous theoretical analysis, if the system (1) is solvable, then
θ 1 = U 1 U 2 U 1 U 2 ϵ ϵ , θ 2 = R 11 R 12 R 12 T R 22 ϵ
and
θ 3 = I 2 d U 1 U 2 U 1 U 2 R 11 R 12 R 12 T R 22
are small enough.
Example 1.
Let m = 6 , n = 4 , k = 5 , s = 2 , t = 3 , and
A 1 = A 11 + A 12 j , A 2 = A 21 + A 22 j , A 3 = A 31 + A 32 j , B 1 = B 11 + B 12 j , B 2 = B 21 + B 22 j , B 3 = B 31 + B 32 j , A 4 = A 41 + A 42 j , B 4 = B 41 + B 42 j , A 5 = A 51 + A 52 j , A 6 = A 61 + A 62 j , A 7 = A 71 + A 72 j , B 5 = B 51 + B 52 j , B 6 = B 61 + B 62 j , B 7 = B 71 + B 72 j , X ˙ = X ˙ 1 + X ˙ 2 j , Y ˙ = Y ˙ 1 + Y ˙ 2 j , Z ˙ = Z ˙ 1 + Z ˙ 2 j , W ˙ = W ˙ 1 + W ˙ 2 j , C 1 = A 1 X ˙ , C 2 = A 2 Z ˙ , C 3 = A 3 W ˙ , D 1 = Y ˙ B 1 , D 2 = Z ˙ B 2 , D 3 = W ˙ B 3 , C 4 = A 4 W ˙ B 4 , C 5 = A 5 X ˙ + Y ˙ B 5 + A 6 Z ˙ B 6 + A 7 W ˙ B 7 .
where
A 11 = I 4 O 2 × 4 , A 12 = O 6 × 4 , A 21 = O 6 × 4 , A 22 = I 4 O 2 × 4 , A 31 = O 6 × 4 , A 32 = O 2 × 4 I 4 i , A 41 = 1 0 i 0 0 1 0 i , A 42 = 0 0 1 0 0 0 0 1 , A 51 = I 4 i , A 52 = O 4 × 4 , A 61 = I 2 O 2 × 2 O 2 × 2 O 2 × 2 , A 62 = O 4 × 4 , A 71 = O 2 × 2 I 2 I 2 O 2 × 2 , A 72 = O 2 × 2 I 2 i O 2 × 2 O 2 × 2 , B 11 = O 4 × 5 , B 12 = I 4 O 4 × 1 , B 21 = I 4 i O 4 × 1 , B 22 = O 4 × 5 , B 31 = O 4 × 5 , B 32 = I 4 O 4 × 1 , B 41 = I 3 O 1 × 3 , B 42 = O 4 × 3 , B 51 = O 4 × 4 , B 52 = I 4 i , B 61 = I 4 , B 62 = O 4 × 4 , B 71 = O 2 × 2 I 2 I 2 O 2 × 2 , B 72 = O 4 × 4 , C 1 = 1 1 + i j 0 1 i 2 i k j i 0 0 0 k 0 1 0 0 0 0 0 0 0 0 , C 2 = j 0 0 k 0 j 0 1 0 0 j 0 k 1 0 j 0 0 0 0 0 0 0 0 ,
C 3 = 0 0 0 0 0 0 0 0 0 j i 0 j 0 k 0 i k 0 1 0 0 1 0 , D 1 = 0 0 k j 0 , D 2 = i 0 0 1 0 0 i 0 k 0 0 0 i 0 0 0 k j 0 0 k 0 1 + k 0 0 j 1 k 0 k 0 1 k 0 i 0 , D 3 = 0 k 1 0 0 k 0 j 0 0 1 j 0 i 0 0 0 i 0 0 , C 4 = 1 k 2 i + j j i 0 1 i + j , C 5 = 1 + i i + j + k i j 1 + i k i j k 1 + 2 i 1 + i + j 2 j j 2 k 1 i j 0 i + j 1 j i j i k .
We take
X ˙ 1 = 1 1 + i 0 0 1 i 2 i 0 0 i 0 0 0 0 0 1 , X ˙ 2 = 0 0 1 0 0 0 0 i 1 0 0 0 0 i 0 0 , Y ˙ 1 = 0 i 1 0 i 0 i 0 1 i 0 i 0 0 i 1 , Y ˙ 2 = 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 , Z ˙ 1 = 1 0 0 i 0 1 0 0 0 0 1 0 i 0 0 1 , Z ˙ 2 = 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 , W ˙ 1 = 0 i 0 0 i 0 1 0 0 1 0 0 0 0 0 0 , W ˙ 2 = 0 0 1 0 0 0 0 0 1 0 0 i 0 0 i 0 .
Let
Φ C 1 = Φ A 1 G ( X ˙ ) , Φ D 1 = Φ Y ˙ G B 1 , Φ C 2 = Φ A 2 G ( Z ˙ ) , Φ D 2 = Φ Z ˙ G B 2 , Φ C 3 = Φ A 3 G ( W ˙ ) , Φ D 3 = Φ W ˙ G B 3 , Φ C 4 = Φ A 4 G ( W ˙ ) G ( B 4 ) , Φ C 5 = Φ A 5 G ( X ˙ ) + Φ Y ˙ G ( B 5 ) + Φ A 6 G ( Z ˙ ) G ( B 6 ) + Φ A 7 G ( W ˙ ) G ( B 7 ) .
From MATLAB and Algorithm 2, we can obtain
r U 1 U 2 = 112 = 8 n 2 4 n , θ 2 = 7.0360 × 10 15 .
According to Algorithm 2, the system of matrix equations (1) has an unique solution ( X , Y , Z , W ) Λ , and we derive θ 1 = 1.7493 × 10 14 , θ 3 = 2.3111 × 10 14 and Φ ( X , Y , Z , W ) Φ ( X ˙ , Y ˙ , Z ˙ , W ˙ ) = 1.1628 × 10 14 .
Example 2.
Let m = 2 , n = 2 , k = 2 , s = 2 , t = 2 , and
A 1 = i 0 0 0 , A 2 = 1 i 0 0 , A 3 = 1 0 0 1 , A 4 = 1 0 0 1 , A 5 = 1 0 0 1 , A 6 = 0 1 1 0 , A 7 = 1 0 0 i , B 1 = i 0 0 0 , B 2 = 1 0 0 1 , B 3 = 1 0 0 0 , B 4 = 0 k 0 0 , B 5 = 0 j 0 0 , B 6 = O 2 , B 7 = 0 0 0 j , C 1 = i 1 + i 0 0 , C 2 = 0 i 0 0 , C 3 = 0 2 + i 2 i 0 , C 4 = 0 0 0 j + 2 k , C 5 = 1 1 + i + 3 j + k 1 i k , D 1 = i 0 1 0 , D 2 = 0 0 0 1 , D 3 = 0 0 2 i 0 ,
taking
X = 1 1 + i 1 i 0 , Y = 1 i i 1 , Z = 0 0 0 1 , W = 0 2 + i 2 i 0 .
From MATLAB and Algorithm 2, we obtain
r U 1 U 2 = 23 , θ 2 = 2.1412 × 10 15 .
According to Algorithm 2, the system (1) has infinite solutions ( X , Y , Z , W ) Λ . We can also obtain θ 1 = 3.3532 × 10 15 , θ 3 = 4.4730 × 10 15 . Then the optimization problem
min ( X , Y , Z , W ) Λ Φ ( X , Y , Z , W )
has an unique minimizer ( X ˜ , Y ˜ , Z ˜ , W ˜ ) , it can also be expressed as
vec ( X ˜ ´ ) vec ( Y ˜ ´ ) vec ( Z ˜ ´ ) vec ( W ˜ ´ ) = W U 1 J T U 2 U 1 , J T ϵ .
Therefore, we can get Φ ( X , Y , Z , W ) Φ ( X ˜ , Y ˜ , Z ˜ , W ˜ ) = 1 , and
X ˜ = 1 1 + i 1 i 0 , Y ˜ = 1 i i 0 , Z ˜ = 0 0 0 1 , W ˜ = 0 2 + i 2 i 0 .

5. Conclusion

In this paper, we have given the necessary and sufficient conditions for the existence of the Hermitian solutions to the system of commutative quaternion matrix equations (1), and also have established an expression of the Hermitian solutions to the system (1) when it is consistent. Some numerical algorithms and examples are provided to illustrate our results.

Author Contributions

Conceptualization, methodology, validation, writing—original draft—Y.Z.; funding acquisition—Q.-W. W.; discussion, writing-final draft—Q.-W.W., L.-M.X.,Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by grants from the National Natural Science Foundation of China (No. 12371023).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hamilton, W.R. Lectures on quaternions; Hodges and Smith: Dublin, 1853. [Google Scholar]
  2. Took, C.C.; Mandic, D.P. Augmented second-order statistics of quaternion random signals. Signal Process. 2011, 91, 214–224. [Google Scholar] [CrossRef]
  3. Miao, J.; Kou, K.I. Color image recovery using low-rank quaternion matrix completion algorithm. IEEE Trans. Signal Process. 2021, 31, 190–201. [Google Scholar] [CrossRef]
  4. Jia, Z.G.; Ling, S.T.; Zhao, M.X. Color two-dimensional principal component analysis for face recognition based on quaternion model. Intelligent Computing Theories and Application: 13th International Conference, ICIC 2017, Liverpool, UK, 7-10 August, 2017; Volume 10361, pp. 177–189. [Google Scholar]
  5. Segre, C. The real representations of complex elements and extension to bicomplex systems. Math Ann 1892, 40, 413–467. [Google Scholar] [CrossRef]
  6. Catoni, F. Commutative (segre’s) quaternion fields and relation with maxwell equations. Adv Appl Clifford Al 2008, 18, 9–28. [Google Scholar] [CrossRef]
  7. Pei, S.; Chang, J.H.; Ding, J.J. Commutative reduced biquaternions and their fourier transform for signal and image processing applications. IEEE Trans. Signal Process. 2004, 52, 2012–2031. [Google Scholar] [CrossRef]
  8. Isokawa, T.; Nishimura, H.; Matsui, N. Commutative quaternion and multistate hopfield neural networks. The 2010 International Joint Conference on Neural Networks (IJCNN), Barcelona, Spain, 14 October 2010; Volumn 2000, pp. 1–6. [Google Scholar]
  9. Kobayashi, M. Quaternionic hopfield neural networks with twin-multistate activation function. Neurocomputing 2017, 267, 304–310. [Google Scholar] [CrossRef]
  10. Guo, L.; Zhu, M.; Ge, X. Reduced biquaternion canonical transform, convolution and correlation. Signal Process 2011, 91, 2147–2153. [Google Scholar] [CrossRef]
  11. Kösal, H.; Tosun, M. Commutative quaternion matrices. Adv Appl Clifford Al 2014, 24, 769–779. [Google Scholar] [CrossRef]
  12. Kösal, H.; Akyiğit, M.; Tosun, M. Consimilarity of commutative quaternion matrices. Miskolc Math. Notes 2015, 16, 965–977. [Google Scholar] [CrossRef]
  13. Kösal, H.; Tosun, M. Universal similarity factorization equalities for commutative quaternions and their matrices. Linear Multilinear Algebra 2019, 67, 926–938. [Google Scholar] [CrossRef]
  14. Yu, C.E.; Liu, X.; Zhang, Y. The generalized quaternion matrix equation axb+cx*d=e. Math. Methods Appl. Sci. 2020, 43, 8506–8517. [Google Scholar] [CrossRef]
  15. Yuan, S.F.; Wang, Q.W.; Yu, Y.B.; Tian, Y. On hermitian solutions of the split quaternion matrix equation axb+cxd=e. Adv Appl Clifford Al 2017, 27, 3235–3252. [Google Scholar] [CrossRef]
  16. Shahzad, A.; Jones, B.; Kerrigan, E.; Constantinides, G. An efficient algorithm for the solution of a coupled sylvester equation appearing in descriptor systems. Automatica 2011, 47, 244–248. [Google Scholar] [CrossRef]
  17. 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, 440–445. [Google Scholar] [CrossRef]
  18. Barraud, A.; Lesecq, S.; Christov, N. From sensitivity analysis to random floating point arithmetics - application to sylvester equations. In International Conference on Numerical Analysis and Its Applications; Springer: Berlin, Heidelberg, 2000; Volumn 1988, pp. 35–41. [Google Scholar]
  19. Castelan, E.; Silva, V.G. On the solution of a sylvester equation appearing in descriptor systems control theory. Syst Control Lett 2005, 54, 109–117. [Google Scholar] [CrossRef]
  20. He, Z.H.; Wang, Q.W. A system of periodic discrete-time coupled sylvester quaternion matrix equations. Algebra Colloq 2017, 24, 169–180. [Google Scholar] [CrossRef]
  21. He, Z.H.; Wang, Q.W.; Zhang, Y. A system of quaternary coupled sylvester-type real quaternion matrix equations. Automatica 2018, 87, 25–31. [Google Scholar] [CrossRef]
  22. 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]
  23. Kyrchei, I. Cramer’s rules for Sylvester quaternion matrix equation and its special cases. Adv. Appl. Clifford Algebras 2018, 28, 1–26. [Google Scholar] [CrossRef]
  24. Kyrchei, I. Cramer’s Rules of ηη-(skew-) Hermitian solutions to the quaternion Sylvester-type matrix equations. Adv. Appl. Clifford Algebras 2019, 29, 1–31. [Google Scholar] [CrossRef]
  25. Yuan, S.F.; Wang, Q.W. L-structured quaternion matrices and quaternion linear matrix equations. Linear Multilinear Algebra 2016, 64, 321–339. [Google Scholar] [CrossRef]
  26. Ben-Israel, A.; Greville, T.N. Generalized inverses: theory and applications, 2nd ed.Springer Science & Business Media: New York, 2003. [Google Scholar]
  27. Magnus, J.R. L-structured matrices and linear matrix equations. Linear Multilinear Algebra 1983, 14, 67–88. [Google Scholar] [CrossRef]
  28. Xie, L.M.; Wang, Q.W. A system of matrix equations over the commutative quaternion ring. Filomat 2023, 37, 97–106. [Google Scholar] [CrossRef]
  29. Yuan, S.F.; Tian, Y.; Li, M.Z. On Hermitian solutions of the reduced biquaternion matrix equation (AXB,CXD)=(E,G). Linear Multilinear Algebra 2020, 68, 1355–1373. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated