Abstract

This paper focuses on the finite-time synchronization analysis for complex-valued recurrent neural networks with time delays. First, two kinds of common activation functions appearing in the existing references are combined together and more general assumptions are given. To achieve our aim, a nonlinear delayed controller with two independent parameters different from the existing ones is provided, which leads to great difficulty. To overcome it, a newly developed inequality is used. Then, via Lyapunov function approach, some criteria are derived to guarantee the finite-time synchronization of the considered system, and the settling time for synchronization is also estimated. Finally, two numerical simulations are given to support the effectiveness and advantages of the obtained results.

1. Introduction

In recent years, neural networks have been always very important to researchers in various fields, to name a few, control theory and signal processing in electrical engineering, parallel computation and pattern recognition in computer science, and modeling optimization problems in applied mathematics. Moreover, as everyone knows, most applications rely heavily on the dynamical behavior of recurrent neural networks. This sets off a research upsurge for the dynamics of neural networks. As a result, many researchers have put their efforts into the analysis and synthesis problems for the dynamics of neural networks for several decades; see [18] and the references therein.

In most results considering the stability and the stabilization of neural networks, the convergent mode is asymptotically stable and the time for system trajectories to reach an equilibrium point is infinite. However, in practical problems, the convergent time is often required to be faster or even finite. Thus, so as to satisfy this requirement, the topic about finite-time stability appeared. Recently, finite-time stability and synthesis problems for various systems have been hot issues and attracted many scholars’ interests [929]. Among them, finite-time stability, stabilization, synchronization and robust passive control for time-delay systems, stochastic systems, chaotic systems, multiagent systems, and nonlinear systems were studied in [1020]. For various neural networks models, finite-time stabilization, instabilizability, adaptive control, control, and state estimation were discussed in [2226] and finite-time synchronization control problems were addressed in [2729].

On the other hand, a complex-valued recurrent neural networks model has produced a research upsurge for the past few years. The main feature is that it owns complex-valued states, connection weights, and activation functions. This decides that this kind of system can be applied to a wider range involving electromagnetic waves, radar imaging, quantum waves, and so on, but it also leads to more difficulties in analyzing its dynamical behaviors in contrast to real-valued systems. In a word, anyway, the occurrence of complex-valued neural networks draws a great deal of attention from all aspects. Accordingly, many fruitful achievements have been reported for this model [3052]. For example, global stability, global exponential stability, and Hopf bifurcation problems for complex-valued neural networks systems with delays or without delays were investigated in [3240]. Dissipativity, passivity, state estimation, exponential stability, and input-to-state stability for memristor-based complex-valued neural networks with or without delays were discussed and relative criteria were established in [4348]. However, for finite-time stability analysis of delayed complex-valued neural networks models, until now, few results have been developed. The boundedness problem of these systems in finite-time interval is considered in [49, 50]. The finite-time synchronization problem for complex-valued neural networks (CVNNs) with infinite-time distributed delays is discussed in [51] and the finite-time stabilizability and instabilizability for complex-valued memristive neural networks with time delays are studied in [52]. Moreover, considering the rich background of complex-valued neural networks models and the present status of development for them, it is absolutely essential to explore the dynamics of these models deeply. Thus, these further inspire us to make deeper research.

In this article, in view of the unavoidability of time delays [5355], the finite-time synchronization problem for complex-valued recurrent neural networks with time delays is presented. The main contributions of our work are embodied in several points: (1) A nonlinear delayed controller with independent parameters and different from the most existing results is designed to achieve the finite-time synchronization of the considered system. (2) To deal with the difficulty involved by the contribution (1), a new inequality stated in Lemma 6 proposed and proved by us in [52] is used. (3) For real-imaginary separate-type activation functions, two kinds of common functions in the existing references are combined together and more general conditions are assumed in this paper. So the proposed results have broader applications.

The rest of this article is organized as follows. Section 2 provides some preliminaries. Section 3 presents main criteria about the finite-time synchronization for delayed complex-valued recurrent neural networks and estimates the settling time by a new controller. Section 4 gives two numerical simulations to show the validity of theoretical results. Section 5 concludes this paper.

Notation. Throughout this paper, denotes the imaginary unit. For a vector , is named a positive vector if .

2. Preliminaries

