Preprint
Article

This version is not peer-reviewed.

The Least-Norm Solution to a Matrix Equation over the Dual Quaterion Algebra

A peer-reviewed article of this preprint also exists.

Submitted:

14 January 2025

Posted:

15 January 2025

You are already at the latest version

Abstract
In this paper, we explore the least-norm solution to the classical matrix equation AXB=C over the dual quaternion algebra. We begin by transforming the definition of the Frobenius norm for dual quaternion matrices into an equivalent form. Using this new expression, we investigate the least-norm solution to the equation AXB=C under solvability conditions. Additionally, we examine the minimum real part of norm solution in cases where a least-norm solution does not exist. Finally, we provide two numerical examples to illustrate the main findings of our study.
Keywords: 
;  ;  ;  

1. Introduction

In 1843, Irish mathematician William Hamilton introduced quaternions in [1], defined as
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 } ,
where R denotes the set of real numbers. Nowadays, quaternions and quaternion matrices have captivated mathematicians worldwide, with applications spanning mathematics, signal and color image processing, quantum physics, and computer science (e.g.[2,3,4,5]).
In 1873, Clifford introduced dual numbers and dual quaternions in [6]. Since then, these concepts have seen extensive applications in fields such as robotics, computer graphics, and rigid body motions (e.g.[7,8,9,10,11]). For related definitions of dual numbers and dual quaternions, please refer to Section 2.
On the other hand, matrix equations are crucial components of matrix theory. Quaternion and dual quaternion matrix equations have been applied in various fields, such as control theory. Due to the non-commutative nature of quaternion multiplication, research into quaternions and dual quaternion matrix equations is more challenging than research into real and complex matrix equations.
A substantial body of research has explored matrix equations, offering various methods for their resolution (e.g.[12,13,14,15,16]). Especially, the classical matrix equation
A X B = C
has been extensively studied. Khatri and Mitra [17] discussed the Hermitian and nonnegative definite solution of the linear matrix Equation (1). Peng [18] introduced an iterative method for the least squares symmetric solution of the linear matrix Equation (1). Liang et al. [19] provided an efficient algorithm for the generalized centro-symmetric solution of the linear matrix Equation (1). Chen et al. [20] established the necessary and sufficient conditions for the solvability of the dual quaternion matrix Equation (1). Wang et al. [21] investigated the least squares Hermitian, Persymmetric and Bisymmetric solutions of the quaternion matrix Equation (1). Si and Wang [22] considered the general solution to the dual split quaternion matrix Equation (1).
In this paper, we use the following notations: r ( A ) represents the rank of a quaternion matrix A, A * denotes the conjugate transpose of A, and t r ( A ) stands for the trace of A. I, 0 refer to the identity matrix and the zero matrix with appropriate dimensions, respectively. The Moore-Penrose (or M-P for short) inverse of a quaternion matrix A is denoted by A , and it satisfies
A A A = A , A A A = A , ( A A ) * = A A , ( A A ) * = A A .
Furthermore, we use L A = I A A and R A = I A A to respectively represent two projectors that are induced by A . As usual, we use R e [ q ] to denote the real part of a quaternion q.
The remaining contents of this paper are organized as follows. In Section 2, we review definitions of dual numbers, dual quaternions, the Frobenius norm of quaternion matrices and its equivalent expressions, and some important Lemmas for subsequent sections. In Section 3, we explore the least-norm solution to the dual quaternion matrix Equation (1) under consistency conditions and analyze the minimum real part of norm solution when no least-norm solution exists. In Section 4, we present two numerical examples to illustrate the main findings of Section 3. In Section 5, we provide a brief summary.

2. Preliminaries

In this section, we first review definitions related to dual numbers, dual quaternions, and dual quaternion matrices. Then we introduce some results concerning the norm of dual quaternion matrices, the dual quaternion matrix equation, and the equalities related to the M-P inverse of quaternion matrices.

2.1. The Definition of Dual Numbers and Its Total Order Relation

 Definition 1
([23]). The set of dual numbers is represented as follows:
D = { x = x 0 + x 1 ε | ε 2 = 0 a n d x 0 , x 1 R } ,
where ε is the infinitesimal unit, satisfying ε 2 = 0 .
We refer to x 0 as the real part or the standard part of x, and x 1 as the dual part or the infinitesimal part of x. The infinitesimal unit ε commutes with real numbers, complex numbers, and quaternions under multiplication. We call x appreciable if x 0 0 , otherwise, we call x infinitesimal.
Assume that x = x 0 + x 1 ε , y = y 0 + y 1 ε D , k R , then we have:
x + y = x 0 + y 0 + ( x 1 + y 1 ) ε , x y = x 0 y 0 + ( x 0 y 1 + x 1 y 0 ) ε , k x = k x 0 + k x 1 ε .
Then we define a total order relation over dual numbers. Assume x = x 0 + x 1 ε , y = y 0 + y 1 ε D . We say x = y if x 0 = y 0 and x 1 = y 1 . We say x < y if x 0 < y 0 , or x 0 = y 0 and x 1 < y 1 . Therefore, we call x a positive dual number if x > 0 , we call x a nonnegative dual number if x 0 .
Next, we discuss the inverse element and square root of dual numbers. It is straightforward to observe that 1 = 1 + 0 ε is the unit element in D . If x is appreciable ( x 0 0 ), then x is invertible and
x 1 = x 0 1 + x 0 1 x 1 x 0 1 ε ,
satisfying x x 1 = x 1 x = 1 . If x is infinitesimal, then x is not invertible.
If x is positive and appreciable, then the square root of x can be expressed as
x = x 0 + x 1 2 x 0 ε .
Specifically, if x = 0 , then x = 0 .

