In this paper, we study the Hankel and Toeplitz solutions of reduced biquaternion matrix equation (1.1). Using semi-tensor product of matrices, the reduced biquaternion matrix equation (1.1) can be transformed into a general matrix equation of the form AX=B. Then, due to the special structure of Hankel matrix and Toeplitz matrix, the independent elements of Hankel matrix or Toeplitz matrix can be extracted by combing the H-representation method of matrix, so as to reduce the elements involved in the operation in the process of solving matrix equation and reduce the complexity of the problem. Finally, by using Moore-Penrose generalized inverse, the necessary and sufficient conditions for the existence of solutions of reduced biquaternion matrix equation (1.1) are given, and the corresponding numerical examples are given.
Citation: Xueling Fan, Ying Li, Wenxv Ding, Jianli Zhao. H-representation method for solving reduced biquaternion matrix equation[J]. Mathematical Modelling and Control, 2022, 2(2): 65-74. doi: 10.3934/mmc.2022008
[1] | Meshari Alesemi . Innovative approaches of a time-fractional system of Boussinesq equations within a Mohand transform. AIMS Mathematics, 2024, 9(10): 29269-29295. doi: 10.3934/math.20241419 |
[2] | Azzh Saad Alshehry, Humaira Yasmin, Ali M. Mahnashi . Analyzing fractional PDE system with the Caputo operator and Mohand transform techniques. AIMS Mathematics, 2024, 9(11): 32157-32181. doi: 10.3934/math.20241544 |
[3] | Aisha Abdullah Alderremy, Rasool Shah, Nehad Ali Shah, Shaban Aly, Kamsing Nonlaopon . Comparison of two modified analytical approaches for the systems of time fractional partial differential equations. AIMS Mathematics, 2023, 8(3): 7142-7162. doi: 10.3934/math.2023360 |
[4] | Musawa Yahya Almusawa, Hassan Almusawa . Numerical analysis of the fractional nonlinear waves of fifth-order KdV and Kawahara equations under Caputo operator. AIMS Mathematics, 2024, 9(11): 31898-31925. doi: 10.3934/math.20241533 |
[5] | M. Mossa Al-Sawalha, Khalil Hadi Hakami, Mohammad Alqudah, Qasem M. Tawhari, Hussain Gissy . Novel Laplace-integrated least square methods for solving the fractional nonlinear damped Burgers' equation. AIMS Mathematics, 2025, 10(3): 7099-7126. doi: 10.3934/math.2025324 |
[6] | Aslı Alkan, Halil Anaç . The novel numerical solutions for time-fractional Fornberg-Whitham equation by using fractional natural transform decomposition method. AIMS Mathematics, 2024, 9(9): 25333-25359. doi: 10.3934/math.20241237 |
[7] | Reetika Chawla, Komal Deswal, Devendra Kumar, Dumitru Baleanu . A novel finite difference based numerical approach for Modified Atangana- Baleanu Caputo derivative. AIMS Mathematics, 2022, 7(9): 17252-17268. doi: 10.3934/math.2022950 |
[8] | Emad Salah, Ahmad Qazza, Rania Saadeh, Ahmad El-Ajou . A hybrid analytical technique for solving multi-dimensional time-fractional Navier-Stokes system. AIMS Mathematics, 2023, 8(1): 1713-1736. doi: 10.3934/math.2023088 |
[9] | Qasem M. Tawhari . Advanced analytical techniques for fractional Schrödinger and Korteweg-de Vries equations. AIMS Mathematics, 2025, 10(5): 11708-11731. doi: 10.3934/math.2025530 |
[10] | Ritu Agarwal, Mahaveer Prasad Yadav, Dumitru Baleanu, S. D. Purohit . Existence and uniqueness of miscible flow equation through porous media with a non singular fractional derivative. AIMS Mathematics, 2020, 5(2): 1062-1073. doi: 10.3934/math.2020074 |
In this paper, we study the Hankel and Toeplitz solutions of reduced biquaternion matrix equation (1.1). Using semi-tensor product of matrices, the reduced biquaternion matrix equation (1.1) can be transformed into a general matrix equation of the form AX=B. Then, due to the special structure of Hankel matrix and Toeplitz matrix, the independent elements of Hankel matrix or Toeplitz matrix can be extracted by combing the H-representation method of matrix, so as to reduce the elements involved in the operation in the process of solving matrix equation and reduce the complexity of the problem. Finally, by using Moore-Penrose generalized inverse, the necessary and sufficient conditions for the existence of solutions of reduced biquaternion matrix equation (1.1) are given, and the corresponding numerical examples are given.
The purpose of this paper is to study the global behavior of the following max-type system of difference equations of the second order with four variables and period-two parameters
{xn=max{An,zn−1yn−2},yn=max{Bn,wn−1xn−2},zn=max{Cn,xn−1wn−2},wn=max{Dn,yn−1zn−2}, n∈N0≡{0,1,2,⋯}, | (1.1) |
where An,Bn,Cn,Dn∈R+≡(0,+∞) are periodic sequences with period 2 and the initial values x−i,y−i,z−i,w−i∈R+ (1≤i≤2). To do this we will use some methods and ideas which stems from [1,2]. For a more complex variant of the method, see [3]. A solution {(xn,yn,zn,wn)}+∞n=−2 of (1.1) is called an eventually periodic solution with period T if there exists m∈N such that (xn,yn,zn,wn)=(xn+T,yn+T,zn+T,wn+T) holds for all n≥m.
When xn=yn and zn=wn and A0=A1=B0=B1=α and C0=C1=D0=D1=β, (1.1) reduces to following max-type system of difference equations
{xn=max{α,zn−1xn−2},zn=max{β,xn−1zn−2}, n∈N0. | (1.2) |
Fotiades and Papaschinopoulos in [4] investigated the global behavior of (1.2) and showed that every positive solution of (1.2) is eventually periodic.
When xn=zn and yn=wn and An=Cn and Bn=Dn, (1.1) reduces to following max-type system of difference equations
{xn=max{An,yn−1xn−2},yn=max{Bn,xn−1yn−2}, n∈N0. | (1.3) |
Su et al. in [5] investigated the periodicity of (1.3) and showed that every solution of (1.3) is eventually periodic.
In 2020, Su et al. [6] studied the global behavior of positive solutions of the following max-type system of difference equations
{xn=max{A,yn−txn−s},yn=max{B,xn−tyn−s}, n∈N0, |
where A,B∈R+.
In 2015, Yazlik et al. [7] studied the periodicity of positive solutions of the max-type system of difference equations
{xn=max{1xn−1,min{1,pyn−1}},yn=max{1yn−1,min{1,pxn−1}}, n∈N0, | (1.4) |
where p∈R+ and obtained in an elegant way the general solution of (1.4).
In 2016, Sun and Xi [8], inspired by the research in [5], studied the following more general system
{xn=max{1xn−m,min{1,pyn−r}},yn=max{1yn−m,min{1,qxn−t}}, n∈N0, | (1.5) |
where p,q∈R+, m,r,t∈N≡{1,2,⋯} and the initial conditions x−i,y−i∈R+ (1≤i≤s) with s=max{m,r,t} and showed that every positive solution of (1.5) is eventually periodic with period 2m.
In [9], Stević studied the boundedness character and global attractivity of the following symmetric max-type system of difference equations
{xn=max{B,ypn−1xpn−2},yn=max{B,xpn−1ypn−2}, n∈N0, |
where B,p∈R+ and the initial conditions x−i,y−i∈R+ (1≤i≤2).
In 2014, motivated by results in [9], Stević [10] further study the behavior of the following max-type system of difference equations
{xn=max{B,ypn−1zpn−2},yn=max{B,zpn−1xpn−2},zn=max{B,xpn−1ypn−2}. n∈N0, | (1.6) |
where B,p∈R+ and the initial conditions x−i,y−i,z−i∈R+ (1≤i≤2), and showed that system (1.6) is permanent when p∈(0,4).
For more many results for global behavior, eventual periodicity and the boundedness character of positive solutions of max-type difference equations and systems, please readers refer to [11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30] and the related references therein.
In this section, we study the global behavior of system (1.1). For any n≥−1, write
{x2n=A2nXn,y2n=B2nYn,z2n=C2nZn,w2n=D2nWn,x2n+1=A2n+1X′n,y2n+1=B2n+1Y′n,z2n+1=C2n+1Z′n,w2n+1=D2n+1W′n. |
Then, (1.1) reduces to the following system
{Xn=max{1,C2n−1Z′n−1A2nB2nYn−1},Yn=max{1,D2n−1W′n−1B2nA2nXn−1},Z′n=max{1,A2nXnC2n+1D2n+1W′n−1},W′n=max{1,B2nYnD2n+1C2n+1Z′n−1},Zn=max{1,A2n−1X′n−1C2nD2nWn−1},Wn=max{1,B2n−1Y′n−1D2nC2nZn−1},X′n=max{1,C2nZnA2n+1B2n+1Y′n−1},Y′n=max{1,D2nWnB2n+1A2n+1X′n−1}, n∈N0. | (2.1) |
From (2.1) we see that it suffices to consider the global behavior of positive solutions of the following system
{un=max{1,bvn−1aAUn−1},Un=max{1,BVn−1aAun−1},vn=max{1,aunbBVn−1},Vn=max{1,AUnbBvn−1}, n∈N0, | (2.2) |
where a,b,A,B∈R+, the initial conditions u−1,U−1,v−1,V−1∈R+. If (un,Un,vn,Vn,a,A,b,B)=(Xn,Yn,Z′n,W′n,A2n,B2n,C2n−1,D2n−1), then (2.2) is the first four equations of (2.1). If (un,Un,vn,Vn,a,A,b,B)=(Zn,Wn,X′n,Y′n,C2n,D2n,A2n−1,B2n−1), then (2.2) is the next four equations of (2.1). In the following without loss of generality we assume a≤A and b≤B. Let {(un,Un,vn,Vn)}∞n=−1 be a positive solution of (2.2).
Proposition 2.1. If ab<1, then there exists a solution {(un,Un,vn,Vn)}∞n=−1 of (2.2) such that un=vn=1 for any n≥−1 and limn⟶∞Un=limn⟶∞Vn=∞.
Proof. Let u−1=v−1=1 and U−1=V−1=max{baA,aAB,abB}+1. Then, from (2.2) we have
{u0=max{1,bv−1aAU−1}=1,U0=max{1,BV−1aAu−1}=BV−1aA,v0=max{1,au0bBV−1}=1,V0=max{1,AU0bBv−1}=V−1ab, |
and
{u1=max{1,bv0aAU0}=max{1,bBV−1}=1,U1=max{1,BV0aAu0}=max{1,BV−1aAab}=BV−1aAab,v1=max{1,au1bBV0}=max{1,aabbBV−1}=1,V1=max{1,AU1bBv0}=max{1,V−1(ab)2}=V−1(ab)2. |
Suppose that for some k∈N, we have
{uk=1,Uk=BV−1aA(ab)k,vk=1,Vk=V−1(ab)k+1. |
Then,
{uk+1=max{1,bvkaAUk}=max{1,b(ab)kBV−1}=1,Uk+1=max{1,BVkaAuk}=max{1,BV−1aA(ab)k+1}=BV−1aA(ab)k+1,vk+1=max{1,auk+1bBVk}=max{1,a(ab)k+1bBV−1}=1,Vk+1=max{1,AUk+1bBvk}=max{1,V−1(ab)k+2}=V−1(ab)k+2. |
By mathematical induction, we can obtain the conclusion of Proposition 2.1. The proof is complete.
Now, we assume that ab≥1. Then, from (2.2) it follows that
{un=max{1,bvn−1aAUn−1},Un=max{1,BVn−1aAun−1},vn=max{1,abBVn−1,vn−1ABUn−1Vn−1},Vn=max{1,AbBvn−1,Vn−1abun−1vn−1}, n∈N0. | (2.3) |
Lemma 2.1. The following statements hold:
(1) For any n∈N0,
un, Un, vn, Vn∈[1,+∞). | (2.4) |
(2) If ab≥1, then for any k∈N and n≥k+2,
{un=max{1,baAUn−1,bvkaA(AB)n−k−1Un−1Un−2Vn−2⋯UkVk},Un=max{1,BaAun−1,BVkaA(ab)n−k−1un−1un−2vn−2⋯ukvk},vn=max{1,abBVn−1,vk(AB)n−kUn−1Vn−1⋯UkVk},Vn=max{1,AbBvn−1,Vk(ab)n−kun−1vn−1⋯ukvk}. | (2.5) |
(3) If ab≥1, then for any k∈N and n≥k+4,
{1≤vn≤vn−2,1≤Vn≤AaVn−2,1≤un≤max{1,bBun−2,bvkaA(AB)n−k−1},1≤Un≤max{1,BbUn−2,BVkaA(ab)n−k−1}. | (2.6) |
Proof. (1) It follows from (2.2).
(2) Since AB≥ab≥1, it follows from (2.2) and (2.3) that for any k∈N and n≥k+2,
un=max{1,bvn−1aAUn−1}=max{1,baAUn−1max{1,abBVn−2,vn−2ABUn−2Vn−2}}=max{1,baAUn−1,bvn−2ABaAUn−1Un−2Vn−2}=max{1,baAUn−1,bABaAUn−1Un−2Vn−2max{1,abBVn−1,vn−3ABUn−3Vn−3}}=max{1,baAUn−1,bvn−3(AB)2aAUn−1Un−2Vn−2Un−3Vn−3}⋯=max{1,baAUn−1,bvkaA(AB)n−k−1Un−1Un−2Vn−2⋯UkVk}. |
In a similar way, also we can obtain the other three formulas.
(3) By (2.5) one has that for any k∈N and n≥k+2,
{un≥baAUn−1,Un≥BaAun−1,vn≥abBVn−1,Vn≥AbBvn−1, |
from which and (2.4) it follows that for any n≥k+4,
{1≤un≤max{1,bBun−2,bvkaA(AB)n−k−1},1≤Un≤max{1,BbUn−2,BVkaA(ab)n−k−1},1≤vn≤max{1,avn−2A,vn−2}=vn−2,1≤Vn≤max{1,AVn−2a,Vn−2}=AVn−2a. |
The proof is complete.
Proposition 2.2. If ab=AB=1, then {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
Proof. By the assumption we see a=A and b=B. By (2.5) we see that for any k∈N and n≥k+2,
{un=max{1,b3Un−1,b3vkUn−1Un−2Vn−2⋯UkVk},Un=max{1,b3un−1,b3Vkun−1un−2vn−2⋯ukvk},vn=max{1,a3Vn−1,vkUn−1Vn−1⋯UkVk},Vn=max{1,a3vn−1,Vkun−1vn−1⋯ukvk}. | (2.7) |
(1) If a=b=1, then it follows from (2.7) and (2.4) that for any n≥k+4,
{un=max{1,vkUn−1Un−2Vn−2⋯UkVk}≤max{1,vkUn−2Un−3Vn−3⋯UkVk}=un−1,Un=max{1,Vkun−1un−2vn−2⋯ukvk}≤Un−1,vn=max{1,vkUn−1Vn−1⋯UkVk}≤vn−1,Vn=max{1,Vkun−1vn−1⋯ukvk}≤Vn−1. | (2.8) |
We claim that vn=1 for any n≥6 or Vn=1 for any n≥6. Indeed, if vn>1 for some n≥6 and Vm>1 for some m≥6, then
vn=v1Un−1Vn−1⋯U1V1>1, Vm=V1um−1vm−1⋯u1v1>1, |
which implies
1≥v1Un−1Vn−1⋯U1V1V1um−1vm−1⋯u1v1=Vmvn>1. |
A contradiction.
If vn=1 for any n≥6, then by (2.8) we see un=1 for any n≥10, which implies Un=Vn=V10.
If Vn=1 for any n≥6, then by (2.8) we see Un=1 for any n≥10, which implies vn=un=v10.
Then, {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
(2) If a<1<b, then it follows from (2.7) that for any n≥k+4,
{un=max{1,b3Un−1,b3vkUn−1Un−2Vn−2⋯UkVk},Un=max{1,b3un−1,b3Vkun−1un−2vn−2⋯ukvk},vn=max{1,vkUn−1Vn−1⋯UkVk}≤vn−1,Vn=max{1,Vkun−1vn−1⋯ukvk}≤Vn−1. | (2.9) |
It is easy to verify vn=1 for any n≥6 or Vn=1 for any n≥6.
If Vn=vn=1 eventually, then by (2.9) we have
{1≥vkUn−1Vn−1⋯UkVk eventually,1≥Vkun−1vn−1⋯ukvk eventually. |
Since Un≥b3un−1 and un≥b3Un−1, we see
{un=max{1,b3Un−1,b3vkUn−1Un−2Vn−2⋯UkVk}=max{1,b3Un−1}≤un−2 eventually,Un=max{1,b3un−1,b3Vkun−1un−2vn−2⋯ukvk}=max{1,b3un−1}≤Un−2 eventually, |
which implies
{un−2≥un=max{1,b3Un−1}≥max{1,b3Un−3}=un−2 eventually,Un−2≥Un=max{1,b3un−1}≥max{1,b3un−3}=Un−2 eventually. |
If Vn>1=vn eventually, then by (2.9) we have
{1≥vkUn−1Vn−1⋯UkVk eventually,Vn=Vkun−1vn−1⋯ukvk>1 eventually. |
Thus,
{un=max{1,b3Un−1,b3vkUn−1Un−2Vn−2⋯UkVk}=max{1,b3Un−1}≤un−2 eventually,Un=max{1,b3un−1,b3Vkun−1un−2vn−2⋯ukvk}=max{1,b3Vkun−1un−2vn−2⋯ukvk}≤Un−2 eventually, |
which implies
{un−2≥un=max{1,b3Un−1}≥max{1,b3Un−3}=un−2 eventually,Un=1 eventually or b3Vk eventually. |
If Vn=1<vn eventually, then by (2.9) we have Un−2=Un eventually and un=un−1 eventually. By the above we see that {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
(3) If b<1<a, then for any k∈N and n≥k+2,
{un=max{1,b3vkUn−1Un−2Vn−2⋯UkVk}≤un−1,Un=max{1,b3Vkun−1un−2vn−2⋯ukvk}≤Un−1,vn=max{1,a3Vn−1,vkUn−1Vn−1⋯UkVk},Vn=max{1,a3vn−1,Vkun−1vn−1⋯ukvk}. | (2.10) |
It is easy to verify un=1 for any n≥3 or Un=1 for any n≥3.
If un=Un=1 eventually, then
{1≥b3vkUn−1Un−2Vn−2⋯UkVk eventually,1≥b3Vkun−1un−2vn−2⋯ukvk eventually. |
Thus, by (2.6) we have
{vn−2≥vn=max{1,a3Vn−1,vkUn−1Vn−1⋯UkVk}=max{1,a3Vn−1}≥vn−2 eventually,Vn−2≥Vn=max{1,a3vn−1,Vkun−1vn−1⋯ukvk}=max{1,a3vn−1}≥Vn−2 eventually. |
If un=1<Un eventually, then
{1≥b3vkUn−1Un−2Vn−2⋯UkVk eventually,1<b3Vkun−1un−2vn−2⋯ukvk=Un eventually. |
Thus,
{vn−2≥vn=max{1,a3Vn−1,vkUn−1Vn−1⋯UkVk}=max{1,a3Vn−1}≥vn−2 eventually,Vn=max{1,a3vn−1,Vkun−1vn−1⋯ukvk}=max{1,Vkun−1vn−1⋯ukvk}=1 eventually or Vk eventually. |
If un>1=Un eventually, then we have Vn=Vn−2 eventually and vn=1 eventually or vn=vk eventually.
By the above we see that {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
Proposition 2.3. If ab=1<AB, then {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
Proof. Note that Un≥BaAun−1 and Vn≥AbBvn−1. By (2.5) we see that there exists N∈N such that for any n≥N,
{un=max{1,b2AUn−1}≤un−2,Un=max{1,BaAun−1,BVkaAun−1un−2vn−2⋯ukvk},vn=max{1,a2BVn−1}≤vn−2,Vn=max{1,AbBvn−1,Vkun−1vn−1⋯ukvk}. | (2.11) |
It is easy to verify that un=1 for any n≥N+1 or vn=1 for any n≥N+1.
If un=vn=1 eventually, then by (2.11) we see that Un=Un−1 eventually and Vn=Vn−1 eventually.
If uM+2n>1=vn eventually for some M∈N, then by (2.11) and (2.4) we see that
{uM+2n=b2AUM+2n−1>1 eventually,UM+2n+1=max{1,BbUM+2n−1,BVkaAuM+2nuM+2n−1vM+2n−1⋯ukvk}≥BbUM+2n−1 eventually,vn=max{1,a2BVn−1}=1 eventually,Vn=max{1,AbBvn−1,Vkun−1vn−1⋯ukvk}≤Vn−1 eventually. |
By (2.11) we see that Un is bounded, which implies B=b.
If UM+2n−1≤BVkaAuM+2nuM+2n−1vM+2n−1⋯ukvk eventually, then
UM+2n+1=BVkaAuM+2nuM+2n−1vM+2n−1⋯ukvk≤UM+2n−1 eventually. |
Thus, UM+2n+1=UM+2n−1 eventually and uM+2n=uM+2n−2 eventually. Otherwise, we have UM+2n+1=UM+2n−1 eventually and uM+2n=uM+2n−2 eventually. Thus, Vn=Vn−1=max{1,AbB} eventually since limn⟶∞Vkun−1vn−1⋯ukvk=0. By (2.2) it follows UM+2n=UM+2n−2 eventually and uM+2n+1=uM+2n−1 eventually.
If vM+2n>1=un eventually for some M∈N, then we may show that {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2. The proof is complete.
Proposition 2.4. If ab>1, then {(un,Un,vn,Vn)}+∞n=−1 is eventually periodic with period 2.
Proof. By (2.5) we see that there exists N∈N such that for any n≥N,
{un=max{1,baAUn−1},Un=max{1,BaAun−1},vn=max{1,abBVn−1},Vn=max{1,AbBvn−1}. | (2.12) |
If a<A, then for n≥2k+N with k∈N,
vn=max{1,abBVn−1}≤max{1,aAvn−2}≤⋯≤max{1,(aA)kvn−2k}, |
which implies vn=1 eventually and Vn=max{1,AbB} eventually.
If a=A, then
{vn=max{1,abBVn−1}≤vn−2 eventually,Vn=max{1,AbBvn−1}≤Vn−2 eventually. |
Which implies
{vn−2≥vn=max{1,abBVn−1}≥max{1,abBVn−3}=vn−2 eventually,Vn−2≥Vn=max{1,AbBvn−1}≥max{1,AbBvn−3}=Vn−2 eventually. |
Thus, Vn,vn are eventually periodic with period 2. In a similar way, we also may show that Un,un are eventually periodic with period 2. The proof is complete.
From (2.1), (2.2), Proposition 2.1, Proposition 2.2, Proposition 2.3 and Proposition 2.4 one has the following theorem.
Theorem 2.1. (1) If min{A0C1,B0D1,A1C0,B1D0}<1, then system (1.1) has unbounded solutions.
(2) If min{A0C1,B0D1,A1C0,B1D0}≥1, then every solution of system (1.1) is eventually periodic with period 4.
In this paper, we study the eventual periodicity of max-type system of difference equations of the second order with four variables and period-two parameters (1.1) and obtain characteristic conditions of the coefficients under which every positive solution of (1.1) is eventually periodic or not. For further research, we plan to study the eventual periodicity of more general max-type system of difference equations by the proof methods used in this paper.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Project supported by NSF of Guangxi (2022GXNSFAA035552) and Guangxi First-class Discipline SCPF(2022SXZD01, 2022SXYB07) and Guangxi Key Laboratory BDFE(FED2204) and Guangxi University of Finance and Economics LSEICIC(2022YB12).
There are no conflict of interest in this article.
[1] |
S. Adler, Scattering and decay theory for quaternionic quantum mechanics and structure of induced t nonconservation, Phys. Rev. D, 37 (1988), 3654–3662. https://doi.org/10.1103/PhysRevD.37.3654 doi: 10.1103/PhysRevD.37.3654
![]() |
[2] |
N. Bihan, S. Sangwine, Color image decomposition using quaternion singular value decomposition, International Conference on Visual Information Engineering (VIE 2003). Ideas, Applications, Experience, (2003), 113–116. https://doi.org/10.1049/cp:20030500 doi: 10.1049/cp:20030500
![]() |
[3] |
C. Moxey, S. Sangwine, T. A. Ell, Hypercomplex Correlation Techniques for Vector Images, IEEE T. Signal Proces., 51 (2003), 1941–1953. https://doi.org/10.1109/TSP.2003.812734 doi: 10.1109/TSP.2003.812734
![]() |
[4] |
F. Caccavale, C. Natale, B. Siciliano, L. Villani, Six-DOF impedance control based on angle/axis representations, IEEE Transactions on Robotics and Automation, 15 (1999), 289–300. https://doi.org/10.1109/70.760350 doi: 10.1109/70.760350
![]() |
[5] |
C. Khatri, S. Mitra, Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations, SIAM J. Appl. Math., 31 (1976), 579–585. https://doi.org/10.1137/0131050 doi: 10.1137/0131050
![]() |
[6] |
W. Wang, C. Song, Iterative algorithms for discrete-time periodic Sylvester matrix equations and its application in antilinear periodic system, Appl. Numer. Math., 168 (2021), 251–273. https://doi.org/10.1016/j.apnum.2021.06.006 doi: 10.1016/j.apnum.2021.06.006
![]() |
[7] |
M. Dehghan, A. Shirilord, On the Hermitian and Skew-Hermitian splitting-like iteration approach for solving complex continuous-time algebraic Riccati matrix equation, Appl. Numer. Math., 170 (2021), 109–127. https://doi.org/10.1016/j.apnum.2021.07.001 doi: 10.1016/j.apnum.2021.07.001
![]() |
[8] | S. Yuan, A. Liao, Y. Lei, Least squares Hermitian solution of the matrix equation (AXB,CXD)=(E,F) with the least norm over the skew field of quaternions, Math. Comput. Model., 48 (2007), 91–100. |
[9] |
D. Wang, Y. Li, W. Ding, The least squares Bisymmetric solution of quaternion matrix equation AXB=C, AIMS Mathematics, 6 (2021), 13247–13257. https://doi.org/10.3934/math.2021766 doi: 10.3934/math.2021766
![]() |
[10] |
F. Zhang, M. Wei, Y. Li, J. Zhao, Special least squares solutions of the quaternion matrix equation AX=B with applications, Appl. Math. Comput., 270 (2015), 425–433. https://doi.org/10.1016/j.amc.2015.08.046 doi: 10.1016/j.amc.2015.08.046
![]() |
[11] |
M. Xu, Y. Wang, A. Wei, Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling, Journal of Control Theory and Applications, 12 (2014), 187–197. https://doi.org/10.1007/s11768-014-0153-7 doi: 10.1007/s11768-014-0153-7
![]() |
[12] |
D. Cheng, J. Feng, H. Lv, Solving Fuzzy Relational Equations Via Semitensor Product, IEEE T. Fuzzy Syst., 20 (2012), 390–396. https://doi.org/10.1109/TFUZZ.2011.2174243 doi: 10.1109/TFUZZ.2011.2174243
![]() |
[13] | D. Wang, Y. Li, W. Ding, A new method based on semi-tensor product of matrices for solving Generalized Lyapunov Equation on the quaternion skew-filed, Proceedings of the 40th Chinese Control Conference (1), (2021), 177–182. |
[14] |
W. Ding, Y. Li, D. Wang, A. Wei, Constrainted least squares solution of Sylvester equation, Mathematical Modelling and Control, 1 (2021), 112–120. https://doi.org/10.3934/mmc.2021009 doi: 10.3934/mmc.2021009
![]() |
[15] | Y. Zhao, Y. Li, J. Zhao, D. Wang, The minimal norm least squares tridiagonal(Anti-)Hermitian solution of the quaternion Stein equation, Proceedings of the 40th Chinese Control Conference (1), (2021), 200–205. |
[16] | H. Schutte, J. Wenzel, Hypercomplex Numbers in Digital Signal Processing, IEEE International Symposium on Circuits and Systems, 2 (1990), 1557–1560. |
[17] |
K. Ueda, S. Takahashi, Digital filters with hypercomplex coefficients, Electronics and Communications in Japan (Part Ⅲ: Fundamental Electronic Science), 76 (1993), 85–98. https://doi.org/10.1002/ecjc.4430760909 doi: 10.1002/ecjc.4430760909
![]() |
[18] |
V. Dimitrov, T. Cooklev, B. Donevsky, On the multiplication of reduced biquaternions and applications, Inform. Process. Lett., 43 (1992), 161–164. https://doi.org/10.1016/0020-0190(92)90009-K doi: 10.1016/0020-0190(92)90009-K
![]() |
[19] |
C. Davenport, A communitative hypercomplex algebra with associated function theory, In Clifford Algebra With Numeric and Symbolic Computations, (1996), 213–227. https://doi.org/10.1007/978-1-4615-8157-4_14 doi: 10.1007/978-1-4615-8157-4_14
![]() |
[20] |
S. Pei, J. Chang, J. Ding, Commutative reduced biquaternions and their Fourier transform for signal and image processing applications, IEEE T. Signal Proces., 52 (2004), 2012–2031. https://doi.org/10.1109/TSP.2004.828901 doi: 10.1109/TSP.2004.828901
![]() |
[21] |
S. Pei, J. Chang, J. Ding, et al, Eigenvalues and Singular Value Decompositions of Reduced Biquaternion Matrices, IEEE T. Circuits-I, 55 (2008), 2673–2685. https://doi.org/10.1109/TCSI.2008.920068 doi: 10.1109/TCSI.2008.920068
![]() |
[22] |
H. Hidayet, Least-squares solutions of the reduced biquaternion matrix equation AX=B and their applications in colour image restoration, J. Mod. Optic., 66 (2019), 1802–1810. https://doi.org/10.1080/09500340.2019.1676474 doi: 10.1080/09500340.2019.1676474
![]() |
[23] |
R. Chan, M. K. Ng, Conjugate gradient methods for Toeplitz systems, SIAM Rev., 38 (1996), 427–482. https://doi.org/10.1137/S0036144594276474 doi: 10.1137/S0036144594276474
![]() |
[24] | K. Michael, Iterative Methods for Toeplitz Systems, Oxford University Press, Oxford, 2004. |
[25] |
G. Gelli, L. Izzo, Minimum-Redundancy Linear Arrays for Cyclostationarity-Based Source Location, IEEE T. Signal Proces., 45 (1997), 2605–2608. https://doi.org/10.1109/78.640730 doi: 10.1109/78.640730
![]() |
[26] |
D. Cheng, H. Qi, A. Xue, A Survey on Semi-Tensor Product of Matrices, Journal of Systems Science and Complexity, 20 (2007), 304–322. https://doi.org/10.1007/s11424-007-9027-0 doi: 10.1007/s11424-007-9027-0
![]() |
[27] |
D. Cheng, H. Qi, Z. Liu, From STP to game-based control, Sci. China Inform. Sci., 61 (2018), 1–19. https://doi.org/10.1007/s11432-017-9265-2 doi: 10.1007/s11432-017-9265-2
![]() |
[28] | D. Li, H. Liu, J. Zhang, J. Zhao, Application of left semi tensor product in matrix equation Practice and understanding of mathematics, J. Am. Math. Soc., 51 (2021), 219–224. |
[29] |
W. Zhang, B. Chen, H-Representation and Applications to Generalized Lyapunov Equations and Linear Stochastic Systems, IEEE T. Automat. Contr., 57 (2012), 3009–3022. https://doi.org/10.1109/TAC.2012.2197074 doi: 10.1109/TAC.2012.2197074
![]() |
[30] | A. Israel, Generalized inverses: theory and applications, 3 Eds., New York: Springer, 2003. |