Consider a complex-valued recurrent neural networks model as the drive system represented bywith the initial conditionswhere , denotes the number of neurons; is the state variable; is a constant; and are complex-valued connection weights; represents external input vector; is the time delay; ; ; and are complex-valued activation functions.

Let and . For simplicity, set , , , , , , , and . The complex-valued activation functions and are assumed to satisfy the following assumption.

Assumption 1. For any , , , and , , , , there exist scalars , , , and , , , such that the following inequalities hold:

Remark 2. For the dynamic analysis of complex-valued recurrent neural networks models, the most results are based on the existence, continuity, and boundedness of the partial derivatives for real and imaginary parts [32, 33, 46, 49]. Then, by the mean value theorem, it can be proved that they satisfy the inequalities similar to those in Assumption 1. In fact, only the inequalities can be used in the process of obtaining the main results. Thus, the existence, continuity, and boundedness of the partial derivatives are unnecessary and they also lead to limitations in choosing complex-valued activation functions. Here, we remove these constraints and provide a more suitable assumption, Assumption 1, made on the activation functions, so that the current work can be applied to solve more engineering problems. This advantage can be seen from example 2.

Remark 3. It should be noticed that such an assumption is made on the activation functions in the literature [44, 45]; i.e., , for the complex number and the following inequalities hold:for all , where and . Obviously, this assumption is a special case of Assumption 1. Therefore, in this paper, we will not discuss this case in detail, but a numerical example for this case will be provided to show the effectiveness.

In this article, the corresponding response system is defined bywith the initial conditions

Let , , , , , , , , , and . Then, by separating system (1) with (2) and system (5) with (6) into the real and imaginary parts, respectively, we haveand

Define the error vector between the drive system (1) and the response system (5) as ; it follows from (7) and (8) thatLet ; then equation (9) can be rewritten asfor .

Before deriving the main results, the following definition and lemmas are provided.

Definition 4 (see [27]). Consider the drive-response systems (1) with (2) and (5) with (6). If for a suitable controller , there exists a function depending on the initial value , such thatand for , , then the drive system (1) and the response system (5) achieve synchronization in finite time.

Lemma 5 (see [24]). An open set . The class denotes all the strictly increasing continuous functions and . If there exist and a continuous function for system (10) such that(1), ,(2) with , for all , , then, system (10) is finite-time stable and the settling time . In particular, if , then the settling time

Lemma 6 (see [52]). If , , , , then there must exist a scalar depending on and , such that

Remark 7. In order to deal with the finite-time stabilization problem for complex-valued neural networks system and estimate the upper bound of Dini-derivative of Lyapunov function, the inequality in Lemma 6 was proposed and proved by us in Lemma 8 of [52]. Moreover, from the proof of the inequality stated in [52], we can see that either or , which can be used to compute the settling time. This point can be shown in examples 1 and 2.

Lemma 8 (see [24]). For real numbers and , the following inequality holds:

3. Main Result

In this section, new sufficient conditions will be derived to ascertain the finite-time synchronization for system (1) and (5). The new nonlinear controller in response system (5) is designed as the following form:where , , , , , , , and are constants for .

Remark 9. In this paper, we design the controller (15) with independent parameters and , which are different from the most existing results based on , such as [17, 18, 22]. This is one of the main features for our work, which also leads to difficulty in studying finite-time dynamic behavior of the considered system. To solve this difficulty, we use the inequality in Lemma 6 proposed and proved by us in [52].

First, for convenience, we denote

Based on the controller (15), the main result of our paper can be obtained as follows.

Theorem 10. Under Assumption 1, if the vectors and , then via the controller (15), the drive system (1) and the response system (5) are synchronized in finite time. Moreover, the settling time satisfies , where , , , , and depending on and .

Proof. If holds, then for all , we haveSimilarly, if holds, then for all , we haveFor the error system (9) or (10), choose the following Lyapunov function:Along the trajectories of system (9) or (10) and by (15), the upper Dini-derivative of can be computed asBy means of Assumption 1, can be bounded asBy uniting like terms, we haveThen, by taking the common factors, one hasThen, by (17) and (18), one can obtainwhere , , , . In addition, by Lemma 8, for , , the following inequalities hold:Then, substituting (25) into (24), one hasBy Lemma 6, there exists a depending on and , such thatMoreover, , for all . Thus, from Lemma 5, we know that the error system (9) or (10) is finite-time stable. That is to say, the drive system (1) and the response system (5) can be synchronized in finite time via the controller (15). This completes the proof.