2.2. The Definition of Dual Quaternions and Dual Quaternion Matrices

 Definition 2
([23]). The set of dual quaternions is represented as follows:
DQ = { q = q 0 + q 1 ε | ε 2 = 0 a n d q 0 , q 1 H } ,
where ε is the infinitesimal unit.
We refer to q 0 as the real part or the standard part of q, and q 1 as the dual part or the infinitesimal part of q. We call q appreciable if q 0 0 , otherwise, we call q infinitesimal. The conjugate of q is defined as q * = q 0 * + q 1 * ε .
Qi et al. presented the following Lemma in [23], showing that a mixed product sum of two quaternions is a real number. We supplement the conclusion of this Lemma and provide a proof.
 Lemma 1.
Suppose that p = p 0 + p 1 i + p 2 j + p 3 k , q = q 0 + q 1 i + q 2 j + q 3 k Q , where p 0 , p 1 , p 2 , p 3 , q 0 , q 1 , q 2 , q 3 R . Then
p q * + q p * = p * q + q * p = 2 p 0 q 0 + 2 p 1 q 1 + 2 p 2 q 2 + 2 p 3 q 3 = 2 R e [ p q * ] = 2 R e [ q p * ] = 2 R e [ p * q ] = 2 R e [ q * p ] ,
which is a real number.
 Proof. 
Since q p * = ( p q * ) * and q * p = ( p * q ) * , we obtain:
p q * + q p * = 2 R e [ p q * ] = 2 R e [ q p * ] = 2 p 0 q 0 + 2 p 1 q 1 + 2 p 2 q 2 + 2 p 3 q 3 , p * q + q * p = 2 R e [ p * q ] = 2 R e [ q * p ] = 2 p 0 q 0 + 2 p 1 q 1 + 2 p 2 q 2 + 2 p 3 q 3 .
Thus,
p q * + q p * = p * q + q * p = 2 p 0 q 0 + 2 p 1 q 1 + 2 p 2 q 2 + 2 p 3 q 3 = 2 R e [ p q * ] = 2 R e [ q p * ] = 2 R e [ p * q ] = 2 R e [ q * p ] .
According to the above Lemma, we can define the magnitude of q DQ as follows:
| q | : = | q 0 | + q 0 q 1 * + q 1 q 0 * 2 | q 0 | ε , if q 0 0 , | q 1 | ε , otherwise ,
which is a dual number.
Next, we will introduce dual quaternion matrices and discuss their norm.
 Definition 3
([23]). The set of dual quaternion matrices is represented as follows:
DQ m × n = { X = X 0 + X 1 ε | ε 2 = 0 a n d X 0 , X 1 H m × n } ,
where ε is the infinitesimal unit.
Assume that X = X 0 + X 1 ε , Y = Y 0 + Y 1 ε DQ m × n , then we have:
X + Y = X 0 + Y 0 + ( X 1 + Y 1 ) ε , X Y = X 0 Y 0 + ( X 0 Y 1 + X 1 Y 0 ) ε , X * = X 0 * + X 1 * ε .
Before defining the norm of dual quaternion matrices, we will first introduce the norm of quaternion matrices.
 Definition 4
([24]). Let X = ( x i j ) H m × n , the Frobenius norm of X is defined as
| | X | | : = i = 1 m j = 1 n | x i j | 2 = i = 1 m j = 1 n x i j * x i j = tr X * X .
Next, we introduce the definition of the norm of dual quaternion matrices.
 Definition 5
([24]). Assume X = X 0 + X 1 ε = ( x i j ) DQ m × n , the Frobenius norm of X is defined as
| | X | | : = i = 1 m j = 1 n | x i j | 2 , if X 0 0 , | | X 1 | | ε , otherwise .
In order to facilitate the discussion of the least-norm solution to the matrix Equation (1) in the following text, we have equivalently revised the definitions provided above.
 Proposition 1.
Suppose X = X 0 + X 1 ε = ( x i j ) DQ m × n , then we have
| | X | | = | | X 0 | | + tr ( X 1 * X 0 + X 0 * X 1 ) 2 | | x 0 | | ε , if X 0 0 , | | X 1 | | ε , otherwise .
= tr X 0 * X 0 + Re [ tr X 1 * X 0 ] tr X 0 * X 0 ε , if X 0 0 , tr X 1 * X 1 ε , otherwise .
 Proof. 
If X 0 0 , in accordance with (3) and Lemma 1, we have
| | X | | = i = 1 m j = 1 n | x i j | 2 = ( x i j ) 0 0 ( | ( x i j ) 0 | + ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * 2 | ( x i j ) 0 | ε ) 2 + ( x i j ) 0 = 0 ( | ( x i j ) 1 | ε ) 2 = ( x i j ) 0 0 ( | ( x i j ) 0 | 2 + ( ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * ) ε ) = i = 1 m j = 1 n ( | ( x i j ) 0 | 2 + ( ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * ) ε ) = i = 1 m j = 1 n | ( x i j ) 0 | 2 + ( i = 1 m j = 1 n ( ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * ) ) ε
= | | X 0 | | 2 + ( i = 1 m j = 1 n ( ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * ) ) ε = | | X 0 | | + i = 1 m j = 1 n ( ( x i j ) 0 ( x i j ) 1 * + ( x i j ) 1 ( x i j ) 0 * ) 2 | | X 0 | | ε = | | X 0 | | + tr ( X 1 * X 0 + X 0 * X 1 ) 2 | | X 0 | | ε = tr X 0 * X 0 + Re [ tr X 1 * X 0 ] tr X 0 * X 0 ε = tr X 0 * X 0 + Re [ tr X 0 * X 1 ] tr X 0 * X 0 ε .
If X 0 = 0 , since | | X 1 | | = tr X 1 * X 1 , we have | | X | | = | | X 1 | | ε = tr X 1 * X 1 ε . □

