We explore the master-slave chaos synchronization of stochastic time-delay Lur'e systems within a networked environment. To tackle the challenges posed by potential mode-mismatch behavior and limited networked channel resources, an asynchronous and adaptive event-triggered (AAET) controller is employed. A criterion on the stochastic stability and L2−L∞ disturbance-suppression performance of the synchronization-error system is proposed by using a Lyapunov-Krasovskii functional, a Wirtinger-type inequality, the Itô formula, as well as a convex combination inequality. Then, a method for determining the desired AAET controller gains is proposed by decoupling the nonlinearities that arise from the Lyapunov matrices and controller gains. Finally, the applicability of the AAET control approach is validated by a Chua's circuit.
Citation: Xinling Li, Xueli Qin, Zhiwei Wan, Weipeng Tai. Chaos synchronization of stochastic time-delay Lur'e systems: An asynchronous and adaptive event-triggered control approach[J]. Electronic Research Archive, 2023, 31(9): 5589-5608. doi: 10.3934/era.2023284
[1] | Daochang Zhang, Dijana Mosić, Liangyun Chen . On the Drazin inverse of anti-triangular block matrices. Electronic Research Archive, 2022, 30(7): 2428-2445. doi: 10.3934/era.2022124 |
[2] | Miao Luo, Yousong Chen, Dawei Gao, Lijun Wang . Inversion study of vehicle frontal collision and front bumper collision. Electronic Research Archive, 2023, 31(2): 776-792. doi: 10.3934/era.2023039 |
[3] | Yongge Tian . Characterizations of matrix equalities involving the sums and products of multiple matrices and their generalized inverse. Electronic Research Archive, 2023, 31(9): 5866-5893. doi: 10.3934/era.2023298 |
[4] | Yan Dong . Local Hölder continuity of nonnegative weak solutions of inverse variation-inequality problems of non-divergence type. Electronic Research Archive, 2024, 32(1): 473-485. doi: 10.3934/era.2024023 |
[5] | Yony Raúl Santaria Leuyacc . Elliptic equations in R2 involving supercritical exponential growth. Electronic Research Archive, 2024, 32(9): 5341-5356. doi: 10.3934/era.2024247 |
[6] | Guo-Niu Han . On the existence of permutations conditioned by certain rational functions. Electronic Research Archive, 2020, 28(1): 149-156. doi: 10.3934/era.2020009 |
[7] | Xiaoping Fang, Youjun Deng, Wing-Yan Tsui, Zaiyun Zhang . On simultaneous recovery of sources/obstacles and surrounding mediums by boundary measurements. Electronic Research Archive, 2020, 28(3): 1239-1255. doi: 10.3934/era.2020068 |
[8] | Yiming Zhang, Zhiwei Pan, Shuyou Zhang, Na Qiu . Probabilistic invertible neural network for inverse design space exploration and reasoning. Electronic Research Archive, 2023, 31(2): 860-881. doi: 10.3934/era.2023043 |
[9] | Xinlin Cao, Huaian Diao, Jinhong Li . Some recent progress on inverse scattering problems within general polyhedral geometry. Electronic Research Archive, 2021, 29(1): 1753-1782. doi: 10.3934/era.2020090 |
[10] | Yang Gao, Qingzhong Ji . On the inverse stability of zn+c. Electronic Research Archive, 2025, 33(3): 1414-1428. doi: 10.3934/era.2025066 |
We explore the master-slave chaos synchronization of stochastic time-delay Lur'e systems within a networked environment. To tackle the challenges posed by potential mode-mismatch behavior and limited networked channel resources, an asynchronous and adaptive event-triggered (AAET) controller is employed. A criterion on the stochastic stability and L2−L∞ disturbance-suppression performance of the synchronization-error system is proposed by using a Lyapunov-Krasovskii functional, a Wirtinger-type inequality, the Itô formula, as well as a convex combination inequality. Then, a method for determining the desired AAET controller gains is proposed by decoupling the nonlinearities that arise from the Lyapunov matrices and controller gains. Finally, the applicability of the AAET control approach is validated by a Chua's circuit.
Throughout this work, Cp×n denotes the set involving p×n matrices with complex entries, and, for A∈Cp×n, rank(A) is its rank, A∗ is its conjugate-transpose matrix, N(A) is its null space, and R(A) is its range. The index ind(A) of A∈Cp×p is the smallest nonnegative integer k for which the equality rank(Ak)=rank(Ak+1) is satisfied. The symbol I denotes the identity matrix of adequate size. Standard notations PS and PS,T denote, respectively, the orthogonal projector onto a subspace S and a projector onto S along T when Cp is equal to the direct sum of the subspaces S and T.
Several definitions and properties of generalized inverses which are upgraded in this research are given. The Moore-Penrose inverse of A∈Cp×n is uniquely determined A†=X∈Cn×p as the solution to well-known Penrose equations [1]:
A=AXA,X=XAX,AX=(AX)∗,XA=(XA)∗. |
If X satisfies only equation XAX=X, it is an outer inverse of A. The outer inverse of A which is uniquely determined by the null space S and the range T is labeled with A(2)T,S=X∈Cn×p and satisfies
XAX=X,N(X)=S,R(X)=T, |
where s≤r=rank(A) is the dimension of the subspace T⊆Cn, and p−s is the dimension of the subspace S⊆Cp.
The following notation will be used:
Cp,n;k:={(A,W):A∈Cp×n, W∈Cn×p∖{0} and k=max{ind(AW),ind(WA)}}. |
The notion of the Drazin inverse was extended to rectangular matrices in [2]. For selected (A,W)∈Cp,n;k, the W-weighted Drazin inverse AD,W=X∈Cp×n of A is uniquely determined by the matrix equations
XWAWX=X,AWX=XWA,(AW)k+1XW=(AW)k. |
Especially, if p=n and W=I, AD,I:=AD reduces to the Drazin inverse of A. Further, for ind(A)=1, AD:=A# becomes the group inverse of A. Recall that [2]
AD,W=A[(WA)D]2=[(AW)D]2A. |
The notion of the core-EP inverse, proposed in [3] for a square matrix, was generalized to a rectangular matrix in [4]. If (A,W)∈Cp,n;k, the W-weighted core-EP inverse of A is the unique solution =X∈Cp×n to
WAWX=PR(WA)k,R((AW)k)=R(X). |
In a special case p=n and W=I, becomes the core-EP inverse
of A. According to original definitions in [5] and [6,7,8], it is important to note
![]() |
and
![]() |
Some useful characterizations and representations of the core-EP inverse are presented in [3,9,10,11,12,13,14]. In the case ind(A)=1, reduces to the core inverse
=A#AA† of A [15].
The weak group inverse (WGI) was presented for a square matrix in [16] as an extension of the group inverse. The WGI is extended in [17] to a rectangular matrix and in [18] to Hilbert space operators. For (A,W)∈Cp,n;k, the W-weighted WGI (W-WGI) of A is the unique solution Aⓦ,W=X∈Cp×n of the system [17,18]
![]() |
and it is expressed by [17,18]
![]() |
When p=n and W=I, Aⓦ,I:=Aⓦ reduces to the WGI of A
![]() |
Remark that, for 1=ind(A), Aⓦ=A#. Useful results about WGI were given in [17,18,19,20,21,22,23].
The concept of the m-weak group inverse (m-WGI) was introduced in [24] as an extension of the WGI. Exactly, if m∈N, the m-WGI of A∈Cn×n is the unique matrix Aⓦm=X∈Cn×n such that [25]
![]() |
(1.1) |
Recall that
![]() |
Clearly, Aⓦ1=Aⓦ, and particularly Aⓦ2=()3A2 becomes the generalized group (GG) inverse of A, established in [26]. It is interesting that, if ind(A)≤m, Aⓦm=AD. Various properties of m-WGI were presented in [24,25,27,28].
Recent research about m-WGI as well as the fact that m-WGI is an important extension of the WGI, GG, Drazin inverse, and group inverse motivated us to further investigate this topic. The current popular trend in the research of generalized inverses consists in defining new generalized inverses that are based on suitable combinations of existing generalized inverses as well as in their application in solving appropriate systems of linear equations. Considering the system (1.1) for defining m-WGI, our first aim is to solve a system of matrix equations which is an extension of the system (1.1) from the square matrix case to an arbitrary case. Since the m-WGI is restricted to square matrices, our main goal is to extend this notion to W-m-WGI inverses on rectangular matrices. To solve a certain system of matrix equations on rectangular complex matrices, we extend the notions of m-WGI, W-WGI, and the W-weighted Drazin inverse by introducing a wider class of generalized inverses, termed as the W-weighted m-WGI (W-m-WGI) for a rectangular matrix. Particularly, an extension of the GG inverse on rectangular matrices is obtained. It is important to mention that we recover significant results for the W-weighted Drazin inverse in a particular case. A class of systems of linear equations is found that can be efficiently solved applying W-m-WGI. This results is an extension of known results about the W-weighted Drazin solution and the Drazin solution of exact linear systems.
The global structure of the work is based on sections with the following content. Several characterizations for the W-m-WGI are proved in Section 2 without and with projectors. We develop important expressions for the W-m-WGI based on core–EP, Drazin, and Moore-Penorse inverses of proper matrices. As a consequence, we introduce the weighted version of GG inverse and give its properties. Limit and integral formulae for computing the W-m-WGI are part of Section 3. Section 4 investigates applications of the W-m-WGI in solving specific matrix equations. Numerical experiments are presented in Section 5.
We introduce the W-weighted m-WGI on rectangular matrices as a class of generalized inverses that includes notions of the m-WGI and the W-weighted WGI.
Theorem 2.1. If (A,W)∈Cp,n;k and m∈N, then X=(W)m+1(AW)m−1A is the unique solution to the matrix system
![]() |
(2.1) |
Proof. Using the identity AWW
=
, the subsequent transformations are obtained for X:=(
W)m+1(AW)m−1A:
![]() |
which further leads to
![]() |
Hence, X=(W)m+1(AW)m−1A is a solution to (2.1).
An arbitrary solution X to the system (2.1) satisfies
![]() |
which leads to the conclusion that X=(W)m+1(AW)m−1A is the unique solution to (2.1).
Definition 2.1. Under such conditions (A,W)∈Cp,n;k and m∈N, the W-weighted m-WGI (shortly W-m-WGI) inverse of A is defined by the expression
![]() |
Several special appearance forms of the W-m-WGI show its importance and are listed as follows:
− when p=n and W=I, the I-m-WGI coincides with the m-WGI Aⓦm=()m+1Am;
− if m=1, then (W)2A=Aⓦ,W, that is, the W-1-WGI reduces to the W-WGI;
− for m=2, the W-2-WGI is introduced as Aⓦ2,W=(W)3AWA and presents an extension of the GG inverse;
− in the case k≤m, it follows Aⓦm,W=AD,W (see Lemma 2.1).
Some computationally useful representations of the W-m-WGI are developed in subsequent statements.
Lemma 2.1. If (A,W)∈Cp,n;k, m∈N and l≥k, then
![]() |
Furthermore, for m≥k, it follows that Aⓦm,W=AD,W.
Proof. First, by induction on m, notice that gives
![]() |
Further, based on
![]() |
and
(WA)k[(WA)k]†=PR((WA)k)=PR((WA)l)=(WA)l[(WA)l]†, |
we obtain
![]() |
In the case m≥k, it follows that
Aⓦm,W=A[(WA)D]m+2(WA)k[(WA)k]†(WA)m=A[(WA)D]m+2(WA)m=A[(WA)D]2=AD,W. |
Remark 2.1. Note that Aⓦm,W=(WA)ⓦm implies the interesting identity WAⓦm,W=PR((WA)l)(WA)ⓦm for l≥k. This last identity is an extension of the classical property of the W-weighted Drazin inverse WAD,W=(WA)D. About the dual property AD,WW=(AW)D, if the equality
A is satisfied (which is not true in general; for details see [5]), we can verify that Aⓦm,W=
(AW)ⓦmA and so Aⓦm,WW=
(AW)ⓦmAW.
Representations for the W-2-WGI and W-weighted Drazin inverse are obtained as consequences of Lemma 2.1 when m=2 or m=l≥k, respectively.
Corollary 2.1. If (A,W)∈Cp,n;k and l≥k, then
![]() |
and
![]() |
Notice that Corollary 2.1 recovers the known expressions for the W-weighted Drazin inverse [29,30].
In Lemma 2.2, we show that the W-m-WGI Aⓦm,W is an outer inverse of WAW and find its range and null spaces.
Lemma 2.2. If (A,W)∈Cp,n;k and m∈N, the following representations are valid:
(i) Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m);
(ii) WAWAⓦm,W=PR((WA)k),N([(WA)k]∗(WA)m);
(iii) Aⓦm,WWAW=PR((AW)k),N([(WA)k]∗(WA)m+1W).
Proof. (ⅰ) Based on Lemma 2.1 it follows that Aⓦm,W=A(WA)k[(WA)k+m+2]†(WA)m, which yields R(Aⓦm,W)⊆R((AW)k) and
Aⓦm,WWAWAⓦm,W=A(WA)k[(WA)k+m+2]†(WA)k+m+2[(WA)k+m+2]†(WA)m=A(WA)k[(WA)k+m+2]†(WA)m=Aⓦm,W. |
Another application of Lemma 2.1 yields
(AW)k=[(AW)D]m+2(AW)k+m+2=A[(WA)D]m+2(WA)k+m+1W=A[(WA)D]m+2(WA)k[(WA)k]†(WA)k+m+1W=Aⓦm,W(WA)k+1W | (2.2) |
and so R((AW)k)⊆R(Aⓦm,W). Thus, R(Aⓦm,W)=R((AW)k). Also,
N([(WA)k]∗(WA)m)=N([(WA)k+m+2]∗(WA)m)=N([(WA)k+m+2]†(WA)m)=N(A(WA)k[(WA)k+m+2]†(WA)m)=N(Aⓦm,W). |
(ⅱ) By the part (ⅰ), WAWAⓦm,W is a projector, and
N(WAWAⓦm,W)=N(Aⓦm,W)=N([(WA)k]∗(WA)m). |
The equalities WAWAⓦm,W=(WA)k+2[(WA)k+m+2]†(WA)m and
(WA)k=(WA)k+2[(WA)D]2=(WA)k+2[(WA)k+2]†(WA)k+2[(WA)D]2=(WA)k+2PR([(WA)k+2]∗)[(WA)D]2=(WA)k+2PR([(WA)m+k+2]∗)[(WA)D]2=(WA)k+2[(WA)m+k+2]†(WA)m+k+2[(WA)D]2=WAWAⓦm,W(WA)k+2[(WA)D]2=WAWAⓦm,W(WA)k |
imply R(WAWAⓦm,W)=R((WA)k).
(ⅲ) It is clear, by (ⅰ), that R(Aⓦm,WWAW)=R(Aⓦm,W)=R((AW)k). The identity N(Aⓦm,WWAW)=N([(WA)k]∗(WA)m+1W) is verified in a similar manner as in (ⅰ).
Remark 2.2. For A∈Cm×n, B∈Cq×t, C∈Cs×p, M∈Cp×m, and N∈Cn×q, by [31,32], the (M,N)-weighted (B,C)-inverse of A is represented by A(2,M,N)(B,C)=(MAN)(2)R(B),N(C). By Lemma 2.2, Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m), and thus Aⓦm,W is the (W,W)-weighted ((AW)k),[(WA)k]∗(WA)m)-inverse of A. Since the (B,C)-inverse of A is given as A(2)(B,C)=A(2)R(B),N(C) [33], it follows that Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m) is the ((AW)k,[(WA)k]∗(WA)m)-inverse of WAW.
Lemma 2.2 and the Urquhart formula [1] give the next representations for Aⓦm,W.
Corollary 2.2. If (A,W)∈Cp,n;k and m∈N, the W-m-WGI of A is represented as
Aⓦm,W=(AW)k([(WA)k]∗(WA)m+k+1W)†[(WA)k]∗(WA)m. |
If m=2 or m=k in Lemma 2.2 and Corollary 2.2, we obtain the next properties related to the W-2-WGI and W-weighted Drazin inverse.
Corollary 2.3. If (A,W)∈Cp,n;k, the following statements hold:
(i) Aⓦ2,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)2)=(AW)k([(WA)k]∗(WA)k+3W)†[(WA)k]∗(WA)2;
(ii) WAWAⓦ2,W=PR((WA)k),N([(WA)k]∗(WA)2);
(iii) Aⓦ2,WWAW=PR((AW)k),N([(WA)k]∗(WA)3W);
(iv) AD,W=(WAW)(2)R((AW)k),N((WA)k)=(AW)k([(WA)k]∗(WA)2k+1W)†[(WA)k]∗(WA)k;
(v) WAWAD,W=PR((WA)k),N((WA)k);
(vi) AD,WWAW=PR((AW)k),N((AW)k).
Some necessary and sufficient conditions for a rectangular matrix to be the W-m-WGI are considered.
Theorem 2.2. If (A,W)∈Cp,n;k, X∈Cp×n, and m∈N, the subsequent statements are equivalent:
(i) X=Aⓦm,W;
(ii) AWX=(W)m(AW)m−1A and R(X)=R((AW)k);
(iii) AWX=(W)m(AW)m−1A and R(X)⊆R((AW)k);
(iv) AWXWX=X, X(WA)k+1W=(AW)k and [(WA)k]∗(WA)m+1WX=[(WA)k]∗(WA)m;
(v) XWAWX=X, R(X)=R((AW)k) and [(WA)k]∗(WA)m+1WX=[(WA)k]∗(WA)m;
(vi) XWAWX=X, AWX=(W)m(AW)m−1A and XWA=(
W)m+1(AW)mA;
(vii) XWAWX=X, WAWX=W(W)m(AW)m−1A and XWAW=(
W)m+1(AW)m+1;
(viii) XWAWX=X, AWXWA=(W)m(AW)mA, AWX=(
W)m(AW)m−1A and XWA=(
W)m+1(AW)mA;
(ix) XWAWX=X, WAWXWAW=W(W)m(AW)m+1, WAWX=W(
W)m(AW)m−1A and XWAW=(
W)m+1(AW)m+1;
(x) X=WAWX and AWX=(
W)m(AW)m−1A (or WAWX=W(
W)m(AW)m−1A);
(xi) X=AWWX and
WX=(
W)m+1(AW)m−1A;
(xii) X=AD,WWAWX and AWX=(W)m(AW)m−1A (or WAWX=W(
W)m(AW)m−1A);
(xiii) X=(W)m+1(AW)m+1X and AWX=(
W)m(AW)m−1A (or WAWX=W(
W)m(AW)m−1A);
(xiv) X=XW(W)m(AW)m−1A and XWA=(
W)m+1(AW)mA (or XWAW=(
W)m+1(AW)m+1).
Proof. (ⅰ) ⇒ (ⅱ): It follows from Theorem 2.1 and Lemma 2.2.
(ⅱ) ⇒ (ⅲ): This implication is obvious.
(ⅲ) ⇒ (ⅰ): Because R(X)⊆R((AW)k), we have
X=(AW)kU=(AW)k[(AW)k]†(AW)kU=(AW)k[(AW)k]†X, |
for some U∈Cp×n. Notice that, by AWX=(W)m(AW)m−1A,
![]() |
An application of Theorem 2.1 leads to the conclusion X=Aⓦm,W.
(ⅰ) ⇒ (ⅳ): For X=Aⓦm,W, Theorem 2.1 implies AWXWX=X. The equality (2.2) gives X(WA)k+1W=(AW)k. Using Lemma 2.1, we get X=A(WA)k[(WA)k+m+2]†(WA)m, which implies
[(WA)k]∗(WA)m+1WX=[(WA)k]∗(WA)m+1WA(WA)k[(WA)k+m+2]†(WA)m=[(WA)k]∗(WA)k+m+2[(WA)k+m+2]†(WA)m=[(WA)k]∗(WA)k[(WA)k]†(WA)m=[(WA)k]∗(WA)m. |
(ⅳ) ⇒ (ⅴ): Notice, by X(WA)k+1W=(AW)k and
X=AWXWX=(AW)2(XW)2X=⋯=(AW)r(XW)rX, | (2.3) |
for arbitrary r∈N, that R(X)=R((AW)k). Hence, X=(AW)kU, for some U∈Cp×n, and
XWAWX=XWAW(AW)kU=(X(WA)k+1W)U=(AW)kU=X. |
(ⅴ) ⇒ (ⅰ): The assumptions R(X)=R((AW)k) and XWAWX=X give (AW)k=XV=XWAW(XV)=XW(AW)k+1, for some V∈Cn×p. Since X=(AW)kU, for some U∈Cp×n, we get
AWXWX=AWXW(AW)kU=AW(XW(AW)k+1)(AW)DU=AW(AW)k(AW)DU=(AW)kU=X. |
The assumption [(WA)k]∗(WA)m+1WX=[(WA)k]∗(WA)m yields
(WA)k[(WA)k]†(WA)m+1WX=([(WA)k]†)∗[(WA)k]∗(WA)m+1WX=([(WA)k]†)∗[(WA)k]∗(WA)m=(WA)k[(WA)k]†(WA)m. |
Because (2.3) holds, we obtain
![]() |
Theorem 2.1 gives X=Aⓦm,W.
(ⅰ) ⇒ (ⅵ) ⇒ (ⅶ): These implications are clear.
(ⅶ) ⇒ (ⅰ): Using XWAWX=X, WAWX=W(W)m(AW)m−1A and XWAW=(
W)m+1(AW)m+1, we get
![]() |
(ⅵ) ⇔ (ⅷ) and (ⅶ) ⇔ (ⅸ): These equivalences are evident.
(ⅰ) ⇒ (ⅹ): From X=(W)m+1(AW)m−1A, we observe
![]() |
(ⅹ) ⇒ (ⅰ): Applying X=WAWX and AWX=(
W)m(AW)m−1A, we obtain X=
W(AWX)=
W(
W)m(AW)m−1A=(
W)m+1(AW)m−1A.
(v) ⇔ (xiv): This equivalence follows as (ⅰ) ⇔ (ⅶ).
We also characterize the W-m-WGI in the following two ways.
Theorem 2.3. If (A,W)∈Cp,n;k and m∈N, then
(i) Aⓦm,W is the unique solution to
WAWX=PR((WA)k),N([(WA)k]∗(WA)m)andR(X)⊆R((AW)k); | (2.4) |
(ii) Aⓦm,W is the unique solution to
XWAW=PR((AW)k),N([(WA)k]∗(WA)m+1W)andR(X∗)⊆R([(WA)m]∗(WA)k). | (2.5) |
Proof. (ⅰ) By Lemma 2.2, X=Aⓦm,W is a solution to (2.4). If the system (2.4) has two solutions X and X1, notice
WAW(X−X1)=PR((WA)k),N([(WA)k]∗(WA)m)−PR((WA)k),N([(WA)k]∗(WA)m)=0 |
and R(X−X1)⊆R((AW)k). Therefore,
R(X−X1)⊆N(WAW)∩R((AW)k)⊆N((AW)k)∩R((AW)k)={0}, |
i.e., X=X1 is the unique solution of the system of Eqs (2.4).
(ⅱ) Lemmas 2.1 and 2.2 imply validity of (2.5) for X=Aⓦm,W=A(WA)k[(WA)k+m+2]†(WA)m.
The assumption that two solutions X and X1 satisfy (2.5) leads to the conclusion
R(X∗−X∗1)⊆R([(WA)m]∗(WA)k)∩N((WAW)∗)⊆R((WAWAⓦm,W)∗)∩N((WAWAⓦm,W)∗)={0}, |
that is, X=X1.
Corresponding characterizations of the W-2-WGI and W-weighted Drazin inverse are derived as particular cases m=2 and m=k of Theorem 2.3, respectively.
Corollary 2.4. The following statements are valid for (A,W)∈Cp,n;k:
(i) Aⓦ2,W is the unique solution to
WAWX=PR((WA)k),N([(WA)k]∗(WA)2)andR(X)⊆R((AW)k); |
(ii) Aⓦ2,W is the unique solution to
XWAW=PR((AW)k),N([(WA)k]∗(WA)3W)andR(X∗)⊆R([(WA)2]∗(WA)k); |
(iii) AD,W is the unique solution to
WAWX=PR((WA)k),N((WA)k)andR(X)⊆R((AW)k); |
(iv) AD,W is the unique solution to
XWAW=PR((AW)k),N((AW)k)andR(X∗)⊆R([(WA)k]∗). |
Some formulae for the W-m-WGI are given in this section.
We present a relation between a nonsingular bordered matrix and the W-m-WGI. Precisely, by Theorem 3.1, when the inverse of a proper bordered matrix is known, then the corresponding position of that inverse gives the W-m-WGI.
Theorem 3.1. Let (A,W)∈Cp,n;k and m∈N. Assume that full-column rank matrices G and H∗ fulfill
N([(WA)k]∗(WA)m)=R(G)andR((AW)k)=N(H). |
Then,
N=[WAWGH0] |
is nonsingular, and
N−1=[Aⓦm,W(I−Aⓦm,WWAW)H†G†(I−WAWAⓦm,W)−G†(WAW−WAWAⓦm,WWAW)H†]. | (3.1) |
Proof. Lemma 2.2 gives Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m). Since
R(I−WAWAⓦm,W)=N(WAWAⓦm,W)=N(Aⓦm,W)=N([(WA)k]∗(WA)m)=R(G)=R(GG†)=N(I−GG†), |
we have (I−GG†)(I−WAWAⓦm,W)=0, that is, GG†(I−WAWAⓦm,W)=(I−WAWAⓦm,W). From R(Aⓦm,W)=R((AW)k)=N(H), we get HAⓦm,W=0. Set Y for the right hand side of (3.1). Then,
NY=[WAWAⓦm,W+GG†(I−WAWAⓦm,W)WAW(I−Aⓦm,WWAW)H†−GG†(I−WAWAⓦm,W)WAWH†HAⓦmH(I−AⓦmWAW)H†]=[WAWAⓦm,W+I−WAWAⓦm,W(I−WAWAⓦm,W)WAWH†−(I−WAWAⓦm,W)WAWH†0HH†]=[I00I]=I. |
and similarly YN=I. So, N is nonsingular with N−1=Y.
We investigate limit and integral expressions for W-m-WGI motivated by limit and integral formulae of known generalized inverses [34,35,36,37].
Theorem 3.2. If (A,W)∈Cp,n;k, m∈N, and l≥k, then
Aⓦm,W=limλ→0A(WA)l[(WA)l+m+2]∗((WA)l+m+2[(WA)l+m+2]∗+λI)−1(WA)m=limλ→0A(WA)l([(WA)l+m+2]∗(WA)l+m+2+λI)−1[(WA)l+m+2]∗(WA)m. |
Proof. Lemma 2.1 gives Aⓦm,W=A(WA)l[(WA)l+m+2]†(WA)m. According to the limit representation for the Moore-Penrose inverse given in [36], we derive
[(WA)l+m+2]†=limλ→0[(WA)l+m+2]∗((WA)l+m+2[(WA)l+m+2]∗+λI)−1=limλ→0([(WA)l+m+2]∗(WA)l+m+2+λI)−1[(WA)l+m+2]∗, |
which implies the rest.
Since W-m-WGI belongs to outer inverses, the limit representation of the outer inverse proposed in [35] implies the limit representation of the W-m-WGI.
Theorem 3.3. Let (A,W)∈Cp,n;k and m∈N. Suppose that H1∈Cp×ss, R(H1)=R((AW)k), H2∈Cs×ns, and n−s is the dimension of the subspace N(H2)=N([(WA)k]∗(WA)m) in Cn. Then,
Aⓦm=limv→0H1(vI+H2WAWH1)−1H2=limu→0(uI+H1H2WAW)−1H1H2=limv→0H1H2(vI+WAWH1H2)−1. |
Proof. Since Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m), by [35, Theorem 7], it follows that
Aⓦm,W=limu→0H1(uI+H2WAWH1)−1H2. |
Some integral formulae are established for the W-m-WGI.
Theorem 3.4. If (A,W)∈Cp,n;k, m∈N, and l≥k, then
Aⓦm,W=∫∞0A(WA)l[(WA)l+m+2]∗exp(−(WA)l+m+2[(WA)l+m+2]∗v)(WA)mdv. |
Proof. According to [34],
[(WA)l+m+2]†=∫∞0[(WA)l+m+2]∗exp(−(WA)l+m+2[(WA)l+m+2]∗v)dv. |
The proof is completed utilizing Aⓦm,W=A(WA)l[(WA)l+m+2]†(WA)m.
Theorem 3.5. Let (A,W)∈Cp,n;k and m∈N. If H∈Cp×n, R(H)=R((AW)k), and N(H)=N([(WA)k]∗(WA)m), then
Aⓦm=∞∫0exp[−H(HWAWH)∗HWAWv]H(HWAWH)∗Hdv. |
Proof. Applying [37, Theorem 2.2], it follows that
Aⓦm,W=(WAW)(2)R((AW)k),N([(WA)k]∗(WA)m)=∞∫0exp[−H(HWAWH)∗HWAWv]H(HWAWH)∗Hdv, |
which completes the proof.
The W-m-WGI is applicable in studying solvability of some matrix and vector equations.
In the case that A∈Cm×n, x∈Cn, and b∈Cm, to find approximation solution to inconsistent system of linear equations Ax=b, a classical approach is to ask for, so called, generalized solutions, defined as solutions to GAx=Gb with respect to an appropriate matrix G∈Cn×m [38]. It is important to mention that the system GAx=Gb is consistent in the case rank(GA)=rank(G). Such approach has been exploited extensively. One particular choice is G=A∗, which leads to widely used least-squares solutions obtained as solutions to the normal equation A∗Ax=A∗b. Another important choice is m=n, G=Ak, and k=ind(A), which leads to the so called Drazin normal equation Ak+1x=Akb and usage of the Drazin inverse solution ADb.
Starting from the known equation WAWx=b, we use G=[(WA)k]∗(WA)m to obtain the following equation (4.1).
Theorem 4.1. If m∈N and (A,W)∈Cp,n;k, the general solution to
[(WA)k]∗(WA)m+1Wx=[(WA)k]∗(WA)mb,b∈Cn, | (4.1) |
is of the form
x=Aⓦm,Wb+(I−Aⓦm,WWAW)u, | (4.2) |
for arbitrary vector u∈Cn.
Proof. Let x be represented as in (4.2). Theorem 2.2 gives
[(WA)k]∗(WA)m+1WAⓦm,W=[(WA)k]∗(WA)m. |
So, x is a solution to (4.1) by
[(WA)k]∗(WA)m+1Wx=[(WA)k]∗(WA)m+1WAⓦm,Wb+[(WA)k]∗(WA)m+1W(I−Aⓦm,WWAW)u=[(WA)k]∗(WA)mb. |
If Eq (4.1) has a solution x, based on
Aⓦm,W=A[(WA)D]m+2(WA)k[(WA)k]†(WA)m, |
one concludes
Aⓦm,Wb=A[(WA)D]m+2(WA)k[(WA)k]†(WA)mb=A[(WA)D]m+2([(WA)k]†)∗[(WA)k]∗(WA)mb=A[(WA)D]m+2([(WA)k]†)∗[(WA)k]∗(WA)m+1Wx=A[(WA)D]m+2(WA)k[(WA)k]†(WA)m+1Wx=Aⓦm,WWAWx, |
which yields
x=Aⓦm,Wb+x−Aⓦm,WWAWx=Aⓦm,Wb+(I−Aⓦm,WWAW)x. |
Hence, x possesses the pattern (4.2).
Choosing m=2 or m≥k in Theorem 4.1, we obtain the next result.
Corollary 4.1. Let b∈Cn and (A,W)∈Cp,n;k.
(i) The general solution to
[(WA)k]∗(WA)3Wx=[(WA)k]∗(WA)2b | (4.3) |
possesses the form
x=Aⓦ2,Wb+(I−Aⓦ2,WWAW)u, |
for arbitrary u∈Cn.
(ii) If m≥k, the general solution to
(WA)m+1Wx=(WA)mb | (4.4) |
(or equivalently [(WA)k]∗(WA)m+1Wx=[(WA)k]∗(WA)mb)
possesses the form
x=AD,Wb+(I−AD,WWAW)u, |
for arbitrary u∈Cn.
We study assumptions which ensure the uniqueness of the solution to Eq (4.1).
Theorem 4.2. If m∈N and (A,W)∈Cp,n;k, x=Aⓦm,Wb is the unique solution to (4.1) in the space R((AW)k).
Proof. Theorem 4.1 implies that (4.1) has a solution x=Aⓦm,Wb∈R(Aⓦm,W)=R((AW)k).
For two solutions x,x1∈R((AW)k) to (4.1), by Lemma 2.2, we obtain
x−x1∈R((AW)k)∩N([(WA)k]∗(WA)m+1W)=R(Aⓦm,WWAW)∩N(Aⓦm,WWAW)={0}. |
Hence, the Eq (4.1) has uniquely determined solution x=Aⓦm,Wb in R((AW)k).
Theorem 4.2 gives the next particular results.
Corollary 4.2. Let b∈Cn and (A,W)∈Cp,n;k.
(i) x=Aⓦ2,Wb is the unique solution in R((AW)k) to (4.3).
(ii) x=AD,Wb is the unique solution in R((AW)k) to (4.4).
Recall that, by [39], for W∈Cn×p∖{0}, A∈Cp×n, ind(AW)=k1, ind(WA)=k2, and b∈R((WA)k2), x=AD,Wb is the uniquely determined solution to
WAWx=b,x∈R((AW)k1). |
Specifically, if A∈Cn×n, W=I, ind(A)=k, and b∈R(Ak), x=ADb is the unique solution to [40]
Ax=b,x∈R(Ak). |
For 1=ind(A) and b∈R(A), x=A#b is the uniquely determined solution to Ax=b. Notice that Theorem 4.2 and Corollary 4.2 recover the above mentioned results from [39] and [40].
The identity (resp., zero) ℓ×ℓ matrix will be denoted by Iℓ (resp., 0ℓ). Denote by Dpℓ, p≥1, the ℓ×ℓ matrix with its pth leading diagonal parallel filled by the entries of the vector 1={1,…,1}∈Cℓ−p and 0 in all other positions.
We perform numerical tests on the class of test matrices of index ℓ, given by
{(CIℓC1Iℓ0ℓC2Dpℓ), ℓ>0}, C,C1,C2∈C. | (5.1) |
Example 5.1. The test matrix A in this example is derived using ℓ=4 and C=2,C1=3,C2=1 from the test set (5.1), and W is derived using ℓ=4 and C=1,C1=3/2,C2=4 from the test set (5.1). Our intention is to perform numerical experiments on integer matrices using exact computation. Appropriate matrices are
A=(2I43I404D14)=(2000300002000300002000300002000300000100000000100000000100000000),W=(I43/2I4044D14)=(10003200001000320000100032000010003200000400000000400000000400000000). |
The matrices WA and AW fulfill k=ind(WA)=ind(AW)=2.
(a) In the first part of this example, we calculate the Drazin inverse, the core-EP inverse, and W-m-WGI class of inverses based on their definitions. The Drazin inverse of WA is computed using
(WA)D=(WA)2(WA5)†(WA)2=(1/2I43/4I4+3/8D14+3/2D24+3/4D340404)=(120003438323401200034383200120003438000120003400000000000000000000000000000000), |
and the core-EP inverse of WA is equal to
![]() |
The W-weighted Drazin inverse of A is equal to
AD,W=A[(WA)D]2=(WA)D |
and the W-weighted core-EP inverse of A is equal to
![]() |
The W-WGI (or W-1-WGI) inverse of A is given by
![]() |
the W-2-WGI inverse of A is equal to
![]() |
and for each m≥k the W-m-WGI inverse of A satisfies
![]() |
Additionally, Aⓦm=AD is checked for each m≥ind(A).
(b) Representations involved in Lemma 2.1 are verified using
![]() |
(c) In this part of the example, our goal is to verify results of Theorem 2.2.
(c1) The statements involved in Theorem 2.2(ⅳ) are verified as follows.
- In the case m=1 verification is confirmed by
AWAⓦ,WWAⓦ,W=Aⓦ,W;Aⓦ,W(WA)3W=(4I46I4+24D14+12D24+48D340404)=(4000624124804000624120040006240004000600000000000000000000000000000000)=(AW)2;[(WA)2]∗(WA)2WAⓦ,W=(8I412I4+6D140404)=(800012600080001260008000126000800012120001890061200945290246120362745291224612184527452)=[(WA)2]∗WA. |
- In the case m=2 results are confirmed by
AWAⓦ2,WWAⓦ2,W=Aⓦ2,W;Aⓦ2,W(WA)3W=(AW)2;[(WA)2]∗(WA)3WAⓦ2,W=2[(WA)2]∗WA=[(WA)2]∗(WA)2. |
- Representations in the case m≥3 are confirmed by
AWAⓦm,WWAⓦm,W=Aⓦm,W;Aⓦm,W(WA)3W=(AW)2;[(WA)2]∗(WA)m+1WAⓦm,W=m[(WA)2]∗WA=[(WA)2]∗(WA)m. |
(c2) The statements involved in Theorem 2.2(ⅵ) are verified using verification of part (ⅳ) and the following computation.
- In the case m=1
![]() |
- In the case m≥2 results are confirmed by
![]() |
Example 5.2. Consider A and W from Example 5.1 and the vector b=(22011201)T with intention to verify Theorem 4.1.
In the case m=1 of (4.1), the general solution to [(WA)2]∗(WA)2Wx=[(WA)2]∗WAb is equal to
x1=Aⓦ,Wb+(I−Aⓦ,WWAW)u, |
where u=(u1u2u3u4u5u6u7u8)T is a vector of unknown variables. Symbolic calculation gives
x1=(−3u52−6u6−3u7−12u8+52−3u62−6u7−3u8+52−3u72−6u8+3814(5−6u8)u5u6u7u8). |
Obtained vector x1 is verified using [(WA)2]∗(WA)2Wx1=[(WA)2]∗WAb=(404062060901594292).
In the case m≥2 of (4.1), the general solution to [(WA)2]∗(WA)m+1Wx=[(WA)2]∗(WA)mb is equal to
xm=Aⓦm,Wb+(I−Aⓦm,WWAW)u. |
Symbolic calculus produces
xm=(−3u52−6u6−3u7−12u8+134−3u62−6u7−3u8+4−3u72−6u8+3814(5−6u8)u5u6u7u8). |
Correctness of the vector xm is verified using
[(WA)2]∗(WA)m+1Wx2=[(WA)2]∗(WA)mb=(m−1)(1041281240156270426609). |
In this research, we present an extension of the m-weak group inverse (or m-WGI) on the set of rectangular matrices, called the W-weighted m-WGI (or W-m-WGI). The W-m-WGI class presents a new, wider class of generalized inverses since this class involves the m-WGI, W-weighted weak group, and W-weighted Drazin inverse as special cases. Various characterizations and representations of W-m-WGI are developed. Usability of the W-m-WGI class in solving some constrained and unconstrained matrix equations and linear systems is considered. Some new properties of the weighted generalized group inverse and some known properties of the W-weighted Drazin inverse are obtained as corollaries. The given numerical examples confirm the obtained results.
There is increasing interest in the investigation of the WGI and its generalizations, and so for further research in the near future, it may be interesting to consider its generalizations to Hilbert space operators or tensors, iterative methods for approximation of W-m-WGI, or recurrent neural network (RNN) models for computing W-m-WGI.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Dijana Mosić and Predrag Stanimirović are supported by the Ministry of Education, Science and Technological Development, Republic of Serbia, grant no. 451-03-65/2024-03/200124.
Predrag Stanimirović acknowledges support from the Science Fund of the Republic of Serbia, (No. 7750185, Quantitative Automata Models: Fundamental Problems and Applications - QUAM).
This work is supported by the Ministry of Science and Higher Education of the Russian Federation (Grant No. 075-15-2022-1121).
P. S. Stanimirović is an editorial board member for Electronic Research Archive and was not involved in the editorial review or the decision to publish this article. All authors declare that there are no competing interests.
[1] |
L. O. Chua, L. Kocarev, K. Eckert, M. Itoh, Experimental chaos synchronization in Chua's circuit, Int. J. Bifurcat. Chaos, 2 (1992), 705–708. https://doi.org/10.1142/S0218127492000811 doi: 10.1142/S0218127492000811
![]() |
[2] |
H. Sompolinsky, A. Crisanti, H. J. Sommers, Chaos in random neural networks, Phys. Rev. Lett., 61 (1988), 259. https://doi.org/10.1103/PhysRevLett.61.259 doi: 10.1103/PhysRevLett.61.259
![]() |
[3] | J. A. K. Suykens, A. Huang, L. O. Chua, A family of n-scroll attractors from a generalized Chua's circuit, AEU Int. J. Electron. Commun., 51 (1997), 131–137. |
[4] |
Y. Fan, Z. Wang, X. Huang, H. Shen, Using partial sampled-data information for synchronization of chaotic Lur'e systems and its applications: an interval-dependent functional method, Inform. Sci., 619 (2023), 358–373. https://doi.org/10.1016/j.ins.2022.11.066 doi: 10.1016/j.ins.2022.11.066
![]() |
[5] |
L. Wang, S. Jiang, M. F. Ge, C. Hu, J. Hu, Finite-/fixed-time synchronization of memristor chaotic systems and image encryption application, IEEE Trans. Circuits-I, 68 (2021), 4957–4969. https://doi.org/10.1109/TCSI.2021.3121555 doi: 10.1109/TCSI.2021.3121555
![]() |
[6] |
S. Moon, J. J. Baik, J. M. Seo, Chaos synchronization in generalized Lorenz systems and an application to image encryption, Commun. Nonlinear Sci., 96 (2021), 105708. https://doi.org/10.1016/j.cnsns.2021.105708 doi: 10.1016/j.cnsns.2021.105708
![]() |
[7] |
M. Roohi, C. Zhang, Y. Chen, Adaptive model-free synchronization of different fractional-order neural networks with an application in cryptography, Nonlinear Dyn., 100 (2020), 3979–4001. https://doi.org/10.1007/s11071-020-05719-y doi: 10.1007/s11071-020-05719-y
![]() |
[8] |
V. K. Yadav, V. K. Shukla, S. Das, Exponential synchronization of fractional-order complex chaotic systems and its application, Chaos Solitons Fractals, 147 (2021), 110937. https://doi.org/10.1016/j.chaos.2021.110937 doi: 10.1016/j.chaos.2021.110937
![]() |
[9] |
S. Lakshmanan, M. Prakash, C. P. Lim, R. Rakkiyappan, P. Balasubramaniam, S. Nahavandi, Synchronization of an inertial neural network with time-varying delays and its application to secure communication, IEEE Trans. Neural Net. Learn. Syst., 29 (2018), 195–207. https://doi.org/10.1109/TNNLS.2016.2619345 doi: 10.1109/TNNLS.2016.2619345
![]() |
[10] |
A. M. Gonzalez-Zapata, E. Tlelo-Cuautle, I. Cruz-Vega, W. D. León-Salas, Synchronization of chaotic artificial neurons and its application to secure image transmission under MQTT for IoT protocol, Nonlinear Dyn., 104 (2021), 4581–4600. https://doi.org/10.1007/s11071-021-06532-x doi: 10.1007/s11071-021-06532-x
![]() |
[11] |
W. Shao, Y. Fu, M. Cheng, L. Deng, D. Liu, Chaos synchronization based on hybrid entropy sources and applications to secure communication, IEEE Photonic. Tech. Lett., 33 (2021), 1038–1041. https://doi.org/10.1109/LPT.2021.3093584 doi: 10.1109/LPT.2021.3093584
![]() |
[12] |
Q. Li, X. Liu, Q. Zhu, S. Zhong, J. Cheng, Stochastic synchronization of semi-Markovian jump chaotic Lur'e systems with packet dropouts subject to multiple sampling periods, J. Franklin I., 356 (2019), 6899–6925. https://doi.org/10.1016/j.jfranklin.2019.06.005 doi: 10.1016/j.jfranklin.2019.06.005
![]() |
[13] |
Y. Li, J. Feng, J. Wang, Mean square synchronization for stochastic delayed neural networks via pinning impulsive control, Electron. Res. Arch., 30 (2022), 3172–3192. http://dx.doi.org/10.3934/era.2022161 doi: 10.3934/era.2022161
![]() |
[14] |
T. Yang, Z. Wang, J. Xia, H. Shen, Sampled-data exponential synchronization of stochastic chaotic Lur'e delayed systems, Math. Comput. Simulation, 203 (2023), 44–57. https://doi.org/10.1016/j.matcom.2022.06.010 doi: 10.1016/j.matcom.2022.06.010
![]() |
[15] |
Y. Zhou, X. H. Chang, W. Huang, Z. M. Li, Quantized extended dissipative synchronization for semi-Markov switching Lur'e systems with time delay under deception attacks, Commun. Nonlinear Sci., 117 (2023), 106972. https://doi.org/10.1016/j.cnsns.2022.106972 doi: 10.1016/j.cnsns.2022.106972
![]() |
[16] |
X. H. Chang, Y. Liu, Quantized output feedback control of AFS for electric vehicles with transmission delay and data dropouts, IEEE Trans. Intell. Transp. Syst., 23 (2022), 16026–16037. https://doi.org/10.1109/TITS.2022.3147481 doi: 10.1109/TITS.2022.3147481
![]() |
[17] |
C. Jia, J. Hu, H. Liu, J. Du, S. Feng, Recursive state estimation for a class of nonlinear uncertain coupled complex networks subject to random link failures and packet disorders, ISA Trans., 127 (2022), 88–98. https://doi.org/10.1016/j.isatra.2021.12.036 doi: 10.1016/j.isatra.2021.12.036
![]() |
[18] |
D. Xu, X. Li, W. Tai, J. Zhou, Event-triggered stabilization for networked control systems under random occurring deception attacks, Math. Biosci. Eng., 20 (2023), 859–878. http://dx.doi.org/10.3934/mbe.2023039 doi: 10.3934/mbe.2023039
![]() |
[19] |
J. Zhou, D. Xu, W. Tai, C. K. Ahn, Switched event-triggered H∞ security control for networked systems vulnerable to aperiodic DoS attacks, IEEE Trans. Net. Sci. Eng., 10 (2023), 2109–2123. https://doi.org/10.1109/TNSE.2023.3243095 doi: 10.1109/TNSE.2023.3243095
![]() |
[20] | Y. Fan, X. Huang, Y. Li, H. Shen, Sampled-data-based secure synchronization control for chaotic Lur'e systems subject to Denial-of-Service attacks, IEEE Trans. Neural Net. Learn. Syst., 2022 (2022). https://doi.org/10.1109/TNNLS.2022.3203382 |
[21] |
Y. Xu, Z. G. Wu, Y. J. Pan, J. Sun, Resilient asynchronous state estimation for Markovian jump neural networks subject to stochastic nonlinearities and sensor saturations, IEEE Trans. Cybern., 52 (2022), 5809–5818. https://doi.org/10.1109/TCYB.2020.3042473 doi: 10.1109/TCYB.2020.3042473
![]() |
[22] |
L. R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Proc. IEEE, 77 (1989), 257–286. https://doi.org/10.1109/5.18626 doi: 10.1109/5.18626
![]() |
[23] |
F. Li, S. Song, J. Zhao, S. Xu, Z. Zhang, Synchronization control for Markov jump neural networks subject to HMM observation and partially known detection probabilities, Appl. Math. Comput., 360 (2019), 1–13. https://doi.org/10.1016/j.amc.2019.04.032 doi: 10.1016/j.amc.2019.04.032
![]() |
[24] |
C. Ma, L. Hao, H. Fu, Neural network based asynchronous synchronization for fuzzy hidden Markov jump complex dynamical networks, Complex Intell. Syst., 8 (2022), 1941–1948. https://doi.org/10.1007/s40747-021-00370-5 doi: 10.1007/s40747-021-00370-5
![]() |
[25] |
W. Wu, L. He, J. Zhou, Z. Xuan, S. Arik, Disturbance-term-based switching event-triggered synchronization control of chaotic Lurie systems subject to a joint performance guarantee, Commun. Nonlinear Sci., 115 (2022), 106774. https://doi.org/10.1016/j.cnsns.2022.106774 doi: 10.1016/j.cnsns.2022.106774
![]() |
[26] |
W. He, T. Luo, Y. Tang, W. Du, Y. C. Tian, F. Qian, Secure communication based on quantized synchronization of chaotic neural networks under an event-triggered strategy, IEEE Trans. Neural Net. Learn. Syst., 31 (2020), 3334–3345. https://doi.org/10.1109/TNNLS.2019.2943548 doi: 10.1109/TNNLS.2019.2943548
![]() |
[27] |
Y. Ni, Z. Wang, Y. Fan, X. Huang, H. Shen, Memory-based event-triggered control for global synchronization of chaotic Lur'e systems and its application, IEEE Trans. Syst. Man Cybern. Syst., 53 (2023), 1920–1931. https://doi.org/10.1109/TSMC.2022.3207353 doi: 10.1109/TSMC.2022.3207353
![]() |
[28] | Y. Ni, Z. Wang, Y. Fan, J. Lu, H. Shen, A switching memory-based event-trigger scheme for synchronization of Lur'e systems with actuator saturation: A hybrid Lyapunov method, IEEE Trans. Neural Net. Learn. Syst., 2023. https://doi.org/10.1109/TNNLS.2023.3273917 |
[29] |
Z. Gu, S. Yan, J. H. Park, X. Xie, Event-triggered synchronization of chaotic Lur'e systems via memory-based triggering approach, IEEE Trans. Circuits-II, 69 (2022), 1427–1431. https://doi.org/10.1109/TCSII.2021.3113955 doi: 10.1109/TCSII.2021.3113955
![]() |
[30] |
W. Tai, D. Zuo, Z. Xuan, J. Zhou, Z. Wang, Non-fragile L2−L∞ filtering for a class of switched neural networks, Math. Comput. Simulation, 185 (2021), 629–645. https://doi.org/10.1016/j.matcom.2021.01.014 doi: 10.1016/j.matcom.2021.01.014
![]() |
[31] |
P. Selvaraj, O. Kwon, S. Lee, R. Sakthivel, Robust fault-tolerant control design for polynomial fuzzy systems, Fuzzy Sets Syst., 464 (2023), 108406. https://doi.org/10.1016/j.fss.2022.09.012 doi: 10.1016/j.fss.2022.09.012
![]() |
[32] |
X. Li, X. Ma, W. Tai, J. Zhou, Designing an event-triggered H∞ filter with possibly inconsistent modes for Markov jump systems, Digital Signal Process., 139 (2023), 104092. https://doi.org/10.1016/j.dsp.2023.104092 doi: 10.1016/j.dsp.2023.104092
![]() |
[33] |
J. Gu, H. Wang, W. Li, Output-feedback stabilization for stochastic nonlinear systems with Markovian switching and time-varying powers, Math. Biosci. Eng., 19 (2022), 11071–11085. http://dx.doi.org/10.3934/mbe.2022516 doi: 10.3934/mbe.2022516
![]() |
[34] |
W. Tai, X. Li, J. Zhou, S. Arik, Asynchronous dissipative stabilization for stochastic Markov-switching neural networks with completely-and incompletely-known transition rates, Neural Net., 161 (2023), 55–64. https://doi.org/10.1016/j.neunet.2023.01.039 doi: 10.1016/j.neunet.2023.01.039
![]() |
[35] |
R. Vadivel, P. Hammachukiattikul, N. Gunasekaran, R. Saravanakumar, H. Dutta, Strict dissipativity synchronization for delayed static neural networks: An event-triggered scheme, Chaos Solitons Fractals, 150 (2021), 111212. https://doi.org/10.1016/j.chaos.2021.111212 doi: 10.1016/j.chaos.2021.111212
![]() |
[36] |
X. Liu, K. Shi, Y. Tang, L. Tang, Y. Wei, Y. Han, A novel adaptive event-triggered reliable H∞ control approach for networked control systems with actuator faults, Electron. Res. Arch., 31 (2023), 1840–1862. http://dx.doi.org/10.3934/era.2023095 doi: 10.3934/era.2023095
![]() |
[37] |
L. Yao, X. Huang, Memory-based adaptive event-triggered secure control of Markovian jumping neural networks suffering from deception attacks, Sci. China Technol. Sci., 66 (2023), 468–480. https://doi.org/10.1007/s11431-022-2173-7 doi: 10.1007/s11431-022-2173-7
![]() |
[38] | J. Zhou, J. Dong, S. Xu, Asynchronous dissipative control of discrete-time fuzzy Markov jump systems with dynamic state and input quantization, IEEE Trans. Fuzzy Syst., 2023. https://doi.org/10.1109/TFUZZ.2023.3271348 |
[39] |
S. Dong, M. Liu, Adaptive fuzzy asynchronous control for nonhomogeneous Markov jump power systems under hybrid attacks, IEEE Trans. Fuzzy Syst., 31 (2023), 1009–1019. https://doi.org/10.1109/TFUZZ.2022.3193805 doi: 10.1109/TFUZZ.2022.3193805
![]() |
[40] |
J. Wang, X. M. Zhang, Y. Lin, X. Ge, Q. L. Han, Event-triggered dissipative control for networked stochastic systems under non-uniform sampling, Inform. Sci., 447 (2018), 216–228. https://doi.org/10.1016/j.ins.2018.03.003 doi: 10.1016/j.ins.2018.03.003
![]() |
[41] |
F. Zeng, Y. Wang, G. Zhuang, F. Chen, Dynamic-memory event-triggered-based controller design for singular stochastic semi-Markov jump systems against multiple cyber-attacks, Nonlinear Dyn., 110 (2022), 1559–1582. https://doi.org/10.1007/s11071-022-07728-5 doi: 10.1007/s11071-022-07728-5
![]() |
[42] | E. K. Boukas, Control of singular systems with random abrupt changes, Springer, Berlin, 2008. |
[43] |
X. H. Chang, J. H. Park, J. Zhou, Robust static output feedback H∞ control design for linear systems with polytopic uncertainties, Syst. Control Lett., 85 (2015), 23–32. https://doi.org/10.1016/j.sysconle.2015.08.007 doi: 10.1016/j.sysconle.2015.08.007
![]() |
[44] |
I. Kucukdemiral, X. Han, M. S. Erden, Robust induced l2−l∞ optimal control of discrete-time systems having magnitude and rate-bounded actuators, ISA Trans., 129 (2022), 73–87. https://doi.org/10.1016/j.isatra.2022.02.025 doi: 10.1016/j.isatra.2022.02.025
![]() |
[45] |
H. B. Zeng, Z. L. Zhai, Y. He, K. L. Teo, W. Wang, New insights on stability of sampled-data systems with time-delay, Appl. Math. Comput., 374 (2020), 125041. https://doi.org/10.1016/j.amc.2020.125041 doi: 10.1016/j.amc.2020.125041
![]() |
[46] |
T. S. Peng, H. B. Zeng, W. Wang, X. M. Zhang, X. G. Liu, General and less conservative criteria on stability and stabilization of T–S fuzzy systems with time-varying delay, IEEE Trans. Fuzzy Syst., 31 (2023), 1531–1541. https://doi.org/10.1109/TFUZZ.2022.3204899 doi: 10.1109/TFUZZ.2022.3204899
![]() |
[47] |
W. Wang, H. B. Zeng, K. L. Teo, Y. J. Chen, Relaxed stability criteria of time-varying delay systems via delay-derivative-dependent slack matrices, J. Franklin I., 360 (2023), 6099–6109. https://doi.org/10.1016/j.jfranklin.2023.04.019 doi: 10.1016/j.jfranklin.2023.04.019
![]() |
[48] |
H. B. Zeng, Y. He, M. Wu, J. She, New results on stability analysis for systems with discrete distributed delay, Automatica, 60 (2015), 189–192. https://doi.org/10.1016/j.automatica.2015.07.017 doi: 10.1016/j.automatica.2015.07.017
![]() |
[49] |
H. B. Zeng, X. G. Liu, W. Wang, A generalized free-matrix-based integral inequality for stability analysis of time-varying delay systems, Appl. Math. Comput., 354 (2019), 1–8. https://doi.org/10.1016/j.amc.2019.02.009 doi: 10.1016/j.amc.2019.02.009
![]() |
[50] |
H. B. Zeng, H. C. Lin, Y. He, K. L. Teo, W. Wang, Hierarchical stability conditions for time-varying delay systems via an extended reciprocally convex quadratic inequality, J. Franklin I., 357 (2020), 9930–9941. https://doi.org/10.1016/j.jfranklin.2020.07.034 doi: 10.1016/j.jfranklin.2020.07.034
![]() |
[51] | H. C. Lin, H. B. Zeng, X. M. Zhang, W. Wang, Stability analysis for delayed neural networks via a generalized reciprocally convex inequality, IEEE Trans. Neural Net. Learn. Syst., 2022. https://doi.org/10.1109/TNNLS.2022.3144032 |
[52] |
W. Wang, H. B. Zeng, A looped functional method to design state feedback controllers for Lurie networked control systems, IEEE/CAA J. Autom. Sinica, 10 (2023), 1093–1095. https://doi.org/10.1109/JAS.2023.123141 doi: 10.1109/JAS.2023.123141
![]() |
[53] |
E. Tian, C. Peng, Memory-based event-triggering H∞ load frequency control for power systems under deception attacks, IEEE Trans. Cybern., 50 (2020), 4610–4618. https://doi.org/10.1109/TCYB.2020.2972384 doi: 10.1109/TCYB.2020.2972384
![]() |
1. | Dijana Mosić, Predrag S. Stanimirović, Lev A. Kazakovtsev, Minimization problem solvable by weighted m-weak group inverse, 2024, 1598-5865, 10.1007/s12190-024-02215-z |