Remark 11. Recently, the finite-time stabilization and synchronization problems of real-valued neural networks have been investigated and the time for system trajectories tending to an equilibrium point is finite [2229]. However, for finite-time stability analysis of complex-valued neural networks models, until now, few results have been developed. For instance, the finite-time synchronization problem for complex-valued neural networks (CVNNs) with infinite-time distributed delays is discussed in [51] and the finite-time stabilizability and instabilizability for complex-valued memristive neural networks with time delays are studied in [52]. Here, Theorem 10 further provides sufficient conditions for the finite-time synchronization of the considered system and their effectiveness can be illustrated in numerical examples. From the point of theory development, our result is significant in dynamical behavior analysis of complex-valued models and it can be regarded as the extension of the previous work.

4. Numerical Examples

This section will provide two examples to show the effectiveness of the given conditions of Theorem 10.

Example 12. Consider complex-valued neural networks as the drive system given bywhere , , , , , , , , , , , , , and . Moreover, the activation functions are taken asThen, from Assumption 1, it can be computed that , , , , , and for .

The response system is provided by

Under the initial conditions , , , and for , Figures 1 and 2 depict the trajectories of systems (28) and (30) without controller, which show that the drive system (28) does not synchronize with the response system (30).

By choosing the parameters of the controller (15) as , , , , , , , , , , and , it is easy to check that the conditions of Theorem 10 are satisfied. Then, under the corresponding controller, the drive system (28) can be synchronized with the response system (30) in finite time. In addition, according to Theorem 10 and Remark 7, it can be computed that seconds. The synchronization curves between the drive system (28) and the response system (30) are displayed in Figure 3. The time responses of the synchronization errors between them are shown in Figure 4. From Figures 3 and 4, it can be seen that system (28) can synchronize with system (30) in finite time via the corresponding controller under the given initial values. These also further show that the obtained result is effective and our work is meaningful.

Next, one example with special activation functions stated as in Remarks 2 and 3 is given to illustrate the validity of our result.

Example 13. Consider a drive system as follows:where , , , , , , , , , , , , , and . The activation functions are chosen asObviously, and do not exist. Hence, the obtained results in many references, such as [32, 33, 46, 49], cannot be applied in these functions. This leads to limitations for their results in applications whereas our work has just filled the gap. Moreover, from Assumption 1, it is easy to obtain that , for .

The response system is given by

Under the initial conditions , , , and for , Figures 5 and 6 depict the trajectories of systems (31) and (33) without controller, which shows that the drive system (31) does not synchronize with the response system (33).

By choosing the parameters of the controller (15) as , , , , , , , , , , , it is easy to check that the conditions of Theorem 10 are satisfied. Thus, under the corresponding controller, the drive system (31) can be synchronized with the response system (33) in finite time. Moreover, according to Theorem 10 and Remark 7, we get seconds by simple calculation. The synchronization curves between the drive system (31) and the response system (33) are shown in Figure 7. The time responses of the synchronization errors between them are depicted in Figure 8. From Figures 7 and 8, it can be seen that system (31) can synchronize with system (33) in finite time via the corresponding controller under the given initial values. This example also further illustrates the effectiveness and superiority of our proposed result.

5. Conclusion

In this paper, the finite-time synchronization problem of complex-valued recurrent neural networks with time delays has been studied. Based on the more general assumptions for activation functions, a nonlinear controller with independent parameters, and a new inequality proposed and proved by us in [52], some sufficient conditions have been established and the settling time for synchronization has been estimated. The obtained results have been shown to be effective and superior by two examples. Moreover, it is well known that the systems with stochastic terms are more extensive in practical applications [5660], such as the noises, and we will discuss the addressed models with noises deeply in the future.

Data Availability

No data was used in this study.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (61503222, 61673227, 61573008, 61773245), in part by NSERC, Canada, in part by the Research Fund for the Taishan Scholar Project of Shandong Province of China, in part by the Project funded by Chinese Postdoctoral Science Foundation (2016M602166), and in part by the Fund for Postdoctoral Applied Research Projects of Qingdao (2016116).