2.3. Some Important Lemmas

In this part, we present several key Lemmas that are crucial for the subsequent proofs.
 Lemma 2
([20]). Let A = A 0 + A 1 ε DQ m × n , B = B 0 + B 1 ε DQ k × l , C = C 0 + C 1 ε DQ m × l be known. Put
A 2 = A 1 L A 0 , B 2 = R B 0 B 1 , C 2 = C 1 A 0 A 0 C 0 B 0 B 1 A 1 A 0 C 0 B 0 B 0 ,
A 3 = R A 0 A 2 , C 21 = R A 0 C 2 , B 3 = B 2 L B 0 , C 22 = C 2 L B 0 .
Then, dual quaternion matrix Equation ( 1 ) is consistent if and only if
R A 0 C 0 = 0 , C 0 L B 0 = 0 ,
R A 3 C 21 = 0 , R A 0 C 2 L B 0 = 0 , C 22 L B 3 = 0 .
In this case, the general solution X of the dual quaternion matrix equation matrix Equation ( 1 ) can be expressed as X = X 0 + X 1 ε , where
X 0 = A 0 C 0 B 0 + L A 0 U 1 + U 2 R B 0 ,
X 1 = A 0 ( C 2 A 2 U 1 B 0 A 0 U 2 B 2 ) B 0 + L A 0 W 1 + W 2 R B 0 ,
U 1 = A 3 C 21 B 0 + L A 3 Q 1 + Q 2 R B 0 ,
U 2 = A 0 C 22 B 3 + L A 0 Q 3 + Q 4 R B 3 ,
where Q i ( i = 1 , 4 ¯ ) , W i ( i = 1 , 2 ) are arbitrary matrices over H with appropriate dimensions.
 Lemma 3
([25]). Let A, B and C be arbitrary matrices over H with appropriate dimensions. Then the following equalities hold:
(1) A = ( A * A ) A * = A * ( A A * ) .
(2) L A = ( L A ) 2 = ( L A ) * , R A = ( R A ) 2 = ( R A ) * .
(3) L A ( B L A ) = ( B L A ) , ( R A C ) R A = ( R A C ) .
 Lemma 4
([25]). Assume A, B be arbitrary matrices over H with appropriate dimensions. Then they satisfy the following equalities:
(1) | | A + B | | 2 = | | A | | 2 + | | B | | 2 + 2 Re [ tr B * A ] .
(2) Re [ tr A B ] = Re [ tr B A ] .
 Proposition 2.
Given A = ( a i j ) 0 H m × n , for an arbitrary matrix X H m × n , Re [ tr X * A ] can take any real value.
 Proof. 
Since A 0 , there exists a i j = q 0 + q 1 i + q 2 j + q 3 k 0 , q t R , ( t = 0 , 1 , 2 , 3 ) . Then we discuss in two cases.
(1) If q 0 0 , let X = m E i j , where m R and E i j represents the matrix whose ( i , j ) element is 1 and other elements are all 0, we have
Re [ tr X * A ] = Re [ m a i j ] = m q 0 .
Thus we can change Re [ tr X * A ] to any real value through alter the value of m.
(2) If q 1 0 or q 2 0 or q 3 0 , with out loss generality, suppose q 1 0 . Let X = ( m i ) E i j , where m R , we have
Re [ tr X * A ] = Re [ ( m i ) ) a i j ] = m q 1 .
Thus we can change Re [ tr X * A ] to any real value through alter the value of m. □

3. The Least-Norm Solution to the Matrix Equation (1)

In this section, starting from the general solution to the dual quaternion matrix Equation (1), we explore the least-norm solution to this matrix equation over the dual quaternion algebra.
 Theorem 1.
Suppose that dual quaternion matrix Equation ( 1 ) is consistent, let
A 2 = A 1 L A 0 , B 2 = R B 0 B 1 , C 2 = C 1 A 0 A 0 C 0 B 0 B 1 A 1 A 0 C 0 B 0 B 0 , A 3 = R A 0 A 2 , C 21 = R A 0 C 2 , B 3 = B 2 L B 0 , C 22 = C 2 L B 0 .
Then the least-norm solution to the matrix Equation ( 1 ) can be discussed in two cases:
( 1 ) If A 0 C 0 B 0 0 and A 3 C 2 B 0 = A 0 C 2 B 3 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix Equation ( 1 ) can be expressed as
X 0 = A 0 C 0 B 0 ,
X 1 = A 0 C 2 B 0 + L A 0 W 1 + W 2 R B 0 ,
where W i ( i = 1 , 2 ) are arbitrary matrices over H with appropriate dimensions.
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | A 0 C 0 B 0 | | + Re [ tr ( A 0 C 2 B 0 ) * ( A 0 C 0 B 0 ) ] | | A 0 C 0 B 0 | | ε .
( 2 ) If A 0 C 0 B 0 = A 3 C 2 B 0 = A 0 C 2 B 3 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix Equation ( 1 ) can be expressed as
X 0 = 0 ,
X 1 = A 0 C 1 B 0 .
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | A 0 C 1 B 0 | | ε .
 Proof. 
