The modified function projective synchronization problem for master-slave neural networks with mixed interval time-varying delays is presented using periodically intermittent feedback control. The interval distributed time-varying delay including the lower and upper bound is comprehensively established, which developed from the previous work. The following techniques are utilize to analyze the appropriate criteria for the modified function projective synchronization problem for master-slave neural networks with mixed interval time-varying delays such as the construction of appropriate Lyapunov-Krasovskii functionals merged with Newton-Leibniz formulation method, the intermittent feedback control technique, the reciprocally convex technique's lower bound lemma, Jensen's inequality, and the piecewise analytic method. The sufficient criteria for the modified function projective synchronization of the error system between the master and slave neural networks with intermittent feedback control are first established in terms of linear matrix inequalities (LMIs). The designed controller ensures that the synchronization of the error systems are proposed via intermittent feedback control. Finally, numerical examples are given to demonstrate the effectiveness of the proposed method.
Citation: Rakkiet Srisuntorn, Wajaree Weera, Thongchai Botmart. Modified function projective synchronization of master-slave neural networks with mixed interval time-varying delays via intermittent feedback control[J]. AIMS Mathematics, 2022, 7(10): 18632-18661. doi: 10.3934/math.20221025
[1] | Yasmina Khiar, Esmeralda Mainar, Eduardo Royo-Amondarain, Beatriz Rubio . High relative accuracy for a Newton form of bivariate interpolation problems. AIMS Mathematics, 2025, 10(2): 3836-3847. doi: 10.3934/math.2025178 |
[2] | Chih-Hung Chang, Ya-Chu Yang, Ferhat Şah . Reversibility of linear cellular automata with intermediate boundary condition. AIMS Mathematics, 2024, 9(3): 7645-7661. doi: 10.3934/math.2024371 |
[3] | Yongge Tian . Miscellaneous reverse order laws and their equivalent facts for generalized inverses of a triple matrix product. AIMS Mathematics, 2021, 6(12): 13845-13886. doi: 10.3934/math.2021803 |
[4] | Yang Chen, Kezheng Zuo, Zhimei Fu . New characterizations of the generalized Moore-Penrose inverse of matrices. AIMS Mathematics, 2022, 7(3): 4359-4375. doi: 10.3934/math.2022242 |
[5] | Pattrawut Chansangiam, Arnon Ploymukda . Riccati equation and metric geometric means of positive semidefinite matrices involving semi-tensor products. AIMS Mathematics, 2023, 8(10): 23519-23533. doi: 10.3934/math.20231195 |
[6] | Zongcheng Li, Jin Li . Linear barycentric rational collocation method for solving a class of generalized Boussinesq equations. AIMS Mathematics, 2023, 8(8): 18141-18162. doi: 10.3934/math.2023921 |
[7] | Maolin Cheng, Bin Liu . A novel method for calculating the contribution rates of economic growth factors. AIMS Mathematics, 2023, 8(8): 18339-18353. doi: 10.3934/math.2023932 |
[8] | Junsheng Zhang, Lihua Hao, Tengyun Jiao, Lusong Que, Mingquan Wang . Mathematical morphology approach to internal defect analysis of A356 aluminum alloy wheel hubs. AIMS Mathematics, 2020, 5(4): 3256-3273. doi: 10.3934/math.2020209 |
[9] | Sizhong Zhou, Quanru Pan . The existence of subdigraphs with orthogonal factorizations in digraphs. AIMS Mathematics, 2021, 6(2): 1223-1233. doi: 10.3934/math.2021075 |
[10] | Salman Zeb, Muhammad Yousaf, Aziz Khan, Bahaaeldin Abdalla, Thabet Abdeljawad . Updating QR factorization technique for solution of saddle point problems. AIMS Mathematics, 2023, 8(1): 1672-1681. doi: 10.3934/math.2023085 |
The modified function projective synchronization problem for master-slave neural networks with mixed interval time-varying delays is presented using periodically intermittent feedback control. The interval distributed time-varying delay including the lower and upper bound is comprehensively established, which developed from the previous work. The following techniques are utilize to analyze the appropriate criteria for the modified function projective synchronization problem for master-slave neural networks with mixed interval time-varying delays such as the construction of appropriate Lyapunov-Krasovskii functionals merged with Newton-Leibniz formulation method, the intermittent feedback control technique, the reciprocally convex technique's lower bound lemma, Jensen's inequality, and the piecewise analytic method. The sufficient criteria for the modified function projective synchronization of the error system between the master and slave neural networks with intermittent feedback control are first established in terms of linear matrix inequalities (LMIs). The designed controller ensures that the synchronization of the error systems are proposed via intermittent feedback control. Finally, numerical examples are given to demonstrate the effectiveness of the proposed method.
Throughout this article, Cm×n denotes the collection of all m×n matrices over the field of complex numbers, A∗ denotes the conjugate transpose of A∈Cm×n, r(A) denotes the rank of A∈Cm×n, R(A) denotes the range of A∈Cm×n, Im denotes the identity matrix of order m, and [A,B] denotes a row block matrix consisting of A∈Cm×n and B∈Cm×p. The Moore-Penrose generalized inverse of A∈Cm×n, denoted by A†, is the unique matrix X∈Cn×m satisfying the four Penrose equations
(1) AXA=A, (2) XAX=X, (3) (AX)∗=AX, (4) (XA)∗=XA. |
Further, we denote by
PA=AA†, EA=Im−AA† | (1.1) |
the two orthogonal projectors induced from A∈Cm×n. For more detailed information regarding generalized inverses of matrices, we refer the reader to [2,3,4].
Recall that the well-known Kronecker product of any two matrices A=(aij)∈Cm×n and B=(bij)∈Cp×q is defined to be
A⊗B=(aijB)=[a11Ba12B⋯a1nBa21Ba22B⋯a2nB⋮⋮⋱⋮am1Bam2B⋯amnB]∈Cmp×nq. |
The Kronecker product, named after German mathematician Leopold Kronecker, was classified to be a special kind of matrix operation, which has been regarded as an important matrix operation and mathematical technique. This product has wide applications in system theory, matrix calculus, matrix equations, system identification and more (cf. [1,5,6,7,8,9,10,11,12,13,14,16,18,19,20,21,23,24,25,27,28,33,34]). It has been known that the matrices operations based on Kronecker products have a series of rich and good structures and properties, and thus they have many significant applications in the research areas of both theoretical and applied mathematics. In fact, mathematicians established a variety of useful formulas and facts related to the products and used them to deal with various concrete scientific computing problems. Specifically, the basic facts on Kronecker products of matrices in the following lemma were highly appraised and recognized (cf. [15,17,21,32,34]).
Fact 1.1. Let A∈Cm×n, B∈Cp×q, C∈Cn×s, and D∈Cq×t. Then, the following equalities hold:
(A⊗B)(C⊗D)=(AC)⊗(BD), | (1.2) |
(A⊗B)∗=A∗⊗B∗, (A⊗B)†=A†⊗B†, | (1.3) |
PA⊗B=PA⊗PB, r(A⊗B)=r(A)r(B). | (1.4) |
In addition, the Kronecker product of matrices has a rich variety of algebraic operation properties. For example, one of the most important features is that the product A1⊗A2 can be factorized as certain ordinary products of matrices:
A1⊗A2=(A1⊗Im2)(In1⊗A2)=(Im1⊗A2)(A1⊗In2) | (1.5) |
for any A1∈Cm1×n1 and A2∈Cm2×n2, and the triple Kronecker product A1⊗A2⊗A3 can be written as
A1⊗A2⊗A3=(A1⊗Im2⊗Im3)(In1⊗A2⊗Im3)(In1⊗In2⊗A3), | (1.6) |
A1⊗A2⊗A3=(In1⊗A2⊗Im3)(In1(In1⊗In2⊗A3)(A1⊗Im2⊗Im3), | (1.7) |
A1⊗A2⊗A3=(Im1⊗Im2⊗A3)(A1⊗In2⊗In3)(Im1⊗A2⊗In3) | (1.8) |
for any A1∈Cm1×n1, A2∈Cm2×n2 and A3∈Cm3×n3, where the five matrices in the parentheses on the right hand sides of (1.5)–(1.8) are usually called the dilation expressions of the given three matrices A1, A2 and A3, and the four equalities in (1.5)–(1.8) are called the dilation factorizations of the Kronecker products A1⊗A2 and A1⊗A2⊗A3, respectively. A common feature of the four matrix equalities in (1.5)–(1.8) is that they factorize Kronecker products of any two or three matrices into certain ordinary products of the dilation expressions of A1, A2 and A3. Particularly, a noticeable fact we have to point out is that the nine dilation expressions of matrices in (1.5)–(1.8) commute each other by the well-known mixed-product property in (1.2) when A1, A2 and A3 are all square matrices. It can further be imagined that there exists proper extension of the dilation factorizations to Kronecker products of multiple matrices. Although the dilation factorizations in (1.5)–(1.8) seem to be technically trivial in form, they can help deal with theoretical and computational issues regarding Kronecker products of two or three matrices through the ordinary addition and multiplication operations of matrices.
In this article, we provide a new analysis of performances and properties of Kronecker products of matrices, as well as present a wide range of novel and explicit facts and results through the dilation factorizations described in (1.5)–(1.8) for the purpose of obtaining a deeper understanding and grasping of Kronecker products of matrices, including a number of analytical formulas for calculating ranks, dimensions, orthogonal projectors, and ranges of the dilation expressions of matrices and their algebraic operations.
The remainder of article is organized as follows. In section two, we introduce some preliminary facts and results concerning ranks, ranges, and generalized inverses of matrices. In section three, we propose and prove a collection of useful equalities, inequalities, and formulas for calculating the ranks, dimensions, orthogonal projectors, and ranges associated with the Kronecker products A1⊗A2 and A1⊗A2⊗A3 through the dilation expressions of A1, A2 and A3 and their operations. Conclusions and remarks are given in section four.
One of the remarkable applications of generalized inverses of matrices is to establish various exact and analytical expansion formulas for calculating the ranks of partitioned matrices. As convenient and skillful tools, these matrix rank formulas can be used to deal with a wide variety of theoretical and computational issues in matrix theory and its applications (cf. [22]). In this section, we present a mixture of commonly used formulas and facts in relation to ranks of matrices and their consequences about the commutativity of two orthogonal projectors, which we shall use as analytical tools to approach miscellaneous formulas related to Kronecker products of matrices.
Lemma 2.1. [22,29] Let A∈Cm×n and B∈Cm×k. Then, the following rank equalities
r[A,B]=r(A)+r(EAB)=r(B)+r(EBA), | (2.1) |
r[A,B]=r(A)+r(B)−2r(A∗B)+r[PAPB,PBPA], | (2.2) |
r[A,B]=r(A)+r(B)−r(A∗B)+2−1r(PAPB−PBPA), | (2.3) |
r[A,B]=r(A)+r(B)−r(A∗B)+r(P[A,B]−PA−PB+PAPB) | (2.4) |
hold. Therefore,
PAPB=PBPA⇔P[A,B]=PA+PB−PAPB⇔r(EAB)=r(B)−r(A∗B)⇔r[A,B]=r(A)+r(B)−r(A∗B)⇔R(PAPB)=R(PBPA). | (2.5) |
If PAPB=PBPA, PAPC=PCPA and PBPC=PCPB, then
P[A,B,C]=PA+PB+PC−PAPB−PAPC−PBPC+PAPBPC. | (2.6) |
Lemma 2.2. [30] Let A,B and C∈Cm×m be three idempotent matrices. Then, the following rank equality
r[A,B,C]=r(A)+r(B)+r(C)−r[AB,AC]−r[BA,BC]−r[CA,CB] +r[AB,AC,BA,BC,CA,CB] | (2.7) |
holds. As a special instance, if AB=BA, AC=CA and BC=CB, then
r[A,B,C]=r(A)+r(B)+r(C)−r[AB,AC]−r[BA,BC]−r[CA,CB]+r[AB,AC,BC]. | (2.8) |
The formulas and facts in the above two lemmas belong to mathematical competencies and conceptions in ordinary linear algebra. Thus they can easily be understood and technically be utilized to establish and simplify matrix expressions and equalities consisting of matrices and their generalized inverses.
We first establish a group of formulas and facts associated with the orthogonal projectors, ranks, dimensions, and ranges of the matrix product in (1.5).
Theorem 3.1. Let A1∈Cm1×n1 and A2∈Cm2×n2, and denote by
M1=A1⊗Im2, M2=Im1⊗A2 |
the two dilation expressions of A1 and A2, respectively. Then, we have the following results.
(a) The following orthogonal projector equalities hold:
PA1⊗A2=PM1PM2=PM2PM1=PA1⊗PA2. | (3.1) |
(b) The following four rank equalities hold:
r[A1⊗Im2,Im1⊗A2]=m1m2−(m1−r(A1))(m2−r(A2)), | (3.2) |
r[A1⊗Im2,Im1⊗EA2]=m1m2−(m1−r(A1))r(A2), | (3.3) |
r[EA1⊗Im2,Im1⊗A2]=m1m2−r(A1)(m2−r(A2)), | (3.4) |
r[EA1⊗Im2,Im1⊗EA2]=m1m2−r(A1)r(A2), | (3.5) |
and the following five dimension equalities hold:
dim(R(M1)∩R(M2))=r(M1M2)=r(A1)r(A2), | (3.6) |
dim(R(M1)∩R⊥(M2))=r(M1EM2)=r(A1)(m2−r(A2)), | (3.7) |
dim(R⊥(M1)∩R(M2))=r(EM1M2)=(m1−r(A1))r(A2), | (3.8) |
dim(R⊥(M1)∩R⊥(M2))=r(EM1EM2)=(m1−r(A1))(m2−r(A2)), | (3.9) |
dim(R(M1)∩R(M2))+dim(R(M1)∩R⊥(M2))+dim(R⊥(M1)∩R⊥(M2)) +dim(R⊥(M1)∩R⊥(M2))=m1m2. | (3.10) |
(c) The following range equalities hold:
R(M1)∩R(M2)=R(M1M2)=R(M2M1)=R(A1⊗A2), | (3.11) |
R(M1)∩R⊥(M2)=R(M1EM2)=R(EM2M1)=R(A1⊗EA2), | (3.12) |
R⊥(M1)∩R(M2)=R(EM1M2)=R(M2EM1)=R(EA1⊗A2), | (3.13) |
R⊥(M1)∩R⊥(M2)=R(EM1EM2)=R(EM2EM1)=R(EA1⊗EA2), | (3.14) |
(R(M1)∩R(M2))⊕(R⊥(M1)∩R(M2))⊕(R(M1)∩R⊥(M2))⊕(R⊥(M1)∩R⊥(M2))=Cm1m2. | (3.15) |
(d) The following orthogonal projector equalities hold:
PR(M1)∩R(M2)=PM1PM2=PA1⊗PA2, | (3.16) |
PR(M1)∩R⊥(M2)=PM1EM2=PA1⊗EA2, | (3.17) |
PR⊥(M1)∩R(M2)=EM1PM2=EA1⊗PA2, | (3.18) |
PR⊥(M1)∩R⊥(M2)=EM1EM2=EA1⊗EA2, | (3.19) |
PR(M1)∩R(M2)+PR⊥(M1)∩R(M2)+PR(M1)∩R⊥(M2)+PR⊥(M1)∩R⊥(M2)=Im1m2. | (3.20) |
(e) The following orthogonal projector equalities hold:
P[A1⊗Im2,Im1⊗A2]=PA1⊗Im2+Im1⊗PA2−PA1⊗PA2=Im1m2−EA1⊗EA2, | (3.21) |
P[A1⊗Im2,Im1⊗EA2]=PA1⊗Im2+Im1⊗EA2−PA1⊗EA2=Im1m2−EA1⊗PA2, | (3.22) |
P[EA1⊗Im2,Im1⊗A2]=EA1⊗Im2+Im1⊗PA2−EA1⊗PA2=Im1m2−PA1⊗EA2, | (3.23) |
P[EA1⊗Im2,Im1⊗EA2]=EA1⊗Im2+Im1⊗EA2−EA1⊗EA2=Im1m2−PA1⊗PA2. | (3.24) |
Proof. It can be seen from (1.2) and (1.4) that
PM1PM2=(A1⊗Im2)(A1⊗Im2)†(Im1⊗A2)(Im1⊗A2)†=(A1⊗Im2)(A†1⊗Im2)(Im1⊗A2)(Im1⊗A†2)=(PA1⊗Im2)(Im1⊗PA2)=PA1⊗PA2,PM2PM1=(Im1⊗A2)(Im1⊗A2)†(A1⊗Im2)(A1⊗Im2)†=(Im1⊗A2)(Im1⊗A†2)(A1⊗Im2)(A†1⊗Im2)=(Im1⊗PA2)(PA1⊗Im2)=PA1⊗PA2, |
thus establishing (3.1).
Applying (2.1) to [A1⊗Im2,Im1⊗A2] and then simplifying by (1.2)–(1.4) yields
r[A1⊗Im2,Im1⊗A2]=r(A1⊗Im2)+r((Im1m2−(A1⊗Im2)(A1⊗Im2)†)(Im1⊗A2))=r(A1⊗Im2)+r((Im1m2−(A1⊗Im2)(A†1⊗Im2))(Im1⊗A2))=r(A1⊗Im2)+r((Im1m2−(A1A†1)⊗Im2)(Im1⊗A2))=m2r(A1)+r((Im1−A1A†1)⊗Im2)(Im1⊗A2))=m2r(A1)+r((Im1−A1A†1)⊗A2))=m2r(A1)+r(Im1−A1A†1)r(A2)=m2r(A1)+(m1−r(A1))r(A2)=m1m2−(m1−r(A1))(m2−r(A2)), |
as required for (3.2). In addition, (3.2) can be directly established by applying (2.5) to the left hand side of (3.2). Equations (3.3)–(3.5) can be obtained by a similar approach. Subsequently by (3.2),
dim(R(M1)∩R(M2))=r(M1)+r(M2)−r[M1,M2]=r(A1)r(A2), |
as required for (3.6). Equations (3.7)–(3.9) can be established by a similar approach. Adding (3.7)–(3.9) leads to (3.10).
The first two equalities in (3.11) follow from (3.6), and the last two range equalities follow from (3.1).
Equations (3.12)–(3.14) can be established by a similar approach. Adding (3.11)–(3.14) and combining with (3.10) leads to (3.15).
Equations (3.16)–(3.19) follow from (3.11)–(3.14). Adding (3.16)–(3.19) leads to (3.20).
Under (3.1), we find from (2.5) that
P[M1,M2]=PM1+PM2−PM1PM2=PA1⊗Im2+Im1⊗PA2−PA1⊗PA2=Im1m2−EA1⊗EA2, |
as required for (3.21). Equations (3.22)–(3.24) can be established by a similar approach.
Equation (3.2) was first shown in [7]; see also [27] for some extended forms of (3.2). Obviously, Theorem 3.1 reveals many performances and properties of Kronecker products of matrices, and it is no doubt that they can be used as analysis tools to deal with various matrix equalities composed of algebraic operations of Kronecker products of matrices. For example, applying the preceding results to the Kronecker sum and difference A1⊗Im2±Im1⊗A2 for two idempotent matrices A1 and A2, we obtain the following interesting consequences.
Theorem 3.2. Let A1∈Cm1×m1 and A2∈Cm2×m2. Then, the following rank inequality
r(A1⊗Im2+Im1⊗A2)≥m1r(A2)+m2r(A1)−2r(A1)r(A2) | (3.25) |
holds. If A1=A21 and A2=A22, then the following two rank equalities hold:
r(A1⊗Im2+Im1⊗A2)=m1r(A2)+m2r(A1)−r(A1)r(A2), | (3.26) |
r(A1⊗Im2−Im1⊗A2)=m1r(A2)+m2r(A1)−2r(A1)r(A2). | (3.27) |
Proof. Equation (3.25) follows from applying the following well-known rank inequality (cf. [22])
r(A+B)≥r[AB]+r[A,B]−r(A)−r(B) |
and (2.1) to A1⊗Im2+Im1⊗A2. Specifically, if A1=A21 and A2=A22, then it is easy to verify that (A1⊗Im2)2=A21⊗Im2=A1⊗Im2 and (Im1⊗A2)2=Im1⊗A22=Im1⊗A2 under A21=A1 and A22=A2. In this case, applying the following two known rank formulas
r(A+B)=r[ABB0]−r(B)=r[BAA0]−r(A),r(A−B)=r[AB]+r[A,B]−r(A)−r(B), |
where A and B are two idempotent matrices of the same size (cf. [29,31]), to A1⊗Im2±Im1⊗A2 and then simplifying by (2.1) and (3.2) yields (3.26) and (3.27), respectively.
Undoubtedly, the above two theorems reveal some essential relations among the dilation forms of two matrices by Kronecker products, which demonstrate that there still exist various concrete research topics on the Kronecker product of two matrices with analytical solutions that can be proposed and obtained. As a natural and useful generalization of the preceding formulas, we next give a diverse range of results related to the three-term Kronecker products of matrices in (1.6).
Theorem 3.3. Let A1∈Cm1×n1,A2∈Cm2×n2 and A3∈Cm3×n3, and let
X1=A1⊗Im2⊗Im3, X2=Im1⊗A2⊗Im3, X3=Im1⊗Im2⊗A3 | (3.28) |
denote the three dilation expressions of A1, A2 and A3, respectively. Then, we have the following results.
(a) The following three orthogonal projector equalities hold:
PX1=PA1⊗Im2⊗Im3, PX2=Im1⊗PA2⊗Im3, PX3=Im1⊗Im2⊗PA3, | (3.29) |
the following equalities hold:
PX1PX2=PX2PX1=PA1⊗PA2⊗Im3, | (3.30) |
PX1PX3=PX3PX1=PA1⊗Im2⊗PA3, | (3.31) |
PX2PX3=PX3PX2=Im1⊗PA2⊗PA3, | (3.32) |
and the equalities hold:
PA1⊗A2⊗A3=PX1PX2PX3=PA1⊗PA2⊗PA3. | (3.33) |
(b) The following eight rank equalities hold:
r[A1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗A3] =m1m2m3−(m1−r(A1))(m2−r(A2))(m3−r(A3)), | (3.34) |
r[A1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗EA3] =m1m2m3−(m1−r(A1))(m2−r(A2))r(A3), | (3.35) |
r[A1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗A3] =m1m2m3−(m1−r(A1))r(A2)(m3−r(A3)), | (3.36) |
r[EA1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗A3] =m1m2m3−r(A1)(m2−r(A2))(m3−r(A3)), | (3.37) |
r[A1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗EA3] =m1m2m3−(m1−r(A1))r(A2)r(A3), | (3.38) |
r[EA1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗EA3] =m1m2m3−r(A1)(m2−r(A2))r(A3), | (3.39) |
r[EA1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗A3] =m1m2m3−r(A1)r(A2)(m3−r(A3)), | (3.40) |
r[EA1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗EA3]=m1m2m3−r(A1)r(A2)r(A3), | (3.41) |
the following eight dimension equalities hold:
dim(R(X1)∩R(X2)∩R(X3))=r(A1)r(A2)r(A3), | (3.42) |
dim(R(X1)∩R(X2)∩R⊥(X3))=r(A1)r(A2)(m3−r(A3)), | (3.43) |
dim(R⊥(X1)∩R⊥(X2)∩R(X3))=r(A1)(m2−r(A2))r(A3), | (3.44) |
dim(R⊥(X1)∩R⊥(X2)∩R(X3))=(m1−r(A1))r(A2)r(A3), | (3.45) |
dim(R(X1)∩R⊥(X2)∩R⊥(X3))=r(A1)(m2−r(A2))(m3−r(A3)), | (3.46) |
dim(R⊥(X1)∩R(X2)∩R⊥(X3))=(m1−r(A1))r(A2)(m3−r(A3)), | (3.47) |
dim(R⊥(X1)∩R⊥(X2)∩R(X3))=(m1−r(A1))(m2−r(A2))r(A3), | (3.48) |
dim(R⊥(X1)∩R⊥(X2)∩R⊥(X3))=(m1−r(A1))(m2−r(A2))(m3−r(A3)), | (3.49) |
and the following dimension equality holds:
dim(R(X1)∩R(X2)∩R(X3))+dim(R(X1)∩R(X2)∩R⊥(X3)) +dim(R⊥(X1)∩R⊥(X2)∩R(X3))+dim(R⊥(X1)∩R⊥(X2)∩R(X3)) +dim(R(X1)∩R⊥(X2)∩R⊥(X3))+dim(R⊥(X1)∩R(X2)∩R⊥(X3)) +dim(R⊥(X1)∩R⊥(X2)∩R(X3))+dim(R⊥(X1)∩R⊥(X2)∩R⊥(X3)=m1m2m3. | (3.50) |
(c) The following eight groups of range equalities hold:
R(X1)∩R(X2)∩R(X3)=R(X1X2X3)=R(A1⊗A2⊗A3), | (3.51) |
R(X1)∩R(X2)∩R⊥(X3)=R(X1X2EX3)=R(A1⊗A2⊗EA3), | (3.52) |
R(X1)∩R⊥(X2)∩R(X3)=R(X1EX2X3)=R(A1⊗EA2⊗A3), | (3.53) |
R⊥(X1)∩R(X2)∩R(X3)=R(EX1X2X3)=R(EA1⊗A2⊗A3), | (3.54) |
R(X1)∩R⊥(X2)∩R⊥(X3)=R(X1EX2EX3)=R(A1⊗EA2⊗EA3), | (3.55) |
R⊥(X1)∩R(X2)∩R⊥(X3)=R(EX1X2EX3)=R(EA1⊗A2⊗EA3), | (3.56) |
R⊥(X1)∩R⊥(X2)∩R(X3)=R(X1EX2X3)=R(EA1⊗EA2⊗A3), | (3.57) |
R⊥(X1)∩R⊥(X2)∩R⊥(X3)=R(EX1EX2EX3)=R(EA1⊗EA2⊗EA3), | (3.58) |
and the following direct sum equality holds:
(R(X1)∩R(X2)∩R(X3))⊕(R⊥(X1)∩R(X2)∩R(X3))⊕(R(X1)∩R⊥(X2)∩R(X3))⊕(R(X1)∩R(X2)∩R⊥(X3))⊕(R⊥(X1)∩R⊥(X2)∩R(X3))⊕(R⊥(X1)∩R(X2)∩R⊥(X3))⊕(R(X1)∩R⊥(X2)∩R⊥(X3))⊕(R⊥(X1)∩R⊥(X2)∩R⊥(X3))=Cm1m2m3. | (3.59) |
(d) The following eight orthogonal projector equalities hold:
PR(X1)∩R(X2)∩R(X3)=PA1⊗PA2⊗PA3, | (3.60) |
PR(X1)∩R(X2)∩R⊥(X3)=PA1⊗PA2⊗EA3, | (3.61) |
PR(X1)∩R⊥(X2)∩R(X3)=PA1⊗EA2⊗PA3, | (3.62) |
PR⊥(X1)∩R(X2)∩R(X3)=EA1⊗PA2⊗PA3, | (3.63) |
PR(X1)∩R⊥(X2)∩R⊥(X3)=PA1⊗EA2⊗EA3, | (3.64) |
PR⊥(X1)∩R(X2)∩R⊥(X3)=EA1⊗PA2⊗EA3, | (3.65) |
PR⊥(X1)∩R⊥(X2)∩R(X3)=EA1⊗EA2⊗PA3, | (3.66) |
PR⊥(X1)∩R⊥(X2)∩R⊥(X3)=EA1⊗EA2⊗EA3, | (3.67) |
and the following orthogonal projector equality holds:
PR(X1)∩R(X2)∩R(X3)+PR(X1)∩R(X2)∩R⊥(X3) +PR(X1)∩R⊥(X2)∩R(X3)+PR⊥(X1)∩R(X2)∩R(X3) +PR(X1)∩R⊥(X2)∩R⊥(X3)+PR⊥(X1)∩R(X2)∩R⊥(X3) +PR⊥(X1)∩R⊥(X2)∩R(X3)+PR⊥(X1)∩R⊥(X2)∩R⊥(X3)=Im1m2m3. | (3.68) |
(e) The following eight orthogonal projector equalities hold:
P[A1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗A3]=Im1m2m3−EA1⊗EA2⊗EA3, | (3.69) |
P[A1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗EA3]=Im1m2m3−EA1⊗EA2⊗PA3, | (3.70) |
P[A1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗A3]=Im1m2m3−EA1⊗PA2⊗EA3, | (3.71) |
P[EA1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗A3]=Im1m2m3−PA1⊗EA2⊗EA3, | (3.72) |
P[A1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗EA3]=Im1m2m3−EA1⊗PA2⊗PA3, | (3.73) |
P[EA1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗EA3]=Im1m2m3−PA1⊗EA2⊗PA3, | (3.74) |
P[EA1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗A3]=Im1m2m3−PA1⊗PA2⊗EA3, | (3.75) |
P[EA1⊗Im2⊗Im3,Im1⊗EA2⊗Im3,Im1⊗Im2⊗EA3]=Im1m2m3−PA1⊗PA2⊗PA3. | (3.76) |
Proof. By (1.1)–(1.3),
PX1=(A1⊗Im2⊗Im3)(A1⊗Im2⊗Im3)†=(A1⊗Im2⊗Im3)(A†1⊗Im2⊗Im3)=(A1A†1)⊗Im2⊗Im3=PA1⊗Im2⊗Im3, |
thus establishing the first equality in (3.29). The second and third equalities in (3.29) can be shown in a similar way. Also by (1.1)–(1.3),
PA1⊗A2⊗A3=(A1⊗A2⊗A3)(A1⊗A2⊗A3)†=(A1⊗A2⊗A3)(A†1⊗A†2⊗A†3)=(A1A†1)⊗(A2A†2)⊗(A3A†3)=PA1⊗PA2⊗PA3, | (3.77) |
and by (1.2) and (3.29),
PX1PX2PX3=(PA1⊗Im2⊗Im3)(Im1⊗PA2⊗Im3)(Im1⊗Im2⊗PA3)=PA1⊗PA2⊗PA3. | (3.78) |
Combining (3.77) and (3.78) leads to (3.33).
By (2.1), (1.2)–(1.4) and (3.2),
r[A1⊗Im2⊗Im3,Im1⊗A2⊗Im3,Im1⊗Im2⊗A3]=r(A1⊗Im2⊗Im3)+r((Im1−A1A†1)⊗[A2⊗Im3,Im2⊗A3])=m2m3r(A1)+r(Im1−A1A†1)r[A2⊗Im3,Im2⊗A3]=m2m3r(A1)+(m1−r(A1))(m2m3−(m2−r(A2))(m3−r(A3)))=m1m2m3−(m1−r(A1))(m2−r(A2))(m3−r(A3)), |
thus establishing (3.34). Equations (3.35)–(3.41) can be established in a similar way.
By (3.11), we are able to obtain
R(X1)∩R(X2)=R(X1X2)=R(X2X1)=R(A1⊗A2⊗Im3). |
Consequently,
R(X1)∩R(X2)∩R(X3)=R(X1X2)∩R(X3)=R(X1X2X3)=R(A1⊗A2⊗A3), |
as required for (3.51). Equations (3.52)–(3.58) can be established in a similar way. Adding (3.51)–(3.58) leads to (3.59).
Taking the dimensions of both sides of (3.51)–(3.58) and applying (1.4), we obtain (3.42)–(3.50).
Equations (3.60)–(3.68) follow from (3.51)–(3.59).
Equations (3.69)–(3.77) follow from (2.6) and (3.30)–(3.32).
In addition to (3.28), we can construct the following three dilation expressions
Y1=Im1⊗A2⊗A3, Y2=A1⊗Im2⊗A3 and Y3=A1⊗A2⊗Im3 | (3.79) |
from any three matrices A1∈Cm1×n1,A2∈Cm2×n2 and A3∈Cm3×n3. Some concrete topics on rank equalities for the dilation expressions under vector situations were considered in [26]. Below, we give a sequence of results related to the three dilation expressions.
Theorem 3.4. Let Y1, Y2 and Y3 be the same as given in (3.79). Then, we have the following results.
(a) The following three projector equalities hold:
PY1=Im1⊗PA2⊗PA3, PY2=PA1⊗Im2⊗PA3 and PY3=PA1⊗PA2⊗Im3. | (3.80) |
(b) The following twelve matrix equalities hold:
PY1PY2=PY2PY1=PY1PY3=PY3PY1=PY2PY3=PY3PY2=PY1PY2PY3=PY1PY3PY2=PY2PY1PY3=PY2PY3PY1=PY3PY1PY2=PY3PY2PY1=PA1⊗PA2⊗PA3. | (3.81) |
(c) The following rank equality holds:
r[Y1,Y2,Y3]=m1r(A2)r(A3)+m2r(A1)r(A3)+m3r(A1)r(A2)−2r(A1)r(A2)r(A3). | (3.82) |
(d) The following range equality holds:
R(Y1)∩R(Y2)∩R(Y3)=R(A1⊗A2⊗A3). | (3.83) |
(e) The following dimension equality holds:
dim(R(Y1)∩R(Y2)∩R(Y3))=r(A1)r(A2)r(A3). | (3.84) |
(f) The following projector equality holds:
PR(Y1)∩R(Y2)∩R(Y3)=PA1⊗PA2⊗PA3. | (3.85) |
(g) The following projector equality holds:
P[Y1,Y2,Y3]=Im1⊗PA2⊗PA3+PA1⊗Im2⊗PA3+PA1⊗PA2⊗Im3−2(PA1⊗PA2⊗PA3). | (3.86) |
Proof. Equation (3.80) follows directly from (3.79), and (3.81) follows from (3.80). Since PY1, PY2 and PY3 are idempotent matrices, we find from (2.8) and (3.80) that
r[Y1,Y2,Y3]=r[PY1,PY2,PY3]=r(PY1)+r(PY2)+r(PY3) −r[PY1PY2,PY1PY3]−r[PY2PY1,PY2PY3]−r[PY3PY1,PY3PY1] +r[PY1PY2,PY1PY3,PY2PY2]=r(PY1)+r(PY2)+r(PY3)−2r(PA1⊗PA2⊗PA3)=m1r(A2)r(A3)+m2r(A1)r(A3)+m3r(A1)r(A2)−2r(A1)r(A2)r(A3), |
thus establishing (3.82). Equations (3.83)–(3.86) are left as exercises for the reader.
There are some interesting consequences to Theorems 3.3 and 3.4. For example, applying the following well-known rank inequality (cf. [22]):
r(A+B+C)≥r[ABC]+r[A,B,C]−r(A)−r(B)−r(C) |
to the sums of matrices in (3.28) and (3.80) yields the two rank inequalities
r(A1⊗Im2⊗Im3+Im1⊗A2⊗Im3+Im1⊗Im2⊗A3)≥m1m2r(A3)+m1m3r(A2)+m2m3r(A1)−2m1r(A2)r(A3)−2m2r(A1)r(A3) −2m3r(A1)r(A2)+2r(A1)r(A2)r(A3) |
and
r(Im1⊗A2⊗A3+A1⊗Im2⊗A3+A1⊗A2⊗Im3)≥m1r(A2)r(A3)+m2r(A1)r(A3)+m3r(A1)r(A2)−4r(A1)r(A2)r(A3), |
respectively, where A1∈Cm1×m1,A2∈Cm2×m2 and A3∈Cm3×m3.
We presented a new analysis of the dilation factorizations of the Kronecker products of two or three matrices, and obtained a rich variety of exact formulas and facts related to ranks, dimensions, orthogonal projectors, and ranges of Kronecker products of matrices. Admittedly, it is easy to understand and utilize these resulting formulas and facts in dealing with Kronecker products of matrices under various concrete situations. Given the formulas and facts in the previous theorems, there is no doubt to say that this study clearly demonstrates significance and usefulness of the dilation factorizations of Kronecker products of matrices. Therefore, we believe that this study can bring deeper insights into performances of Kronecker products of matrices, and thereby can lead to certain advances of enabling methodology in the domain of Kronecker products. We also hope that the findings in this resultful study can be taken as fundamental facts and useful supplementary materials in matrix theory when identifying and approaching various theoretical and computational issues associated with Kronecker products of matrices.
Moreover, the numerous formulas and facts in this article can be extended to the situations for dilation factorizations of multiple Kronecker products of matrices, which can help us a great deal in producing more impressive and useful contributions of researches related to Kronecker products of matrices and developing other relevant mathematical techniques applicable to solving practical topics. Thus, they can be taken as a reference and a source of inspiration for deep understanding and exploration of numerous performances and properties of Kronecker products of matrices.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The authors would like to express their sincere thanks to anonymous reviewers for their helpful comments and suggestions.
The authors declare that they have no conflict of interest.
[1] |
Y. Liu, Z. Wang, X. Liu, Globally exponential satbility of generalized recurrent neural networks with discrete and distributed delays, Neural Networks, 19 (2006), 667–675. http://dx.doi.org/10.1016/j.neunet.2005.03.015 doi: 10.1016/j.neunet.2005.03.015
![]() |
[2] |
P. Zhou, S. Cai, Adaptive exponential lag synchronization for neural networks with mixed delays via intermittent control, Adv. Differ. Equ., 2018 (2018), 40. http://dx.doi.org/10.1186/s13662-018-1498-x doi: 10.1186/s13662-018-1498-x
![]() |
[3] |
R. Raja, R. Samidurai, New delay dependent robust asymptotic stability for uncertain stochastic recurrent neural networks with multiple time varying delays, J. Franklin I., 349 (2012), 2108–2123. http://dx.doi.org/10.1016/j.jfranklin.2012.03.007 doi: 10.1016/j.jfranklin.2012.03.007
![]() |
[4] |
Z. Zuo, C. Yang, Y. Wang, A new method for stability analysis of recurrent neural networks with interval time-varying delay, IEEE T. Neural Networ., 21 (2010), 339–344. http://dx.doi.org/10.1109/TNN.2009.2037893 doi: 10.1109/TNN.2009.2037893
![]() |
[5] |
T. Botmart, N. Yotha, P. Niamsup, W. Weera, Hybrid adaptive pinning control for function projective synchronization of delayed neural networks with mixed uncertain couplings, Complexity, 2017 (2017), 4654020. http://dx.doi.org/10.1155/2017/4654020 doi: 10.1155/2017/4654020
![]() |
[6] |
Q. Zhu, S. Senthilraj, R. Raja, R. Samidurai, Stability analysis of uncertain neutral systems with discrete and distributed delays via the delay partition approach, Int. J. Control Autom. Syst., 15 (2017), 2149–2160. http://dx.doi.org/10.1007/s12555-016-0148-x doi: 10.1007/s12555-016-0148-x
![]() |
[7] |
K. Mathiyalagan, R. Anbuvithya, R. Sakthivel, J. Park, P. Prakash, Non-fragile H∞ synchronization of memristor-based neural networks using passivity theory, Neural Networks, 74 (2016), 85–100. http://dx.doi.org/10.1016/j.neunet.2015.11.005 doi: 10.1016/j.neunet.2015.11.005
![]() |
[8] |
K. Mathiyalagan, J. Park, R. Sakthivel, Synchronization for delayed memristive BAM neural networks using impulsive control with random nonlinearities, Appl. Math. Comput., 259 (2015), 967–979. http://dx.doi.org/10.1016/j.amc.2015.03.022 doi: 10.1016/j.amc.2015.03.022
![]() |
[9] |
G. Sangeetha, K. Mathiyalagan, State estimation results for genetic regulatory networks with Lévy-type noise, Chinese J. Phys., 68 (2020), 191–203. http://dx.doi.org/10.1016/j.cjph.2020.09.007 doi: 10.1016/j.cjph.2020.09.007
![]() |
[10] |
M. Park, O. Kwon, J. Park, S. Lee, E. Cha, On synchronization criterion for coupled discrete-time neural networks with interval time-varying delays, Neurocomputing, 99 (2013), 188–196. http://dx.doi.org/10.1016/j.neucom.2012.04.027 doi: 10.1016/j.neucom.2012.04.027
![]() |
[11] |
S. Senthilraj, R. Raja, Q. Zhu, R. Samidurai, Z. Yao, New delay-interval-dependent stability criteria for static neural networks with time-varying delays, Neurocomputing, 186 (2016), 1–7. http://dx.doi.org/10.1016/j.neucom.2015.12.063 doi: 10.1016/j.neucom.2015.12.063
![]() |
[12] |
A. Abdurahman, H, Jiang, Z. Teng, Function projective synchronization of impulsive neural networks with mixed time-varying delays, Nonlinear Dyn., 78 (2014), 2627–2638. http://dx.doi.org/10.1007/s11071-014-1614-8 doi: 10.1007/s11071-014-1614-8
![]() |
[13] |
L. Cheng, Y. Yang, L. Li, X. Sui, Finite-time hybrid projective synchronization of the drive-response complex networks with distributed-delay via adaptive intermittent control, Physica A, 500 (2018), 273–286. http://dx.doi.org/10.1016/j.physa.2018.02.124 doi: 10.1016/j.physa.2018.02.124
![]() |
[14] |
S. Zheng, Q. Bi, G. Cai, Adaptive projective synchronization in complex networks with time-varying coupling delay, Phys. Lett. A, 373 (2009), 1553–1559. http://dx.doi.org/10.1016/j.physleta.2009.03.001 doi: 10.1016/j.physleta.2009.03.001
![]() |
[15] |
Y. Fan, K. Xing, Y. Wang, L. Wang, Projective synchronization adaptive control for differential chaotic neural networks with mixed time delay, Optik, 127 (2016), 2551–2557. http://dx.doi.org/10.1016/j.ijleo.2015.11.227 doi: 10.1016/j.ijleo.2015.11.227
![]() |
[16] |
J. Yu, C. Hu, H. Jiang, X. Fan, Projective synchronization for fractional neural networks, Neural Networks, 49 (2014), 87–95. http://dx.doi.org/10.1016/j.neunet.2013.10.002 doi: 10.1016/j.neunet.2013.10.002
![]() |
[17] |
S. Song, X. Song, I. Balseva, Mixed H∞ passive projective synchronization for nonidentical uncertain fractional-order neural networks bases on adaptive sliding mode control, Neural process. Lett., 47 (2018), 443–462. http://dx.doi.org/10.1007/s11063-017-9659-6 doi: 10.1007/s11063-017-9659-6
![]() |
[18] |
X. Liu, P. Li, T. Chen, Cluster synchronization for delayed complex networks via periodically intermittent pinning control, Neurocomputing, 162 (2015), 191–200. http://dx.doi.org/10.1016/j.neucom.2015.03.053 doi: 10.1016/j.neucom.2015.03.053
![]() |
[19] |
P. Zhou, S. Cai, S. Jiang, Z. Liu, Exponential cluster synchronization in directed community networks via adaptive nonperiodically intermittent pinning control, Physica A, 492 (2018), 1267–1280. http://dx.doi.org/10.1016/j.physa.2017.11.054 doi: 10.1016/j.physa.2017.11.054
![]() |
[20] |
S. Cai, Q. Jia, Z. Liu, Cluster synchronization for directed heterogeneous dynamical networks via decentralized adaptive intermittent pinning control, Nonlinear Dyn., 82 (2015), 689–702. http://dx.doi.org/10.1007/s11071-015-2187-x doi: 10.1007/s11071-015-2187-x
![]() |
[21] |
T. Wang, T. Li, X. Yang, S. Fei, Cluster synchronization for delayed Lure dynamical networks based on pinning control, Neurocomputing, 83 (2012), 72–82. http://dx.doi.org/10.1016/j.neucom.2011.11.014 doi: 10.1016/j.neucom.2011.11.014
![]() |
[22] |
J. Lu, Y. Huang, S. Ren, General decay synchronization and H∞ synchronization of multiweighted coupled reaction-diffusion neural networks, Int. J. Control Autom. Syst., 18 (2020), 1250–1263. http://dx.doi.org/10.1007/s12555-019-0380-2 doi: 10.1007/s12555-019-0380-2
![]() |
[23] |
J. Huang, C. Li, T. Huang, Q. Han, Lag quasi synchronization of coupled delayed systems with parameter mismatch by periodically intermittent control, Nonlinear Dyn., 71 (2013), 469–478. http://dx.doi.org/10.1007/s11071-012-0673-y doi: 10.1007/s11071-012-0673-y
![]() |
[24] |
Y. Xiao, W. Xu, X. Li, S. Tang, Adaptive complete synchronization of chaotic dynamical network with unknown and mismatched parameters, Chaos, 17 (2007), 033118. http://dx.doi.org/10.1063/1.2759438 doi: 10.1063/1.2759438
![]() |
[25] |
J. Huang, P. Wei, Lag synchronization in coupled chaotic systems via intermittent control, Procedia Engineering, 15 (2011), 568–572. http://dx.doi.org/10.1016/j.proeng.2011.08.107 doi: 10.1016/j.proeng.2011.08.107
![]() |
[26] |
J. Mei, M. Jiang, W. Xu, B. Wang, Finite-time synchronization control of complex dynamical networks with time delay, Commun. Nonlinear Sci., 18 (2013), 2462–2478. http://dx.doi.org/10.1016/j.cnsns.2012.11.009 doi: 10.1016/j.cnsns.2012.11.009
![]() |
[27] |
X. Ma, J. Wang, Pinning outer synchronization between two delayed complex networks with nonlinear coupling via adaptive periodically intermittent control, Neurocomputing, 199 (2016), 197–203. http://dx.doi.org/10.1016/j.neucom.2016.03.022 doi: 10.1016/j.neucom.2016.03.022
![]() |
[28] |
X. Lei, S. Cai, S. Jiang, Z. Liu, Adaptive outer synchronization between two complex delayed dynamical networks via aperiodically intermittent pinning control, Neurocomputing, 222 (2017), 26–35. http://dx.doi.org/10.1016/j.neucom.2016.10.003 doi: 10.1016/j.neucom.2016.10.003
![]() |
[29] |
P. Niamsup, T. Botmart, W. Weera, Modified function projective synchronization of complex dynamical networks with mixed time-varying and asymmetric coupling delays via new hybrid pinning adaptive control, Adv. Differ. Equ., 2017 (2017), 124. http://dx.doi.org/10.1186/s13662-017-1183-5 doi: 10.1186/s13662-017-1183-5
![]() |
[30] |
S. Cai, J. Hao, Z. Liu, Exponential synchronization of chaotic systems with time-varying delays and parameter mismatches via intermittent control, Chaos, 21 (2011), 023112. http://dx.doi.org/10.1063/1.3541797 doi: 10.1063/1.3541797
![]() |
[31] |
J. Xing, H. Jiang, C. Hu, Exponential synchronization for delayed recurrent neural networks via periodically intermittent control, Neurocomputing, 113 (2013), 122–129. http://dx.doi.org/10.1016/j.neucom.2013.01.041 doi: 10.1016/j.neucom.2013.01.041
![]() |
[32] |
K. Craik, Theory of human operators in control systems, Brit. J. Psychol., 38 (1947), 56–61. http://dx.doi.org/10.1111/j.2044-8295.1947.tb01141.x doi: 10.1111/j.2044-8295.1947.tb01141.x
![]() |
[33] |
M. Vince, The intermittency of control movements and the psychological refractory period, Brit. J. Psychol., 38 (1948), 149–157. http://dx.doi.org/10.1111/j.2044-8295.1948.tb01150.x doi: 10.1111/j.2044-8295.1948.tb01150.x
![]() |
[34] |
F. Navas, L. Stark, Sampling or intermittency in hand control system dynamics, Biophys. J., 8 (1968), 252–302. http://dx.doi.org/10.1016/S0006-3495(68)86488-4 doi: 10.1016/S0006-3495(68)86488-4
![]() |
[35] |
C. Deissenberg, Optimal control of linear econometric models with intermittent controls, Economics of Planning, 16 (1980), 49–56. http://dx.doi.org/10.1007/BF00351465 doi: 10.1007/BF00351465
![]() |
[36] |
E. Ronco, T. Arsan, P. Gawthrop, Open-loop intermittent feedback control: practical continuous-time GPC, IEE Proceedings-Control Theory and Applications, 146 (1999), 426–434. http://dx.doi.org/10.1049/ip-cta:19990504 doi: 10.1049/ip-cta:19990504
![]() |
[37] |
M. Zochowski, Intermittent dynamical control, Physica D, 145 (2000), 181–190. http://dx.doi.org/10.1016/S0167-2789(00)00112-3 doi: 10.1016/S0167-2789(00)00112-3
![]() |
[38] |
C. Li, G. Feng, X. Liao, Stabilization of nonlinear systems via periodically intermittent control, IEEE T. Circuits-II, 54 (2007), 1019–1023. http://dx.doi.org/10.1109/TCSII.2007.903205 doi: 10.1109/TCSII.2007.903205
![]() |
[39] |
Q. Song, T. Huang, Stabilization and synchronization of chaotic systems with mixed time-varying delays via intermittent control with non-fixed both control period and control width, Neurocomputing, 154 (2015), 61–69. http://dx.doi.org/10.1016/j.neucom.2014.12.019 doi: 10.1016/j.neucom.2014.12.019
![]() |
[40] |
Y. Asai, Y. Tasaka, K. Nomura, T. Nomura, M. Casadio, P. Morasso, A model of postural control in quiet standing: robust compensation of delay-induced instability using intermittent activation of feedback control, PLoS One, 4 (2009), 6169. http://dx.doi.org/10.1371/journal.pone.0006169 doi: 10.1371/journal.pone.0006169
![]() |
[41] | Z. Zhang, Y. He, M. Wu, L. Ding, Exponential stabilization of systems with time-varying delay by periodically intermittent control, Proceedings of 35th Chinese Control Conference, 2016, 1523–1528. http://dx.doi.org/10.1109/ChiCC.2016.7553306 |
[42] |
R. Bye, P. Neilson, The BUMP model of response planning: variable horizon predictive control accounts for the speed accuracy tradeoffs and velocity profiles of aimed movement, Hum. Movement Sci., 27 (2008), 771–798. http://dx.doi.org/10.1016/j.humov.2008.04.003 doi: 10.1016/j.humov.2008.04.003
![]() |
[43] |
P. Gawthrop, I. Loram, M. Lakie, H. Gollee, Intermittent control: a computational theory of human control, Biol. Cybern., 104 (2011), 31–51. http://dx.doi.org/10.1007/s00422-010-0416-4 doi: 10.1007/s00422-010-0416-4
![]() |
[44] |
T. Botmart, P. Niamsup, Exponential synchronization of complex dynamical network with mixed time-varying and hybrid coupling delays via intermittent control, Adv. Differ. Equ., 2014 (2014), 116. http://dx.doi.org/10.1186/1687-1847-2014-116 doi: 10.1186/1687-1847-2014-116
![]() |
[45] |
J. Huang, C. Li, W. Zhang, P. Wei, Projective synchronization of a hyperchaotic system via periodically intermittent control, Chinese Phys. B, 21 (2012), 090508. http://dx.doi.org/10.1088/1674-1056/21/9/090508 doi: 10.1088/1674-1056/21/9/090508
![]() |
[46] |
J. Gao, J. Cao, Aperiodically intermittent synchronization for switching complex networks dependent on topology structure, Adv. Differ. Equ., 2017 (2017), 244. http://dx.doi.org/10.1186/s13662-017-1261-8 doi: 10.1186/s13662-017-1261-8
![]() |
[47] |
X. Wu, J. Feng, Z. Nie, Pinning complex-valued complex network via aperiodically intermittent control, Neurocomputing, 305 (2018), 70–77. http://dx.doi.org/10.1016/j.neucom.2018.03.055 doi: 10.1016/j.neucom.2018.03.055
![]() |
[48] | L. Pecora, T. Carroll, Synchronization in chaotic systems, Phys. Rev. Lett., 64 (1990), 821. |
[49] |
T. Botmart, Exponential synchronization of master-slave neural networks with mixed time-varying delays via hybrid intermittent feedback control, IJPAM, 96 (2014), 59–78. http://dx.doi.org/10.12732/ijpam.v96i1.6 doi: 10.12732/ijpam.v96i1.6
![]() |
[50] |
Z. Zhang, Y. He, M. Wu, Q. Wang, Exponential synchronization of chaotic neural networks with time-varying delay via intermittent output feedback approach, Appl. Math. Comput., 314 (2017), 121–132. http://dx.doi.org/10.1016/j.amc.2017.07.019 doi: 10.1016/j.amc.2017.07.019
![]() |
[51] |
T. Botmart, P. Niamsup, X. Liu, Synchronization of non-autonomous chaotic systems with time-varying delay via delayed feedback control, Commun. Nonlinear Sci., 17 (2012), 1894–1907. http://dx.doi.org/10.1016/j.cnsns.2011.07.038 doi: 10.1016/j.cnsns.2011.07.038
![]() |
[52] |
Q. Song, J. Cao, Pinning synchronization of linearly coupled delays neural networks, Math. Comput. Simulat., 86 (2012), 39–51. http://dx.doi.org/10.1016/j.matcom.2011.07.008 doi: 10.1016/j.matcom.2011.07.008
![]() |
[53] |
C. Zheng, J. Cao, Robust synchronization of coupled neural networks with mixed delays and uncertain parameters by intermittent pinning control, Neurocomputing, 141 (2014), 153–159. http://dx.doi.org/10.1016/j.neucom.2014.03.042 doi: 10.1016/j.neucom.2014.03.042
![]() |
[54] | K. Gu, V. Kharitonov, J. Chen, Stability of time delay systems, Boston: Birkhäuser, 2003. http://dx.doi.org/10.1007/978-1-4612-0039-0 |
[55] |
P. Park, J. Ko, C. Jeong, Reciprocally convex approach to stability of systems with time-varying delays, Automatica, 47 (2011), 235–238. http://dx.doi.org/10.1016/j.automatica.2010.10.014 doi: 10.1016/j.automatica.2010.10.014
![]() |
[56] | S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear matrix inequalities in system and control theory, Philadephia: SIAM, 1994. http://dx.doi.org/10.1137/1.9781611970777 |
[57] |
C. Zhang, Y. He, M. Wu, Exponential synchronization of neural networks with time-varying mixed delays and sampled data, Neurocomputing, 74 (2010), 265–273. http://dx.doi.org/10.1016/j.neucom.2010.03.020 doi: 10.1016/j.neucom.2010.03.020
![]() |
[58] |
F. Yang, J. Mei, Z. Wu, Finite-time synchronization of neural networks with discrete and distributed delays via periodically intermittent memory feedback control, IET Control Theory A., 10 (2016), 1630–1640. http://dx.doi.org/10.1049/iet-cta.2015.1326 doi: 10.1049/iet-cta.2015.1326
![]() |
[59] |
Z. Wu, P. Shi, H. Su, J. Chu, Exponential synchronization of neural networks with discrete and distributed delays under time-varying sampling, IEEE T. Neur. Net. Lear., 23 (2012), 1368–1376. http://dx.doi.org/10.1109/TNNLS.2012.2202687 doi: 10.1109/TNNLS.2012.2202687
![]() |
[60] |
D. Xu, J. Pang, H. Su, Bipartite synchronization of signed networks via aperiodically intermittent control based on discrete-time state observations, Neural Networks, 144 (2021), 307–319. http://dx.doi.org/10.1016/j.neunet.2021.08.035 doi: 10.1016/j.neunet.2021.08.035
![]() |
[61] |
Y. Gao, Y. Li, Bipartite leader-following synchronization of fractional-order delayed multilayer signed networks by adaptive and impulsive controllers, Appl. Math. Comput., 430 (2022), 127243. http://dx.doi.org/10.1016/j.amc.2022.127243 doi: 10.1016/j.amc.2022.127243
![]() |
[62] |
L. Duan, M. Shi, C. Huang, M. Fang, New results on finite-time synchronization of delayed fuzzy neural networks with inertial effects, Int. J. Fuzzy Syst., 24 (2022), 676–685. http://dx.doi.org/10.1007/s40815-021-01171-1 doi: 10.1007/s40815-021-01171-1
![]() |
[63] |
L. Duan, M. Shi, L. Huang, New results on finite-/fixed-time synchronization of delayed diffusive fuzzy HNNs with discontinuous activations, Fuzzy Sets Syst., 416 (2021), 141–151. http://dx.doi.org/10.1016/j.fss.2020.04.016 doi: 10.1016/j.fss.2020.04.016
![]() |
[64] | Q. Wang, L. Duan, H. Wei, L. Wang, Finite-time anti-synchronisation of delayed Hopfield neural networks with discontinuous activations, Int. J. Control, in press. http://dx.doi.org/10.1080/00207179.2021.1912396 |
[65] |
Q. Fu, J. Cai, S. Zhong, Robust stabilization of memristor-based coupled neural networks with time-varying delays, Int. J. Control Autom. Syst., 17 (2019), 2666–2676. http://dx.doi.org/10.1007/s12555-018-0936-6 doi: 10.1007/s12555-018-0936-6
![]() |
[66] |
Q. Fu, S. Zhong, W. Jiang, W. Xie, Projective synchronization of fuzzy memristive neural networks with pinning impulsive control, J. Franklin I., 357 (2020), 10387–10409. http://dx.doi.org/10.1016/j.jfranklin.2020.08.015 doi: 10.1016/j.jfranklin.2020.08.015
![]() |
[67] |
H. Bao, J. Cao, J. Kurths, State estimation of fractional-order delayed memristive neural networks, Nonlinear Dyn., 94 (2018), 1215–1225. http://dx.doi.org/10.1007/s11071-018-4419-3 doi: 10.1007/s11071-018-4419-3
![]() |
[68] |
S. Hu, Y. Liu, Z. Liu, T. Chen, Q. Yu, L. Deng, et al., Synaptic long-term potentiation realized in pavlov's dog model based on a niox-based memristor, J. Appl. Phys., 116 (2014), 214502. http://dx.doi.org/10.1063/1.4902515 doi: 10.1063/1.4902515
![]() |