Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2013, Article ID 378376, 8 pages http://dx.doi.org/10.1155/2013/378376 Research Article Finite-Time Synchronization of Singular Hybrid Coupled Networks Cong Zheng1 and Jinde Cao1,2 1 Research Center for Complex Systems and Network Sciences, and Department of Mathematics, Southeast University, Nanjing 210096, China 2 Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia Correspondence should be addressed to Jinde Cao; jdcao@seu.edu.cn Received 20 December 2012; Accepted 11 February 2013 Academic Editor: Jong Hae Kim Copyright © 2013 C. Zheng and J. Cao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This paper investigates finite-time synchronization of the singular hybrid coupled networks. The singular systems studied in this paper are assumed to be regular and impulse-free. Some sufficient conditions are derived to ensure finite-time synchronization of the singular hybrid coupled networks under a state feedback controller by using finite-time stability theory. A numerical example is finally exploited to show the effectiveness of the obtained results. 1. Introduction In recent years, singular systems, also known as descriptor systems, generalized state-space systems, differentialalgebraic systems, or semistate systems, are attracting more and more attentions from many fields of scientific research because they can better describe a larger class of dynamic systems than the regular ones. Many results of regular systems have been extended to the area about singular systems such as [1–21]. For example, stability (robust stability or quadratic stability) and stabilization for singular systems have been studied via LMI approach in [2–8]; robust control (or π»2 , π»∞ control and robust dissipative filtering) for singular systems has been discussed in [9–16]; synchronization (or state estimation) for singular complex networks has been considered in [17–21]. Synchronization is an interesting and important characteristic in the coupled networks. There are a lot of results in regular coupled networks. Recently, some authors study synchronization of the singular systems such as [17–21] and the references therein. In [17], Xiong et al. introduced the singular hybrid coupled systems to describe complex network with a special class of constrains. They gave a sufficient condition for global synchronization of singular hybrid coupled system with time-varying nonlinear perturbation based on Lyapunov stability theory. Synchronization issues are studied for singular systems with delays by using Linear Matrix Inequality (LMI) approach [18]. Koo et al. considered synchronization of singular complex dynamical network with time-varying delays [19]. Li et al. in [20] investigated synchronization and state estimation for singular complex dynamical networks with time-varying delays. Li et al. in [21] investigated robust π»∞ control of synchronization for uncertain singular complex delayed networks with stochastic switched coupling. Finite-time synchronization or finite-time control is interesting topic for its practical application. There are some results on finite-time stability [22–26], finite-time synchronization [27–33], finite-time consensus or agreement [34– 37], and finite-time observers [38]. However, these results are obtained for regular systems. Up to now, to the best of our knowledge, few authors studied finite-time synchronization of singular hybrid coupled systems whose structures are more complex than those in [27–33]. Considering the important role of synchronization of complex networks, the finite-time synchronization of singular hybrid coupled networks is worth studying. Motivated by the previous discussions, in this paper, we investigate finite-time synchronization of singular hybrid complex systems. Some sufficient conditions for it are 2 Journal of Applied Mathematics obtained by the state feedback controller based on the finitetime stability theory. Finally, a numerical example is exploited to illustrate the effectiveness of the obtained result. The rest of this paper is organized as follows. In Section 2, a singular hybrid coupled system is given, and some preliminaries are briefly outlined. In Section 3, some sufficient criteria are derived for the finite-time synchronization of the proposed singular system by the feedback controller. In Section 4, an example is provided to show the effectiveness of the obtained results. Some conclusions are finally drawn in Section 5. 2. Model Formulation and Some Preliminaries (1) π = 1, 2, . . . , π, where π₯π (π‘) = (π₯π1 (π‘), π₯π2 (π‘), . . . , π₯ππ (π‘))π ∈ Rπ represents the state vector of the πth node, π΄, πΈ ∈ Rπ×π are constant matrices, and πΈ may be singular. Without loss of generality, we will assume that 0 < rank(πΈ) = π < π. π(π₯π (π‘), π‘) is a vector-value function. The constant π > 0 denotes the coupling strength, and Γ = diag(πΎ1 , πΎ2 , . . . , πΎπ ) ∈ Rπ×π is inner-coupling matrix between nodes. π΅ = (πππ )π×π describes the linear coupling configuration of the network, which satisfies πππ = πππ , π πππ = − ∑ πππ , for π =ΜΈ π, π = 1, 2, . . . , π. π + π ∑πππ (π‘) Γππ (π‘) , π = 1, 2, . . . , π. (2) π=1,π =ΜΈ π Remark 1. If rank(πΈ) = π, then system (1) is a general nonsingular coupled network. We will also give a sufficient condition of the finite-time synchronization for this circumstance. See Corollary 10. Definition 2. The singular system (1) is said to be synchronized in the finite time, if for a suitable designed feedback controller, there exists a constant π‘∗ > 0 (which depends on π the initial vector value π₯(0) = (π₯1π (0), π₯2π (0), . . . , π₯π (0))π ), such that limπ‘ → π‘∗ β π₯π (π‘) − π₯π (π‘) β= 0 and β π₯π (π‘) − π₯π (π‘) β≡ 0 for π‘ > π‘∗ , π, π = 1, 2, . . . , π. Assumption 3. Assume that the singular system (1) is connected in the sense that there are no isolated clusters; that is, the matrix π΅ is an irreducible matrix. With Assumption 3, we obtain that zero is an eigenvalue of π΅ with multiplicity 1, and all the other eigenvalues of π΅ are strictly negative, which are denoted by 0 = π 1 > π 2 ≥ ⋅ ⋅ ⋅ ≥ π π. At the same time, since π΅ is a symmetric matrix, there exists a unitary matrix π = (π1 , π2 , . . . , ππ) ∈ Rπ×π such that π΅ = πΛππ with πππ = πΌ and Λ = diag(π 1 , π 2 , . . . , π π). (3) π=1 Let π(π‘) = (π1 (π‘), π2 (π‘), . . . , ππ(π‘)), π¦(π‘) = π(π‘)π; then system (3) can be written as πΈπ¦Μ (π‘) = π΄π¦ (π‘) + πΉ (π (π‘) , π‘) π + πΓπ¦ (π‘) Λ, π π=1 πΈππΜ (π‘) = π΄ππ (π‘) + π (π₯π (π‘) , π‘) − π (π (π‘) , π‘) πΈπ Μ (π‘) = π΄π (π‘) + πΉ (π (π‘) , π‘) + πΓπ (π‘) π΅π , Consider a singular hybrid coupled system as follows: πΈπ₯πΜ (π‘) = π΄π₯π (π‘) + π (π₯π (π‘) , π‘) + π ∑ πππ (π‘) Γπ₯π (π‘) , Let π (π‘) be a function to which all π₯π (π‘) are expected to synchronize in the finite time. That is, the synchronization Μ = state is π (π‘). Suppose that π (π‘) satisfies the equation πΈπ (π‘) π΄π (π‘) + π(π (π‘), π‘). Let ππ (π‘) = π₯π (π‘) − π (π‘), π = 1, 2, . . . , π. We can obtain the following singular error system: (4) where πΉ(π(π‘), π‘) = (π(π₯1 (π‘), π‘) − π(π (π‘), π‘), π(π₯2 (π‘), π‘) − π(π (π‘), π‘), . . . , π(π₯π(π‘), π‘)−π(π (π‘), π‘)), π¦(π‘) = (π¦1 (π‘), π¦2 (π‘), . . . , π¦π(π‘)), and π¦π (π‘) = π(π‘)ππ ∈ Rπ , π = 1, 2, . . . , π. Then, system (4) can be written as πΈπ¦πΜ (π‘) = π΄π¦π (π‘) + πΉ (π (π‘) , π‘) ππ + ππ π Γπ¦π (π‘) = (π΄ + ππ π Γ) π¦π (π‘) + πΉ (π (π‘) , π‘) ππ . (5) Therefore, the finite-time synchronization problem of system (1) is equivalent to the finite-time stabilization of system (5) at the origin under the suitable controllers π’π , π = 1, 2, . . . , π. Assumption 4. Assume that there exist nonnegative constants πΏ π such that σ΅© σ΅© σ΅©σ΅© σ΅© σ΅©σ΅©π (π₯π (π‘) , π‘) − π (π (π‘) , π‘)σ΅©σ΅©σ΅© ≤ πΏ π σ΅©σ΅©σ΅©π₯π (π‘) − π (π‘)σ΅©σ΅©σ΅© , π = 1, 2, . . . , π. (6) Assumption 5. There exist matrices ππ such that πΈπ ππ = πππ πΈ ≥ 0, π = 1, 2, . . . , π, π΄π π1 + π1π π΄ < 0, (π΄ + ππ π Γ)π ππ + πππ (π΄ + ππ π Γ) ≤ −ππ πΌ, π = 2, . . . , π, (7) (8) where ππ > 2πΏ(π − 1) β ππ β, πΏ = ∑π π=1 πΏ π . Lemma 6 (see [26]). Suppose that the function π(π‘) : [π‘0 , ∞) → [0, ∞) is differentiable (the derivative of π(π‘) at π‘0 Μ is in fact its right derivative) and π(π‘) ≤ −πΎ(π(π‘))πΌ , ∀π‘ ≥ 0, π(π‘0 ) ≥ 0, where πΎ > 0, 0 < πΌ < 1 are two constants. Then, for any given π‘0 , π(π‘) satisfies the following inequality: π1−πΌ (π‘) ≤ π1−πΌ (π‘0 ) − πΎ (1 − πΌ) (π‘ − π‘0 ) , π (π‘) ≡ 0, ∀π‘ > π‘∗ , with π‘∗ given by π‘∗ = π‘0 + π1−πΌ (π‘0 )/πΎ(1 − πΌ). π‘0 ≤ π‘ ≤ π‘∗ , (9) Journal of Applied Mathematics 3 Lemma 7 (Jensen’s Inequality). If π1 , π2 , . . . , ππ are positive numbers and 0 < π < π, then (1/π) π (∑ππ ) π=1 π ≤ (1/π) π (∑ππ ) . π=1 ππ πΈπ (π‘) ππ = ππ πΈπ¦π (π‘) = ππ πΈππ ππ−1 π¦π (π‘) π¦π1 πΌπ 0 π¦1 =( ) ( 2) = ( π ) , 0 0 0 π¦π π (10) π 3. Main Results In this section, we consider the finite-time synchronization of the singular coupled network (1) under the appropriate controllers. In order to control the states of all nodes to the synchronization state π (π‘) in finite time, we apply some simple controllers π’π (π‘) ∈ Rπ , π = 1, 2, . . . , π, to system (1). Then, the controlled system can be written as πΈπ₯πΜ (π‘) = π΄π₯π (π‘) + π (π₯π (π‘) , π‘) + π ∑πππ Γπ₯π (π‘) + π’π , π=1 (11) π = 1, 2, . . . , π. Then, we have πΈππΜ (π‘) = π΄ππ (π‘) + π (π₯π (π‘) , π‘) − π (π (π‘) , π‘) π (12) + π ∑ πππ Γππ (π‘) + π’π , π=1 πΈπ¦πΜ (π‘) = (π΄ + ππ π Γ) π¦π (π‘) + πΉ (π (π‘) , π‘) ππ + Vπ , (13) where Vπ = π’ππ , π’ = (π’1 , π’2 , . . . , π’π). With Assumption 5, it follows from the proof of Theorem 1 in [2] and Lemma 2.2 in [3] that the pair (πΈ, π΄ + ππ π Γ) is regular and impulse-free; that is, there exist nonsingular matrices ππ , ππ ∈ Rπ×π satisfying that sign (π¦ππ1 (π‘)) , βββββββββββββ 0, . . . , 0) . π−π Remark 8. From (17), the controllers π’π are dependent not only on the coupled matrix π΅, but also on the singular matrix πΈ. And from the shape of controllers, we only use the states π¦π1 of slow subsystems (15) in controllers Vπ , but we do not consider the states π¦π2 of fast subsystems (16). It is very special. It is interesting for our future research to design more general controller which makes the singular hybrid coupled networks synchronize in finite time. Theorem 9. Suppose that Assumptions 3, 4, and 5 hold. Under the controllers (17), the singular system (1) is synchronized in a finite time π‘∗ = π‘0 + (π(1−π½)/2 (π‘0 )/ π π πππ−(1+π½)/2 (1 − π½)), where π(π‘0 ) = ∑π π=1 π¦π (π‘0 )πΈ ππ π¦π (π‘0 ) = π π π ∑π=1 (π(π‘0 )ππ ) πΈ ππ (π(π‘0 )ππ ), π(π‘0 ) is the initial condition of π(π‘), and π and π are defined as (25). π¦π1Μ (π‘) = π΄ π π¦π1 (π‘) + ππ1 πΉ (π (π‘) , π‘) ππ + ππ1 Vπ , (15) 0 = π¦π2 (π‘) + ππ2 πΉ (π (π‘) , π‘) ππ + ππ2 Vπ , (16) π¦π2 (π‘) π π (π‘) = ∑π¦ππ (π‘) πΈπ ππ π¦π (π‘) . (19) π=1 where π΄ π ∈ Rπ×π , π = 1, 2, . . . , π. So, system (13) is equivalent to ∈ R , and π > 0 is a tunable constant, and the real number π½ satisfies 0 < π½ < 1. So, we obtain π’ = (V1 , V2 , . . . , Vπ)π−1 = V(π1 , π2 , . . . , ππ). That is, π’π = Vππ . (14) ππ (π΄ + ππ π Γ) ππ = diag {π΄ π , πΌπ−π } , π sign (ππ πΈπ¦π (π‘)) = diag ( sign (π¦π11 (π‘)) , sign (π¦π21 (π‘)) , . . . , Proof. Consider the following Lyapunov function: ππ πΈππ = diag {πΌπ , 0} , π¦1 (π‘) = ( π¦π2 (π‘) ), π¦π1 (π‘) where π π1 ππ = ( ππ2 ), ππ1 ∈ Rπ×π , ππ2 ∈ π Rπ×π , and ππ2 ∈ Rπ×(π−π) . σ΅¨ 1 σ΅¨π½ σ΅¨ 1 σ΅¨π½ σ΅¨σ΅¨ σ΅¨π½ 0, . . . , 0) , σ΅¨σ΅¨ππ πΈπ¦π (π‘)σ΅¨σ΅¨σ΅¨ = (σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ , . . . , σ΅¨σ΅¨σ΅¨σ΅¨π¦ππ (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ , βββββββββββββ π−π (18) π ππ−1 π¦π (π‘) where The derivative of π(π‘) along the trajectory of system (13) is πΜ (π‘) π = ∑ [π¦ππ (π‘) πππ ((π΄ + ππ π Γ) π¦π (π‘) + πΉ (π (π‘) , π‘) ππ + Vπ ) π=1 π ∈R R(π−π)×π , ππ = ( ππ1 π−π ππ2 +((π΄ + ππ π Γ) π¦π (π‘) + πΉ (π (π‘) , π‘) ππ + Vπ ) ππ π¦π (π‘) ] . And ), ππ1 ∈ In order to achieve our aim, we design the following controllers: σ΅¨σ΅¨π½ σ΅¨ Vπ = −πππ−1 sign (ππ πΈπ (π‘) ππ ) σ΅¨σ΅¨σ΅¨ππ πΈπ (π‘) ππ σ΅¨σ΅¨ , (17) π π = ∑ [ π¦ππ (π‘) (πππ (π΄ + ππ π Γ) + (π΄ + ππ π Γ) ππ ) π¦π (π‘) π=1 + 2π¦ππ (π‘) πππ πΉ (π (π‘) , π‘) ππ σ΅¨π½ σ΅¨ −2ππ¦ππ (π‘) πππ ππ−1 sign (ππ πΈπ (π‘) ππ ) σ΅¨σ΅¨σ΅¨ππ πΈπ (π‘) ππ σ΅¨σ΅¨σ΅¨ ]. (20) 4 Journal of Applied Mathematics By using Assumption 4, one can get the following inequality: σ΅©σ΅© π σ΅©σ΅© σ΅©σ΅© σ΅©σ΅© σ΅© σ΅©σ΅© σ΅©σ΅©πΉ (π (π‘) , π‘) ππ σ΅©σ΅©σ΅© = σ΅©σ΅©σ΅© ∑ [π (π₯π (π‘) , π‘) − π (π (π‘) , π‘)] πππ σ΅©σ΅©σ΅© σ΅©σ΅©π=1 σ΅©σ΅© σ΅© σ΅© π Let π β min {π min (ππ1π )} , π From (22), we get σ΅© σ΅© ≤ ∑ πΏ π σ΅©σ΅©σ΅©ππ (π‘)σ΅©σ΅©σ΅© π π σ΅©2 σ΅©2 σ΅© σ΅© π∑σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© ≤ π (π‘) ≤ π∑σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© . π=1 π π π=1 π=1 σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© = ∑ πΏ π σ΅©σ΅©σ΅©π¦ (π‘) ππ σ΅©σ΅©σ΅© ≤ ∑ πΏ π σ΅©σ΅©σ΅©π¦ (π‘)σ΅©σ΅©σ΅© = πΏ σ΅©σ΅©σ΅©π¦ (π‘)σ΅©σ΅©σ΅© π=1 σ΅© σ΅© ≤ πΏ ∑ σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅© , By the use of (24)–(26) and Lemma 7, we can obtain that π=1 π=1 (21) π π Rπ×(π−π) , ππ3 ∈ R(π−π)×π , and ππ4 ∈ R(π−π)×(π−π) . Using (7) and (8) (see [2]), one can obtain that ππ1 = (ππ1 )π > 0 and ππ2 = 0; then, π (π‘) = − π ∑π¦ππ (π‘) πΈπ ππ π¦π π=1 2ππ¦ππ (π‘) πππ ππ−1 (π‘) = π ∑(π¦π1 π=1 π (π‘)) ππ1 π¦π1 (π‘) , (22) σ΅¨ σ΅¨π½ = −2ππ¦ππ (π‘) πππ ππ−1 (sign (π¦π11 (π‘)) σ΅¨σ΅¨σ΅¨σ΅¨π¦π11 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ , . . . , = ππ1 π −π −2ππ¦π (π‘) ππ ( 3 ππ 0 ππ4 σ΅¨π½ σ΅¨ (π‘)) σ΅¨σ΅¨σ΅¨σ΅¨π¦ππ1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ , 0, . . . , 0) π ) ππ ππ−1 From Lemma 6, we have that the solutions π¦π1 (π‘) of system (15) are globally asymptotically stable with respect to π¦π1 (π‘) = 0 in the finite time π‘∗ ; that is, σ΅¨π½ σ΅©σ΅© σ΅¨ ×σ΅¨σ΅¨σ΅¨ππ πΈπ¦π (π‘)σ΅¨σ΅¨σ΅¨ σ΅©σ΅©σ΅© σ΅© . σ΅©σ΅© σ΅©2 σ΅© σ΅© σ΅© σ΅© σ΅© πΜ (π‘) ≤ ∑ [−ππ σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅© + 2πΏ σ΅©σ΅©σ΅©ππ σ΅©σ΅©σ΅© ∑ σ΅©σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅©σ΅© σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅© π=1 π=1 [ π σ΅¨1+π½ σ΅¨ ≤ ∑ − 2ππ min (ππ1π ) σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ . π=1 (30) π σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© ≤ πΏ∑ σ΅©σ΅©σ΅©σ΅©ππ σ΅©σ΅©σ΅©σ΅© (σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© + σ΅©σ΅©σ΅©σ΅©π¦π2 (π‘)σ΅©σ΅©σ΅©σ΅©) + π σ΅©σ΅©σ΅©σ΅©ππ−1 σ΅©σ΅©σ΅©σ΅© (23) σ΅¨1+π½ (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ ] ] (29) π σ΅© σ΅©σ΅© σ΅© ≤ πΏ∑ σ΅©σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅©σ΅© + σ΅©σ΅©σ΅© − πππ−1 sign (ππ πΈπ¦π (π‘)) σ΅© π=1 π=1 σ΅¨ σ΅¨π½ × σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ . π σ΅¨ −2ππ min (ππ1π ) σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (28) Similar to the proof of Lemma 2.2 in [3] and the proof of Theorem 1 in [17], let ππ2 (ππ2 )π = πΌπ−π , which implies that β ππ2 β= 1. One has Substituting (8), (21), and (23) into (20) and letting π1 = 0, while ππ ≥ 2πΏ(π − 1) β ππ β, π = 2, . . . , π, one has π for π‘ ≥ π‘∗ , σ΅© σ΅© σ΅©σ΅© 2 σ΅©σ΅© σ΅©σ΅© 2 σ΅©σ΅© σ΅©σ΅© σ΅©σ΅©π¦π (π‘)σ΅©σ΅© ≤ σ΅©σ΅©ππ σ΅©σ΅© σ΅©σ΅©πΉ (π (π‘) , π‘) ππ σ΅©σ΅©σ΅©σ΅© + σ΅©σ΅©σ΅©ππ2 σ΅©σ΅©σ΅© σ΅©σ΅©σ΅©σ΅©Vπ σ΅©σ΅©σ΅©σ΅© . σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© σ΅¨ σ΅¨π½ = −2ππ¦π1π (π‘) ππ1π sign (π¦π1 (π‘)) σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ σ΅¨ ≤ −2ππ min (ππ1π ) σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨ σ΅©σ΅© 1 σ΅©σ΅© σ΅©σ΅©π¦π (π‘)σ΅©σ΅© = 0 σ΅© σ΅© σ΅© σ΅© lim∗ σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© = 0, π‘→π‘ σ΅©σ΅© 2 σ΅©σ΅© σ΅©σ΅© σ΅©σ΅©π¦π (π‘)σ΅©σ΅© ≤ σ΅©σ΅©πΉ (π (π‘) , π‘) ππ σ΅©σ΅©σ΅©σ΅© + σ΅©σ΅©σ΅©σ΅©π’π ππ σ΅©σ΅©σ΅©σ΅© σ΅© σ΅© σ΅¨σ΅¨ 1 σ΅¨σ΅¨π½ σ΅¨ σ΅¨ × diag (sign (π¦π1 (π‘)) , 0) (σ΅¨σ΅¨π¦π (π‘)σ΅¨σ΅¨ ) 0 σ΅¨σ΅¨1+π½ π=1 where π‘∗ = π‘0 + (π(1−π½)/2 (π‘0 )/πππ−(1+π½)/2 (1 − π½)). In the following, we show that π¦π2 (π‘) are globally asymptotically stable with respect to π¦π2 (π‘) = 0 in the finite time π‘∗ . From (16), one has σ΅¨π½ σ΅¨ sign (ππ πΈπ (π‘) ππ ) σ΅¨σ΅¨σ΅¨ππ πΈπ (π‘) ππ σ΅¨σ΅¨σ΅¨ sign (π¦ππ1 (1+π½)/2 (1+π½)/2 1 ≤ − 2ππ( π (π‘)) = −2πππ−(1+π½)/2 (π (π‘))(1+π½)/2 . π (27) −1 where ππ = (ππ1 , ππ2 , . . . , πππ ) and (π1 , π2 , . . . , ππ) = π = ππ . π1 π2 Define ππ−π ππ ππ = ( ππ3 ππ4 ), where ππ1 ∈ Rπ×π , ππ2 ∈ (26) π=1 π π σ΅¨1+π½ σ΅¨ σ΅©2 σ΅© πΜ (π‘) ≤ − 2ππ∑σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ ≤ −2ππ(∑σ΅©σ΅©σ΅©π¦π (π‘)σ΅©σ΅©σ΅© ) π π π β max {π max (ππ1π )} . (25) π Then, (24) π π σ΅© π σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© σ΅© ∑ σ΅©σ΅©σ΅©σ΅©π¦π2 (π‘)σ΅©σ΅©σ΅©σ΅© ≤ ∑ [πΏ∑ σ΅©σ΅©σ΅©σ΅©ππ σ΅©σ΅©σ΅©σ΅© (σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© + σ΅©σ΅©σ΅©σ΅©π¦π2 (π‘)σ΅©σ΅©σ΅©σ΅©) π=1 π=1 [ π=1 σ΅© σ΅¨π½ σ΅©σ΅¨ +π σ΅©σ΅©σ΅©σ΅©ππ−1 σ΅©σ΅©σ΅©σ΅© σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ ] ; ] (31) Journal of Applied Mathematics 5 that is, π σ΅© π σ΅© σ΅© σ΅© σ΅© σ΅© σ΅©σ΅© ∑ (1 − ππΏ σ΅©σ΅©σ΅©ππ σ΅©σ΅©σ΅©) σ΅©σ΅©σ΅©σ΅©π¦π2 (π‘)σ΅©σ΅©σ΅©σ΅© ≤ ∑ (ππΏ σ΅©σ΅©σ΅©ππ σ΅©σ΅©σ΅© σ΅©σ΅©σ΅©σ΅©π¦π1 (π‘)σ΅©σ΅©σ΅©σ΅© π=1 π=1 (32) σ΅© σ΅¨π½ σ΅©σ΅¨ +π σ΅©σ΅©σ΅©σ΅©ππ−1 σ΅©σ΅©σ΅©σ΅© σ΅¨σ΅¨σ΅¨σ΅¨π¦π1 (π‘)σ΅¨σ΅¨σ΅¨σ΅¨ ) . With Assumption 4, there must exist nonsingular matrices ππ , ππ ∈ Rπ×π satisfying the equalities ππ πΈππ = diag{πΌπ , 0}, ππ (π΄+ππ π Γ)ππ = diag{π΄ π , πΌπ−π }, where π΄ π ∈ Rπ×π , π = 1, 2, . . . , π. Moreover, nonsingular matrices ππ can be suitably chosen to satisfy 1 − ππΏ β ππ β> 0, for ∀π ∈ {1, 2, . . . , π}. Therefore, one can obtain limπ‘ → π‘∗ β π¦π2 (π‘) β= 0, and β π¦π2 (π‘) β= 0 for π‘ ≥ π‘∗ from (28) and (32), π = 1, 2, . . . , π. Consequently, limπ‘ → π‘∗ β ππ (π‘) β= 0, and β ππ (π‘) β= 0 for π‘ ≥ π‘∗ , π = 1, 2, . . . , π. The proof is completed. If rank(πΈ) = π, system (1) is a general nonsingular coupled network. By using the controllers π’π similar to Vπ in (17), we can derive the finite-time synchronization of system (1). For simplicity, let πΈ = πΌπ . Then, we have the following. Corollary 10. When πΈ = πΌπ , under Assumptions 3 and 4, let the controllers π’π (π‘) be as follows: σ΅¨ σ΅¨π½ π’π (π‘) = −π sign (ππ (π‘)) σ΅¨σ΅¨σ΅¨ππ (π‘)σ΅¨σ΅¨σ΅¨ , π = 1, 2, . . . , π; (33) system (1) is synchronized in a finite time. Remark 11. Since the conditions in Assumption 5 are not strict LMIs problems, they cannot be solved directly by the LMI Matlab Toolbox. According to Lemma 1 in [17], Lemma 1 in [9], and Remark 3 in [18], if matrix πΈ has the decomposition as Suppose that we choose the average state of all node states as synchronized state; that is, π (π‘) = (1/π) ∑π π=1 π₯π (π‘). We have similar results. Before giving these results, we need some assumptions as follows: Assumption 2σΈ . Assume that there exist nonnegative constants πΏ ππ such that σ΅© σ΅© σ΅©σ΅© σ΅© σ΅©σ΅©π (π₯π (π‘) , π‘) − π (π₯π (π‘) , π‘)σ΅©σ΅©σ΅© ≤ πΏ ππ σ΅©σ΅©σ΅©π₯π (π‘) − π₯π (π‘)σ΅©σ΅©σ΅© , σ΅© σ΅© σ΅© σ΅© (36) π, π = 1, 2, . . . , π. Assumption 3σΈ . There exist matrices ππ such that πΈπ ππ = πππ πΈ ≥ 0, π = 1, 2, . . . , π, π΄π π1 + π1π π΄ < 0, π (π΄ + ππ π Γ) ππ + πππ (π΄ + ππ π Γ) ≤ −ππ πΌ, π = 2, . . . , π, where ππ > (4πΏ/π)(π − 1) β ππ β, πΏ = ∑π π=1 πΏ π , and πΏ π = π ∑π=1,π =ΜΈ π πΏ ππ . Theorem 13. Suppose that Assumptions 3, 2σΈ , and 3σΈ hold. By the controllers (17), the singular hybrid coupled network (1) can be synchronized to the average state of all node states in the finite time in the sense of Definition 2. Corollary 14. Suppose that Assumptions 3 and 2σΈ hold, and matrix πΈ has the decomposition as (34) in Remark 11. By the controllers (17), if there exist matrices ππ ∈ Rπ×π , ππ ≥ 0, and ππ ∈ R(π−π)×π , π = 1, 2, . . . , π, such that π π΄π (π1 π1 π1π πΈ + π2 π1 ) + (π1 π1 π1ππΈ + π2 π1 ) π΄ < 0, π πΌ 0 Ξ 0 ) ππ , πΈ = π( π )( π 0 0 0 πΌπ−π (34) where π = (π1 , π2 ), π = (π1 , π2 ), and Ξπ = diag{σ°1 , . . . , σ°π } with σ°π > 0 for π = 1, 2, . . . , π, then Assumption 5 can be transformed into a strict LMIs problem. Corollary 12. Suppose that Assumptions 3 and 4 hold, and matrix πΈ has the decomposition as (34) in Remark 11. By the controllers (17), the singular hybrid coupled network (1) can be synchronized in the finite time in the sense of Definition 2, if there exist matrices ππ ∈ Rπ×π , ππ ≥ 0, and ππ ∈ R(π−π)×π , π = 1, 2, . . . , π, such that π π΄π (π1 π1 π1π πΈ + π2 π1 ) + (π1 π1 π1π πΈ + π2 π1 ) π΄ < 0, π (π΄ + ππ π Γ) (π1 ππ π1π πΈ + π2 ππ ) (35) (37) (π΄ + ππ π Γ) (π1 ππ π1π πΈ + π2 ππ ) (38) π + (π1 ππ π1π πΈ + π2 ππ ) (π΄ + ππ π Γ) ≤ −ππ πΌ, where ππ > (4πΏ/π)(π − 1) β ππ β, ππ = (π1 ππ π1π πΈ + π2 ππ ), π π = 2, . . . , π, πΏ = ∑π π=1 πΏ π , and πΏ π = ∑π=1,π =ΜΈ π πΏ ππ , the singular hybrid coupled network (1) can be synchronized to the average state of all node states in the finite time. Remark 15. In this paper, we study finite-time synchronization of the singular hybrid coupled networks when the singular systems studied in this paper are assumed to be regular and impulse-free. However, it may be more complicated when we do not assume in advance that the systems are regular and impulse free. Synchronization or finite-time synchronization of singular coupled systems is worth discussing without the assumption that the considered systems are regular and impulsive free. π + (π1 ππ π1π πΈ + π2 ππ ) (π΄ + ππ π Γ) ≤ −ππ πΌ, where ππ > 2πΏ(π − 1) β ππ β, ππ = 2, . . . , π, and πΏ = ∑π π=1 πΏ π . (π1 ππ π1π πΈ + π2 ππ ), π = 4. An Illustrative Example In this section, a numerical example will be given to verify the theoretical results obtained earlier. 6 Journal of Applied Mathematics 2.5 Example 16. Consider the following singular hybrid coupled network which is similar to one given in [18]: 2 6 πΈπ₯πΜ (π‘) = π΄π₯π (π‘) + π (π₯π (π‘) , π‘) + π ∑ πππ Γπ₯π (π‘) + π’π , π=1 1.5 (39) 1 where π₯π (π‘) = (π₯π1 (π‘), π₯π2 (π‘))π , π(π₯π (π‘), π‘) = ((1/ 15) tanh(π₯π1 (π‘)), tanh(π₯π2 (π‘)))π , π (π‘) = (0, 0)π , πΏ π = 1/15, πΏ = 2/5, π = 1, and 8 0 πΈ=( ), 0 0 −10 1 π΄=( ), 1 −10 −5 1 1 π΅=( 1 1 (1 1 −4 1 1 1 0 1 1 −4 1 0 1 1 1 1 −4 1 0 1 1 0 1 −4 1 ππ1 (π‘) π = 1, 2, . . . , 6, 0 −0.5 1 0 Γ=( ), 0 1 1 0 1) . 0 1 −3) 0.5 −1 −1.5 0 2 4 6 8 10 π‘ Figure 1: Error variable ππ1 (π‘) (π = 1, 2, . . . , 6) of system (39) with π = 1. (40) Since π΅ is symmetric matrix and its six eigenvalues are π 1 = 0, π 2 = −3, π 3 = −4, π 4 = −5, π 5 = −6,and π 6 = −6, there exists a unitary matrix 0.25 0.2 π = (π1 , . . . , π6 ) such that π΅ = πΛππ and Λ = diag(0, −3, −4, −5, −6, −6). Choose 1 0 1 8 1 ππ = ( 10 − π π ) , ), ππ = ( 1 1 0 1 8 (10 − π π ) π π − 10 1 0 ππ = ( ), 0 1 (42) ππ > 4, π = 1, 2, . . . , 6, and π½ = 1/2 satisfying Assumptions 3, 4, and 5. Under the controllers π’π defined in Theorem 9, the singular hybrid system (39) can be synchronized in the finite time π‘∗ = 7.1858 according to Theorem 9 if π = 1. If the controller gain π = 5, π‘∗ = 1.4372. Corresponding simulation results are shown in Figures 1 and 2 with initial conditions 1 3 2 0.7 2.5 0.3 ). π(0) = ( 0.5 −1 0.8 −2 1.5 −0.5 0.15 0.1 ππ2 (π‘) 1 2 1 0 0 0 − − − √6 √6 √6 1 1 1 1 (− 0 − 0 ) ) ( √ √ √ √ 6 6 2 ) ( 6 ) ( 1 ) 1 1 ( 1 ) (41) (− 0 − 0 − ( √6 √2 √6 √6 ) ) ( =( ) 1 1 1 (− 1 0 0 ) ) ( √ √2 √6 ) ( 6 √6 ) ( 1 ) 1 1 ( 1 ) (− 0 − 0 √6 √2 √6 √6 1 2 1 − − 0 0 0 √ √ √ ) ( 6 6 6 0.05 0 −0.05 −1 0 2 4 6 8 10 π‘ Figure 2: Error variable ππ2 (π‘) (π = 1, 2, . . . , 6) of system (39) with π = 1. 5. Conclusions In this paper, we discuss finite-time synchronization of the singular hybrid coupled networks with the assumption that the considered singular systems are regular and impulsivefree. Some sufficient conditions are derived to ensure finitetime synchronization of the singular hybrid coupled networks under a state feedback controller by finite-time stability theory. A numerical example is finally exploited to show the effectiveness of the obtained results. It will be an interesting topic for the future researches to extend new methods to study synchronization, robust control, pinning control, and finite-time synchronization of singular hybrid coupled networks without the assumption that the considered singular systems are regular and impulsive-free. Journal of Applied Mathematics Acknowledgments This work was jointly supported by the National Natural Science Foundation of China under Grant nos. 61272530 and 11072059 and the Jiangsu Provincial Natural Science Foundation of China under Grant no. BK2012741. References [1] F. L. Lewis, “A survey of linear singular systems,” Circuits, Systems, and Signal Processing, vol. 5, no. 1, pp. 3–36, 1986. [2] S. Xu, P. Van Dooren, R. SΜ§tefan, and J. Lam, “Robust stability and stabilization for singular systems with state delay and parameter uncertainty,” IEEE Transactions on Automatic Control, vol. 47, no. 7, pp. 1122–1128, 2002. [3] G. Lu and D. W. C. Ho, “Generalized quadratic stability for continuous-time singular systems with nonlinear perturbation,” IEEE Transactions on Automatic Control, vol. 51, no. 5, pp. 818– 823, 2006. [4] G. Grammel, “Robustness of exponential stability to singular perturbations and delays,” Systems & Control Letters, vol. 57, no. 6, pp. 505–510, 2008. [5] D. M. StipanovicΜ and D. D. SΜiljak, “Robust stability and stabilization of discrete-time non-linear systems: the LMI approach,” International Journal of Control, vol. 74, no. 9, pp. 873–879, 2001. [6] E. Uezato and M. Ikeda, “Strict LMI conditions for stability, robust stabilization, and π»∞ control of descriptor systems,” in Proceedings of the 38th IEEE Conference on Decision and Control, pp. 4092–4097, Phoenix, Ariz, USA, 1999. [7] P. Wang and J. Zhang, “Stability of solutions for nonlinear singular systems with delay,” Applied Mathematics Letters, vol. 25, no. 10, pp. 1291–1295, 2012. [8] Y. Zhang, C. Liu, and X. Mu, “Robust finite-time stabilization of uncertain singular Markovian jump systems,” Applied Mathematical Modelling, vol. 36, no. 10, pp. 5109–5121, 2012. [9] L. Q. Zhang, B. Huang, and J. Lam, “LMI synthesis of π»2 and mixed π»2 /π»∞ controllers for singular systems,” IEEE Transactions on Circuits and Systems II, vol. 50, pp. 615–626, 2003. [10] I. Masubuchi, Y. Kamitane, A. Ohara, and N. Suda, “π»∞ control for descriptor systems: a matrix inequalities approach,” Automatica, vol. 33, no. 4, pp. 669–673, 1997. [11] S. Xu and J. Lam, Robust Control and Filtering of Singular Systems, vol. 332 of Lecture Notes in Control and Information Sciences, Springer, Berlin, Germany, 2006. [12] E. Fridman, “π»∞ -control of linear state-delay descriptor systems: an LMI approach,” Linear Algebra and Its Applications, vol. 15, pp. 271–302, 2002. [13] Y. Xia, J. Zhang, and E.-K. Boukas, “Control of discrete singular hybrid systems,” Automatica, vol. 44, no. 10, pp. 2635–2641, 2008. [14] S. Xu and C. Yang, “π»∞ state feedback control for discrete singular systems,” IEEE Transactions on Automatic Control, vol. 45, no. 7, pp. 1405–1409, 2000. [15] M. S. Mahmoud and N. B. Almutairi, “Stability and implementable π»∞ filters for singular systems with nonlinear perturbations,” Nonlinear Dynamics, vol. 57, no. 3, pp. 401–410, 2009. [16] Z. G. Feng and J. Lam, “Robust reliable dissipative filtering for discrete delay singular systems,” Signal Processing, vol. 92, pp. 3010–3025, 2012. 7 [17] W. J. Xiong, D. W. C. Ho, and J. D. Cao, “Synchronization analysis of singular hybrid coupled networks,” Physics Letters A, vol. 372, pp. 6633–6637, 2008. [18] J. F. Zeng and J. D. Cao, “Synchronisation in singgular hybrid complex networks with delayed coupling,” International Journal of Systems, Control and Communications, vol. 3, pp. 144–157, 2011. [19] J. H. Koo, D. H. Ji, and S. C. Won, “Synchronization of singular complex dynamical networks with time-varying delays,” Applied Mathematics and Computation, vol. 217, no. 8, pp. 3916– 3923, 2010. [20] H. J. Li, Z. J. Ning, Y. H. Yin, and Y. Tang, “Synchronization and state estimation for singular complex dynamical networks with time-varying delays,” Communications in Nonlinear Science and Numerical Simulation, vol. 18, pp. 194–208, 2013. [21] S. Li, W. Tang, and J. Zhang, “Robust control for synchronization of singular complex delayed networks with stochastic switched coupling,” International Journal of Computer Mathematics, vol. 89, no. 10, pp. 1332–1344, 2012. [22] J. Xu and J. Sun, “Finite-time stability of linear time-varying singular impulsive systems,” IET Control Theory & Applications, vol. 4, no. 10, pp. 2239–2244, 2010. [23] X. Huang, W. Lin, and B. Yang, “Global finite-time stabilization of a class of uncertain nonlinear systems,” Automatica, vol. 41, no. 5, pp. 881–888, 2005. [24] L. Wang, S. Sun, and C. Xia, “Finite-time stability of multi-agent system in disturbed environment,” Nonlinear Dynamics, vol. 67, no. 3, pp. 2009–2016, 2012. [25] V. T. Haimo, “Finite time controllers,” SIAM Journal on Control and Optimization, vol. 24, no. 4, pp. 760–770, 1986. [26] S. P. Bhat and D. S. Bernstein, “Finite-time stability of continuous autonomous systems,” SIAM Journal on Control and Optimization, vol. 38, no. 3, pp. 751–766, 2000. [27] Y. Chen and J. H. LuΜ, “Finite time synchronization of complex dynamical networks,” Journal of Systems Science and Mathematical Sciences, vol. 29, no. 10, pp. 1419–1430, 2009. [28] H. Wang, Z. Han, Q. Xie, and W. Zhang, “Finite-time chaos control of unified chaotic systems with uncertain parameters,” Nonlinear Dynamics, vol. 55, no. 4, pp. 323–328, 2009. [29] Y. Z. Sun, W. Li, and D. H. Zhao, “Finite-time stochastic outer synchronization between two complex dynamical networks with different topologies,” Chaos, vol. 22, no. 2, Article ID 023152, 2012. [30] N. Cai, W. Li, and Y. Jing, “Finite-time generalized synchronization of chaotic systems with different order,” Nonlinear Dynamics, vol. 64, no. 4, pp. 385–393, 2011. [31] X. Yang and J. Cao, “Finite-time stochastic synchronization of complex networks,” Applied Mathematical Modelling, vol. 34, no. 11, pp. 3631–3641, 2010. [32] S. Li and Y.-P. Tian, “Finite time synchronization of chaotic systems,” Chaos, Solitons and Fractals, vol. 15, no. 2, pp. 303–310, 2003. [33] W. L. Yang, X. D. Xia, Y. C. Dong, and S. W. Zheng, “Finite time synchronization between two different chaotic systems with uncertain parameters,” Computer & Information Science, vol. 3, pp. 174–179, 2010. [34] L. Wang and F. Xiao, “Finite-time consensus problems for networks of dynamic agents,” IEEE Transactions on Automatic Control, vol. 55, no. 4, pp. 950–955, 2010. [35] S. Yang, J. Cao, and J. Lu, “A new protocol for finite-time consensus of detail-balanced multi-agent networks,” Chaos, vol. 22, Article ID 043134, 2012. 8 [36] L. Wang, Z. Chen, Z. Liu, and Z. Yuan, “Finite time agreement protocol design of multi-agent systems with communication delays,” Asian Journal of Control, vol. 11, no. 3, pp. 281–286, 2009. [37] Q. Hui, W. M. Haddad, and S. P. Bhat, “Finite-time semistability and consensus for nonlinear dynamical networks,” IEEE Transactions on Automatic Control, vol. 53, no. 8, pp. 1887–1900, 2008. [38] Y. Shen and X. Xia, “Semi-global finite-time observers for nonlinear systems,” Automatica, vol. 44, no. 12, pp. 3152–3156, 2008. Journal of Applied Mathematics Advances in Operations Research Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Advances in Decision Sciences Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Mathematical Problems in Engineering Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Algebra Hindawi Publishing Corporation http://www.hindawi.com Probability and Statistics Volume 2014 The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Differential Equations Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Submit your manuscripts at http://www.hindawi.com International Journal of Advances in Combinatorics Hindawi Publishing Corporation http://www.hindawi.com Mathematical Physics Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Mathematics and Mathematical Sciences Journal of Hindawi Publishing Corporation http://www.hindawi.com Stochastic Analysis Abstract and Applied Analysis Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com International Journal of Mathematics Volume 2014 Volume 2014 Discrete Dynamics in Nature and Society Volume 2014 Volume 2014 Journal of Journal of Discrete Mathematics Journal of Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Applied Mathematics Journal of Function Spaces Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Optimization Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014