By Lemma 2, the general solution X = X 0 + X 1 ε to matrix Equation (1) can be expressed as follows:
X 0 = A 0 C 0 B 0 + L A 0 U 1 + U 2 R B 0 , X 1 = A 0 ( C 2 A 2 U 1 B 0 A 0 U 2 B 2 ) B 0 + L A 0 W 1 + W 2 R B 0 , U 1 = A 3 C 21 B 0 + L A 3 Q 1 + Q 2 R B 0 , U 2 = A 0 C 22 B 3 + L A 0 Q 3 + Q 4 R B 3 ,
where Q i ( i = 1 , 4 ¯ ) , W i ( i = 1 , 2 ) are arbitrary matrices over H with appropriate dimensions.
According to Proposition 1, we can find that the solution for X can be translate into analyzing X 0 , X 1 and Re[tr X 1 * X 0 ]. Then, by considering the total order relation for dual numbers, we understand that to minimize X , we first need to focus on minimizing the real part of X i.e. X 0 .
In view of Lemma 3 and Lemma 4, we have
| | X 0 | | 2 = | | A 0 C 0 B 0 + L A 0 U 1 + U 2 R B 0 | | 2 = | | A 0 C 0 B 0 | | 2 + | | L A 0 U 1 + U 2 R B 0 | | 2 + 2 Re [ tr ( L A 0 U 1 + U 2 R B 0 ) * A 0 C 0 B 0 ] = | | A 0 C 0 B 0 | | 2 + | | L A 0 U 1 + U 2 R B 0 | | 2 + 2 Re [ tr ( U 1 * L A 0 A 0 C 0 B 0 + tr R B 0 U 2 * A 0 C 0 B 0 ) ] = | | A 0 C 0 B 0 | | 2 + | | L A 0 U 1 + U 2 R B 0 | | 2 + 2 Re [ tr U 2 * A 0 C 0 B 0 R B 0 ] = | | A 0 C 0 B 0 | | 2 + | | L A 0 U 1 + U 2 R B 0 | | 2 ,
then,
| | L A 0 U 1 + U 2 R B 0 | | 2 = | | L A 0 ( A 3 C 21 B 0 + L A 3 Q 1 + Q 2 R B 0 ) + ( A 0 C 22 B 3 + L A 0 Q 3 + Q 4 R B 3 ) R B 0 | | 2 = | | L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 | | 2 + | | L A 0 A 3 C 21 B 0 + A 0 C 22 B 3 R B 0 | | 2 + K 1 = | | L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 | | 2 + | | L A 0 A 3 C 21 B 0 | | 2 + | | A 0 C 22 B 3 R B 0 | | 2 + K 1 + 2 Re [ tr ( A 0 C 22 B 3 R B 0 ) * ( L A 0 A 3 C 21 B 0 ) ] = | | L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 | | 2 + | | L A 0 A 3 R A 0 C 2 B 0 | | 2 + | | A 0 C 2 L B 0 B 3 R B 0 | | 2 + K 1 + 2 Re [ tr ( L A 0 A 0 C 22 B 3 R B 0 ) * ( A 3 C 21 B 0 ) ] = | | L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 + K 1 ,
where
K 1 = 2 Re [ tr ( L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 ) * ( A 3 C 2 B 0 + A 0 C 2 B 3 ) ] .
According to Lemma 3 and Lemma 4, we have
Re [ tr ( L A 0 L A 3 Q 1 ) * ( A 3 C 2 B 0 + A 0 C 2 B 3 ) = Re [ tr ( Q 1 * L A 3 L A 0 A 3 C 2 B 0 + Q 1 * L A 3 L A 0 A 0 C 2 B 3 ) ] = Re [ tr Q 1 * L A 3 A 3 C 2 B 0 ] = 0 ,
Re [ tr ( L A 0 Q 2 R B 0 ) * ( A 3 C 2 B 0 + A 0 C 2 B 3 ) = Re [ tr ( R B 0 Q 2 * L A 0 A 3 C 2 B 0 + R B 0 Q 2 * L A 0 A 0 C 2 B 3 ) ] = Re [ tr Q 2 * L A 0 A 3 C 2 B 0 R B 0 ] = 0 ,
Re [ tr ( L A 0 Q 3 R B 0 ) * ( A 3 C 2 B 0 + A 0 C 2 B 3 ) = Re [ tr ( R B 0 Q 3 * L A 0 A 3 C 2 B 0 + R B 0 Q 3 * L A 0 A 0 C 2 B 3 ) ] = Re [ tr Q 3 * L A 0 A 3 C 2 B 0 R B 0 ] = 0 ,
Re [ tr ( Q 4 R B 3 R B 0 ) * ( A 3 C 2 B 0 + A 0 C 2 B 3 ) = Re [ tr ( R B 0 R B 3 Q 4 * A 3 C 2 B 0 + R B 0 R B 3 Q 4 * A 0 C 2 B 3 ) ] = Re [ tr ( R B 3 Q 4 * A 3 C 2 B 0 R B 0 + Q 4 * A 0 C 2 B 3 R B 0 R B 3 ) ] = Re [ tr Q 4 * A 0 C 2 B 3 R B 3 ] = 0 .
Thus, K 1 = 0 . By (21) and (22), we obtain
| | X 0 | | 2 = | | A 0 C 0 B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 + | | L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 | | 2 | | A 0 C 0 B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 ,
with equality iff
L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 = 0 ,
i.e.
X 0 = A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 .
Therefore,
| | X 0 | | m i n = | | A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 | | = | | A 0 C 0 B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 .
We now discuss | | X | | under two different cases based on conditions (24) and (25).
1) If A 0 C 0 B 0 0 or A 3 C 2 B 0 0 or A 0 C 2 B 3 0 , by (23), we have
| | X 0 | | 2 = | | A 0 C 0 B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 > 0 .
Thus, X 0 0 i.e. X is appreciable. Consequently,
| | X | | = | | X 0 | | + Re [ tr X 1 * X 0 ] | | X 0 | | ε .
Next, we turn our attention to the dual part of | | X | | . Having already examined | | X 0 | | in the above, we will now delve into the analysis of Re [ tr X 1 * X 0 ] in the following part.
By (14), (15), (16) and (24), we have
X 1 = A 0 ( C 2 A 2 U 1 B 0 A 0 U 2 B 2 ) B 0 + L A 0 W 1 + W 2 R B 0 = A 0 ( C 2 A 2 ( A 3 C 21 B 0 + L A 3 Q 1 + Q 2 R B 0 ) B 0 A 0 ( A 0 C 22 B 3 + L A 0 Q 3 + Q 4 R B 3 ) B 2 ) B 0 + L A 0 W 1 + W 2 R B 0 = A 0 C 2 B 0 A 0 A 2 ( A 3 C 21 B 0 + L A 3 Q 1 ) B 0 B 0 A 0 A 0 ( A 0 C 22 B 3 + Q 4 R B 3 ) B 2 B 0 + L A 0 W 1 + W 2 R B 0 = A 0 C 2 B 0 A 0 A 2 A 3 C 21 B 0 A 0 A 2 L A 3 Q 1 B 0 B 0 A 0 C 22 B 3 B 2 B 0 A 0 A 0 Q 4 R B 3 B 2 B 0 + L A 0 W 1 + W 2 R B 0 = A 0 C 2 B 0 A 0 A 2 A 3 C 21 B 0 A 0 C 22 B 3 B 2 B 0 + L A 0 W 1 + W 2 R B 0 A 0 A 1 ( L A 0 L A 3 Q 1 ) B 0 B 0 A 0 A 0 ( Q 4 R B 3 R B 0 ) B 1 B 0
= A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 + A 0 A 1 ( L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 + Q 4 R B 3 R B 0 ) B 0 B 0 + A 0 A 0 ( L A 0 L A 3 Q 1 + L A 0 Q 2 R B 0 + L A 0 Q 3 R B 0 ) B 1 B 0 = A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 .
Thus,
Re [ tr X 1 * X 0 ] = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 ) * ( A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 ) ] = a + K ,
where,
a = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 ) ] = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 ) ] + Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( L A 0 A 3 C 2 B 0 ) ] + Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 2 B 3 R B 0 ) ] = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 ) ] + Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * L A 0 ( A 3 C 2 B 0 ) ] + Re [ tr R B 0 ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 2 B 3 ) ] = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 ) ] + Re [ tr ( C 2 B 0 A 1 A 3 C 2 B 0 C 2 B 3 B 1 B 0 ) * ( L A 0 A 0 ) * ( A 3 C 2 B 0 ) ] + Re [ tr ( B 0 R B 0 ) * ( A 0 C 2 A 0 A 1 A 3 C 2 A 0 C 2 B 3 B 1 ) * ( A 0 C 2 B 3 ) ] = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 ) ]
is a constant, and
K = Re [ tr ( L A 0 W 1 + W 2 R B 0 ) * ( A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 ) ] = Re [ tr ( W 1 * L A 0 A 3 C 2 B 0 + A 0 C 2 B 3 R B 0 W 2 * ) ] = Re [ tr ( W 1 * A 3 C 2 B 0 + A 0 C 2 B 3 W 2 * ) ] .
Next, we explore the situation of K in two cases.
1.1) If A 3 C 2 B 0 = A 0 C 2 B 3 = 0 , then substituting these into (29) and (30), we obtain
K = 0 , a = Re [ tr ( A 0 C 2 B 0 ) * ( A 0 C 0 B 0 ) ] .
According to (25) and (27), the least-norm solution to the dual quaternion matrix Equation (1) can be expressed as
X 0 = A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 = A 0 C 0 B 0 , X 1 = A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 = A 0 C 2 B 0 + L A 0 W 1 + W 2 R B 0 ,
where W i ( i = 1 , 2 ) are arbitrary matrices over H with appropriate dimensions.
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | X 0 | | + Re [ tr X 1 * X 0 ] | | X 0 | | ε = | | A 0 C 0 B 0 | | + Re [ tr ( A 0 C 2 B 0 ) * ( A 0 C 0 B 0 ) ] | | A 0 C 0 B 0 | | ε .
1.2) If A 3 C 2 B 0 0 or A 0 C 2 B 3 0 , by (30) and Proposition 2, K can take any real value. Thus, the dual part of | | X | | ,
Re [ tr X 1 * X 0 ] | | X 0 | | = a + K | | A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 | |
can take any real value. Therefore, the dual quaternion matrix Equation (1) does not have a least-norm solution in this case.
2) If A 0 C 0 B 0 = A 3 C 2 B 0 = A 0 C 2 B 3 = 0 , by (23), we obtain
| | X 0 | | 2 = | | A 0 C 0 B 0 | | 2 + | | A 3 C 2 B 0 | | 2 + | | A 0 C 2 B 3 | | 2 = 0 .
Thus, X 0 = 0 i.e. X is infinitesimal. Therefore, | | X | | = | | X 1 | | ε .
According to (27), we have
X 1 = A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 = A 0 ( C 1 A 0 A 0 C 0 B 0 B 1 A 1 A 0 C 0 B 0 B 0 ) B 0 + L A 0 W 1 + W 2 R B 0 = A 0 C 1 B 0 + L A 0 W 1 + W 2 R B 0 .
Thus,
| | X 1 | | 2 = | | A 0 C 1 B 0 + L A 0 W 1 + W 2 R B 0 | | 2 = | | A 0 C 1 B 0 | | 2 + | | L A 0 W 1 + W 2 R B 0 | | 2 + 2 Re [ tr ( L A 0 W 1 + W 2 R B 0 ) * ( A 0 C 1 B 0 ) ] = | | A 0 C 1 B 0 | | 2 + | | L A 0 W 1 + W 2 R B 0 | | 2 + 2 Re [ tr ( W 1 * L A 0 A 0 C 1 B 0 + tr A 0 C 1 B 0 R B 0 W 2 * ) ] = | | A 0 C 1 B 0 | | 2 + | | L A 0 W 1 + W 2 R B 0 | | 2 | | A 0 C 1 B 0 | | 2 ,
with equality iff
L A 0 W 1 + W 2 R B 0 = 0 ,
i.e.
X 1 = A 0 C 1 B 0 .
Therefore,
| | X 1 | | m i n = | | A 0 C 1 B 0 | | .
Thus, the least-norm solution to the dual quaternion matrix Equation (1) can be expressed as
X 0 = 0 , X 1 = A 0 C 1 B 0 .
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | X 1 | | ε = | | A 0 C 1 B 0 | | ε .
Through the proof process described, we observe that if A 3 C 2 B 0 0 or A 0 C 2 B 3 0 , the dual quaternion matrix Equation (1) does not have a least-norm solution. We will illustrate this situation in the following.
 Remark 1.
If A 3 C 2 B 0 0 or A 0 C 2 B 3 0 , the dual quaternion matrix Equation ( 1 ) has a minimum real part of norm solution, and the dual part of norm can take any real value. The solution X = X 0 + X 1 ε can be expressed as
X 0 = A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 ,
X 1 = A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 + L A 0 W 1 + W 2 R B 0 ,
where W i ( i = 1 , 2 ) are arbitrary matrices over H with appropriate dimensions. In this case,
| | X | | = | | X 0 | | m i n + a + K | | X 0 | | m i n ε = | | A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 | | + a + K | | A 0 C 0 B 0 + A 3 C 2 B 0 + A 0 C 2 B 3 | | ε ,
where
a = Re [ tr ( A 0 C 2 B 0 A 0 A 1 A 3 C 2 B 0 A 0 C 2 B 3 B 1 B 0 ) * ( A 0 C 0 B 0 ) ]
is a constant and
K = Re [ tr ( W 1 * A 3 C 2 B 0 + A 0 C 2 B 3 W 2 * ) ]
can take any real value.
As several applications of Theorem 1, we consider the least-norm solutions to the matrix equations A X = B and X C = D over the dual quaternion algebra.
 Corollary 1.
Suppose that dual quaternion matrix equation A X = B is consistent, let
A 2 = A 1 L A 0 , B 2 = B 1 A 1 A 0 B 0 , A 3 = R A 0 A 2 , B 3 = R A 0 B 2 .
Then the least-norm solution to the matrix equation A X = B can be discussed in two cases:
( 1 ) If A 0 B 0 0 and A 3 B 2 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix equation A X = B can be expressed as
X 0 = A 0 B 0 ,
X 1 = A 0 B 2 + L A 0 W 1 ,
where W 1 is an arbitrary matrix over H with appropriate dimensions.
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | A 0 B 0 | | + Re [ tr ( A 0 B 2 ) * ( A 0 B 0 ) ] | | A 0 B 0 | | ε .
( 2 ) If A 0 B 0 = A 3 B 2 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix equation A X = B can be expressed as
X 0 = 0 ,
X 1 = A 0 B 1 .
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | A 0 B 1 | | ε .
 Remark 2.
If A 3 B 2 0 , the dual quaternion matrix equation A X = B has a minimum real part of norm solution, and the dual part of norm can take any real value. The solution X = X 0 + X 1 ε can be expressed as
X 0 = A 0 B 0 + A 3 B 2 ,
X 1 = A 0 B 2 A 0 A 1 A 3 B 2 + L A 0 W 1 ,
where W 1 is an arbitrary matrix over H with appropriate dimensions. In this case,
| | X | | = | | X 0 | | m i n + a + K | | X 0 | | m i n ε = | | A 0 B 0 + A 3 B 2 | | + a + K | | A 0 B 0 + A 3 B 2 | | ε ,
where a = Re [ tr ( A 0 B 2 A 0 A 1 A 3 B 2 ) * A 0 B 0 ] is a constant and K = Re [ tr ( W 1 * A 3 B 2 ) ] can take any real value.
 Corollary 2.
Suppose that dual quaternion matrix equation X C = D is consistent, let
C 2 = R C 0 C 1 , D 2 = D 1 D 0 C 0 C 1 , C 3 = C 2 L C 0 , D 3 = D 2 L C 0 .
Then the least-norm solution to the matrix equation X C = D can be discussed in two cases:
( 1 ) If D 0 C 0 0 and D 2 C 3 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix equation X C = D can be expressed as
X 0 = D 0 C 0 ,
X 1 = D 2 C 0 + W 1 R C 0 ,
where W 1 is an arbitrary matrix over H with appropriate dimensions.
In this case, the least-norm of the general solution can be expressed as
| X | | m i n = | | D 0 C 0 | | + Re [ tr ( D 2 C 0 ) * ( D 0 C 0 ) ] | | D 0 C 0 | | ε .
( 2 ) If D 0 C 0 = D 2 C 3 = 0 , then the least-norm solution X = X 0 + X 1 ε to the matrix equation X C = D can be expressed as
X 0 = 0 ,
X 1 = D 1 C 0 .
In this case, the least-norm of the general solution can be expressed as
| | X | | m i n = | | D 1 C 0 | | ε .
 Remark 3.
If D 2 C 3 0 , the dual quaternion matrix equation X C = D has a minimum real part of norm solution, and the dual part of norm can take any real value. The solution X = X 0 + X 1 ε can be expressed as
X 0 = D 0 C 0 + D 2 C 3 ,
X 1 = D 2 C 0 D 2 C 3 C 1 C 0 + W 1 R C 0 ,
where W 1 is an arbitrary matrix over H with appropriate dimensions. In this case,
| | X | | = | | X 0 | | m i n + a + K | | X 0 | | m i n ε = | | D 0 C 0 + D 2 C 3 | | + a + K | | D 0 C 0 + D 2 C 3 | | ε ,
where a = Re [ tr ( D 2 C 0 D 2 C 3 C 1 C 0 ) * ( D 0 C 0 ) ] is a constant and K = Re [ tr ( D 2 C 3 W 1 * ) ] can take any real value.

4. Numerical Examples

In this part, we will present two numerical examples to illustrate the conclusion in the previous section.
 Example 1.
Solving the least-norm solution to the dual quaternion matrix equation A X B = C , and providing the norm of the solution, where
A = A 0 + A 1 ε = 1 + i j k 2 i + k j + 2 i + k k i + j 0 ε , B = B 0 + B 1 ε = 1 + i + j i + k j k 0 + 2 i k i + j 1 i ε , C = C 0 + C 1 ε = 3 i + 3 j + 3 k 2 2 i 2 5 i j + 4 k 4 i 2 k + 6 + 7 j + 5 k 10 + 2 i 3 j 3 k 9 7 i 3 j + 6 k 4 7 i 2 j 6 k ε .
Through calculation, we have
R A 0 C 0 = 0 , C 0 L B 0 = 0 , R A 3 C 21 = 0 , R A 0 C 2 L B 0 = 0 , C 22 L B 3 = 0 .
By Lemma 2, the matrix equation is consistent. On the other hand, we can identify that
A 0 C 0 B 0 0 and A 3 C 2 B 0 = A 0 C 2 B 3 = 0 .
According to Theorem 1, the matrix equation has a least-norm solution, which can be expressed as
X = X 0 + X 1 ε = i + k 1 0 1 + k + 2 i + j 1 k 0 ε .
In this case, the norm of solution is | | X | | = 5 + 5 5 ε .
 Example 2.
Solving the least-norm solution to the dual quaternion matrix equation A X B = C , and providing the norm of the solution, where
A = A 0 + A 1 ε = 1 + k 2 i j 0 0 + i 1 + k i + j 2 i + j ε , B = B 0 + B 1 ε = 1 + i + j i j j + k 0 + i k 1 + i j 1 ε , C = C 0 + C 1 ε = 2 2 i + 3 j 1 + 4 i k 0 0 + 4 + 3 i + 6 j + 2 k 3 + 7 i + j 3 k 5 + i + 3 j + 3 k 2 + 2 i 4 k ε .
Through calculation, we have
R A 0 C 0 = 0 , C 0 L B 0 = 0 , R A 3 C 21 = 0 , R A 0 C 2 L B 0 = 0 , C 22 L B 3 = 0 .
By Lemma 2, the matrix equation is consistent. On the other hand, we can identify that
A 0 C 0 B 0 0 , A 3 C 2 B 0 0 and A 0 C 2 B 3 = 0 .
According to Remark 1, the matrix equation does not have a least-norm solution and only has minimum real part of norm solution. The solution X = X 0 + X 1 ε can be expressed as
X 0 = 2 + j 0 1 i + k , X 1 = 0.2857 + 0.5714 i 0.1429 + 0.1429 k 0.2857 0.1429 i + 0.4286 j 0.8571 k 0.1429 i + 0.2857 j + 0.7143 0.1429 i + 0.4286 j 0.1429 i 0.4286 j 0.2857 W 1 ,
where W 1 is an arbitrary matrix over H with appropriate dimensions. In this case, the norm of solution is | | X | | = 2 2 + 1 + K 2 2 ε , where
K = Re [ tr W 1 * 1.4286 0.1429 i + 1.1429 j 0.1429 + 0.4286 i + 0.1429 j 0.4286 k 0.7143 + 0.2857 i 0.8571 j + 0.1429 k 0.2857 i + 0.2857 k ] .

5. Conclusions

In this paper, we first equivalently transform the expression of the norm of dual quaternion matrices as defined in reference [24]. Using this expression, we discuss the norm of the general solution to matrix equation A X B = C over the dual quaternion algebra when the equation is consistent and establish the conditions for the existence of the least-norm solution. When the equation A X B = C has a least-norm solution, we derive expressions for both the least-norm solution and the least-norm of the general solution in two different cases. If no least-norm solution exists, we consider the minimum real part of norm solution and establish expressions for the minimum real part of norm solution and the norm of the solution. In this case, the dual part of norm of solution can take any real value. After that, we investigate the least-norm solution to the dual quaternion matrix equations A X = B and X C = D as an application. Finally, we present two numerical examples to illustrate the main results of this paper. In the future, we will analyze the least-norm solution to more complex and general matrix equations over the dual quaternion algebra.

Author Contributions

All authors have equal contributions in conceptualization, formal analysis, investigation, methodology, 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 is supported by the National Natural Science Foundation of China (No. 12371023).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Lewis, A.C. Chapter 35 - William Rown Hamilton, Lectures on quaternions (1853). In Landmark Writings in Western Mathematics 1640-1940; Grattan-Guinness, I., Cooke, R., Corry, L., Crépel, P., Guicciardini, N., Eds.; Elsevier Science: Amsterdam, 2005; pp. 460–469. [Google Scholar]
  2. Wang, Q.-W. The general solution to a system of real quaternion matrix equations. Comput. Math. Appl. 2005, 49, 665–675. [Google Scholar] [CrossRef]
  3. Adler, S.L.; Finkelstein, D.R. Quaternionic quantum mechanics and quantum fields. Phys. Today 1996, 49, 58–60. [Google Scholar] [CrossRef]
  4. Assefa, D.; Mansinha, L.; Tiampo, K.F.; Rasmussen, H.; Abdella, K. Local quaternion Fourier transform and color image texture analysis. Signal Process 2010, 90, 1825–1835. [Google Scholar] [CrossRef]
  5. Took, C.C.; Mandic, D.P. Augmented second-order statistics of quaternion random signals. Signal Process 2011, 91, 214–224. [Google Scholar] [CrossRef]
  6. Clifford. Preliminary sketch of biquaternions. Proc. Lond. Math. Soc. 1871, 381–395. [Google Scholar]
  7. Brambley, G.; Kim, J. Unit dual quaternion-based pose optimisation for visual runway observations. IET Cyber-Syst. Robot. 2020, 2, 181–189. [Google Scholar] [CrossRef]
  8. Cheng, J.; Kim, J.; Jiang, Z.; Che, W. Dual quaternion-based graphical SLAM. Robot. Auton. Syst. 2016, 77, 15–24. [Google Scholar] [CrossRef]
  9. Wang, X.; Yu, C.; Lin, Z. A dual quaternion solution to attitude and position control for rigid-body coordination. IEEE Trans. Robot. 2012, 28, 1162–1170. [Google Scholar] [CrossRef]
  10. Kenwright, B. In Proceedings of 20th International Conference in Central Europe on Computer Graphics and Visualization, Plzen, Czech, 2012.
  11. Daniilidis, K. Hand-eye calibration using dual quaternions. Int. J. Robot. Res. 1999, 18, 286–298. [Google Scholar] [CrossRef]
  12. He, Z.-H.; Wang, Q.-W. The general solutions to some systems of matrix equations. Linear Multilinear Algebra 2015, 63, 2017–2032. [Google Scholar] [CrossRef]
  13. Xu, X.-L.; Wang, Q.-W. The consistency and the general common solution to some quaternion matrix equations. Ann. Funct. Anal. 2023, 14. [Google Scholar] [CrossRef]
  14. Xie, L.-m.; Wang, Q.-W. A system of dual quaternion matrix equations with its applications. ArXiv 2023, abs/2312.10037.
  15. Zhang, Y.; Wang, Q.-W.; Xie, L.-M. The Hermitian solution to a new system of commutative quaternion matrix equations. Symmetry 2024, 16, 361. [Google Scholar] [CrossRef]
  16. Dehghan, M.; Hajarian, M. On the generalized reflexive and anti-reflexive solutions to a system of matrix equations. Linear Algebra Appl. 2012, 437, 2793–2812. [Google Scholar] [CrossRef]
  17. Khatri, C.G.; Mitra, S.K. Hermitian and nonnegative definite solutions of linear matrix equations. SIAM J. Appl. Math. 1976, 31, 579–685. [Google Scholar] [CrossRef]
  18. Peng, Z.-y. An iterative method for the least squares symmetric solution of the linear matrix equation AXB = C. Appl. Math. Comput. 2005, 170, 711–723. [Google Scholar] [CrossRef]
  19. Liang, M.-l.; You, C.-h.; Dai, L.-f. An efficient algorithm for the generalized centro-symmetric solution of matrix equation AXB = C. Numer. Algorithms 2007, 44, 173–184. [Google Scholar] [CrossRef]
  20. Chen, Y.; Wang, Q.-W.; Xie, L.-M. Dual quaternion matrix equation AXB = C with applications. Symmetry 2024, 16, 287. [Google Scholar] [CrossRef]
  21. Wang, D.; Li, Y.; Ding, W. Several kinds of special least squares solutions to quaternion matrix equation AXB = C. J. Appl. Math. Comput. 2022, 68, 1881–1899. [Google Scholar] [CrossRef]
  22. Si, K.-W.; Wang, Q.-W. The general solution to a classical matrix equation AXB = C over the dual split quaternion algebra. Symmetry 2024, 16, 491. [Google Scholar] [CrossRef]
  23. Qi, L.-Q.; Ling, C.; Yan, H. Dual quaternions and dual quaternion vectors. Comm. Appl. Math. Comput. 2022, 4, 1494–1508. [Google Scholar] [CrossRef]
  24. Ling, C.; He, H.-J.; Qi, L.-Q. Singular values of dual quaternion matrices and their low-rank approximations. Numer. Funct. Anal. Optim. 2022, 43, 1423–1458. [Google Scholar] [CrossRef]
  25. Wang, Q.-W.; Li, C.-K. Ranks and the least-norm of the general solution to a system of quaternion matrix equations. Linear Algebra Appl. 2009, 430, 1626–1640. [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

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated