We prove that, in some simple situations at least, the one-dimensional wave equation is
the limit as the microscopic scale goes to zero of some time-dependent
Newton type equation of motion for atomistic systems. We address both
some linear and some nonlinear cases.
1.
Introduction
Over recent decades, neural networks (NNs) have garnered significant attention and demonstrated success across various engineering and research domains, thereby encompassing image processing, pattern recognition, optimization problems, and associative memory [1,2,3]. Stability properties, which are crucial for effective neural network deployment, include asymptotic and exponential stability. Time delays which are prevalent in numerous control systems [4], poses challenges by potentially destabilizing systems. Consequently, stability analysis, particularly regarding NNs with time delays, is imperative due to the substantial impact of equilibrium point dynamics on practical applications [5,6].
The Lyapunov-Krasovskii functional (LKF) method is a powerful tool for examining the stability of a system. Its effectiveness lies in its ability to identify a positive definite function whose derivative is negative definite along the trajectory of the system [7,8,9]. The choice of an appropriate LKF is crucial to establish the stability criteria. In a notable study [10], a potent methodology known as the delay-product-type functional (DPTF) method was introduced. This method is distinguished by its inclusion of variables that are dependent on the amplitude of the delay. For example, a DPTF $ V(t) $ is formulated as $ V(t) = d(t)\nu_{1}^{T}(t)P_{1}\nu_{1}(t)+(h-d(t))\nu_{2}^{T}(t)P_{2}\nu_{2}(t) $, where $ d(t)P_{1} > 0 $, $ (h-d(t))P_{2} > 0 $ are delay amplitude-dependent matrices, and $ \nu_{1}(t) $, $ \nu_{2}(t) $ denote augmented terms related to the state. Importantly, the derivative of $ V(t) $ unveils the interconnection among terms related to the state, delay amplitude, and delay derivative, which is subsequently integrated into the final linear matrix inequalities (LMIs). Afterwards, in [11], by using Wirtinger-based integral inequality, the nonintegral terms are connected to the integral terms. As shown in [12], it is efficient for reduction of the conservatism if some double integral terms are introduced in Lyapunov functionals. Nevertheless, there exists an intrinsic conservatism in the LKF due to incomplete state vectors $ \nu_{1}(t) $ and $ \nu_{2}(t) $. Various bounding methods have been developed for the stability analysis, including Jensen-based and Wirtinger-based integral inequalities [13,14], as well as slack-matrix-based integral inequalities [15,16,17,18,19], such as the Bessel-Legendre inequality (BLI) [20,21] and the Jacobi-Bessel inequality (JLI) [22]. While BLI offers analytical solutions for constant delay systems, its applicability to time-varying systems is limited due to a reliance on estimated boundaries [23,24,25]. In contrast, affine bessel-Legendre inequality (ABLI) addresses time-varying delay amplitude but suffers from conservatism due to incomplete vectors [26]. To overcome this, generalized free matrix-based integral inequality (GFMBII) was introduced to complement ABLI; however, it still lacked the full incorporation of delay amplitude-dependent slack variables [27]. Although the delay derivative-dependent integral inequality was first introduced in [28], further investigation is warranted as the decision matrices are fixed, thus limiting their flexibility and utilization. This highlights the need for continued research in this area to fully leverage the potential benefits of such integral inequalities.
With the above analysis, this paper focuses on investigating the stability of time-varying delayed NNs. Two kinds of slack matrices with two tunable parameters, which are dependent on both a delay amplitude and a delay derivative, are proposed. These advancements culminate in the formulation of a compound-matrix-based integral inequality (CPBII). By utilizing CPBII, a stability condition tailored for time-varying delayed NNs is developed. Compared to existing literature such as [6,17,19,27], the most significant contribution of this paper is the successful incorporation of both delay amplitude and derivative information into the inequality with the help of a couple of convex parameters. This innovative approach enhances the robustness and accuracy of the analysis. The feasibility of the proposed criterion is demonstrated through a numerical example.
Notation: In this paper, $ \mathbb {R}^{n} $ represents the $ n $-dimensional Euclidean space; $ \mathbb {N} $ represents the nature number; $ He[X] $represents $ X+X^{T} $; $ Co\{\cdots\} $ represents a set of points; $ col [X, Y] $ represents $ [X ^ {T}, Y ^ {T}]^T $; diag$ \{...\} $ represents a block diagonal matrix; and $ X^{T} $ represents the transposition of $ X $.
2.
Problem formation and preliminaries
Let's take the NNs characterized by a time-dependent delays, as depicted by the following equation:
where $ u(t) = col[u_{1}(t), u_{2}(t), u_{3}(t), u_{4}(t), u_{5}(t), ..., u_{n}(t)]\in\mathbb{R}^{n} $ represents the state vector, and $ g(F_{2}u(t)) = col[g_{1}(F_{21}u(t)), g_{2}(F_{22}u(t)), ..., g_{n}(F_{2n}u(t))] $ is the activation function. $ A = diag\{a_{1}, a_{2}, ..a_{n}\} $ is a positive definite diagonal matrix, and $ F_{0} $, $ F_{1} $, $ F_{2} $ are the appropriately dimensional constant matrices. The delay amplitude $ \tau(t) $ and the delay derivative $ \dot{\tau}(t) $ are bounded by constants $ d $ and $ \rho $, respectively, satisfying the following
The activation functions $ g_{i} $ satisfy $ g_{i}(0) = 0 $ for all $ i $. Define $ H^{-} $ and $ H^{+} $ as diagonal matrices with known constants $ h_{i}^{-} $ and $ h_{i}^{+} $, respectively, which can be either positive, negative, or zero. Similarly, let $ G^{-} $ and $ G^{+} $ be positive definite diagonal matrices. Given these definitions and $ m, m_{1}, m_{2} \in \mathbb{R} $, we can deduce the following inequalities from the previously mentioned activation function properties:
We can directly acheive the following inequalities from (2.3) with $ m $, $ m_{1} $, $ m_{2}\in\mathbb{R} $:
where
For simplicity, we use the following notations for $ S\in \mathbb{N} $:
In the existing body of work, such as [18,26,27], the final LMIs often incorporate information about the delay derivative, which is typically derived from the derivatives of the LKFs. Despite this, there has been a noticeable absence of integral inequalities that directly pertain to the delay derivative in the context of time-varying delayed NNs. To address this deficiency, we introduce a novel approach in the form of a CPBII, which is outlined below.
Lemma 1. For any continuously differentiable function $ u :[-d, 0]\rightarrow \mathbb{R}^{n} $, the subsequent inequality is valid for any given parameters $ \gamma_{1} $ and $ \gamma_{2} $, $ R > 0 $, any vector $ \eta $, and slack variables $ M $ and $ N $:
Proof: For any parameters $ \epsilon_{1}, \epsilon_{2}\in[0, 1] $ that satisfy $ \epsilon_{1}+\epsilon_{2} = 1 $, the following relationship holds:
By using the inequalities in [20,27], for free matrices $ M $ and $ N $, we have the following
From $ \tau M^{T}\tilde{R}M+d_\tau N^{T}\tilde{R}N > 0 $, it yields
From the fact
one has $ 0\leq\epsilon_{1}\leq1 $, $ 0\leq\epsilon_{2}\leq1 $, $ \epsilon_{1}+\epsilon_{2} = 1 $.
Substituting (2.8) into (2.6), we have
Considering $ \tau M^{T}\tilde{R}M+d_\tau N^{T}\tilde{R}N > 0 $, $ d\geq\tau\geq0 $, $ 0\leq\frac{\tau d_\tau}{d^2}\leq1 $, and $ 0\leq\frac{\gamma_{1}+\gamma_{2}\dot{\tau}}{\rho}\leq1 $, we obtain the following:
By combining this inequality with the one from the previous lemma, (2.5) is derived. This completes the proof.
Remark 1. In Lemma 1, we present a unique integral inequality, termed as CPBII, which amalgamates slack matrices that are dependent on both the delay amplitude and the delay derivative. This is a pioneering approach in the literature where the delay derivative is factored in [28]. The advantages of CPBII are manifold:
● Through the integration of slack matrices that are influenced by both the delay amplitude and the derivative, the successfully forms a link between vectors related to the system states, the delay amplitude, and the delay derivative. This approach facilitates the retrieval of more interconnected data compared to DPTF, ABLI, and GFMBII, all without the need for extra decision variables.
● The inclusion of parameters $ \gamma_{1} $ and $ \gamma_{2} $ aid in circumventing certain incomplete terms. For example, when $ \gamma_{1} = 0 $ and $ \gamma_{2} = 0 $, the last term $ d_\tau\vartheta^{T}{1}\Gamma{d}^{T}\tilde{R}\Gamma_{d}\vartheta_{1}+\tau\vartheta^{T}{2}\Gamma{h}^{T}\tilde{R}\Gamma_{h}\vartheta_{2} $ is eliminated. Similarly, when $ \gamma_{1} = 0 $, $ \gamma_{2} = 1 $, and $ \dot{d} = \rho $, the first term $ \tau M^{T}\tilde{R}M+d_{\tau}N^{T}\tilde{R}N $ disappears. Furthermore, this parameter enhances the systems adaptability.
Remark 2. As noted from [10], there exist two strategies to mitigate the conservatism. The first involves striving to get as close to the left side of the inequality as possible, while the second entails introducing an adequate number of cross terms to ensure sufficient system information within the final conditions. Therefore, this paper opts for the second strategy, albeit at the expense of the first to a certain degree. The most significant challenge resides in the assignment of values to $ \epsilon_{1} $ and $ \epsilon_{2} $. If these values are not assigned appropriately, it becomes evidently impossible to counterbalance the discrepancy caused by the first strategy.
3.
Main results
In the study [27], it is noted that the delay derivative $ \dot{\tau} $ is present in $ \Gamma_{0}(\tau, \dot{\tau}) $, $ \Gamma_{1}(\tau, \dot{\tau}) $, and $ \Gamma_{3}(\dot{\tau}) $, where it is exclusively coupled with positive definite matrices such as $ P_{1h} $, $ P_{2h} $, $ Q_{1} $, and $ Q_{2} $. Interestingly, the slack matrices that are dependent on the delay derivative are not considered. To exploit the information offered by the delay derivative to its fullest extent, a stability condition for system (2.1) is formulated based on CPBII.
Theorem 1. Provided that there exist positive-definite symmetric matrices $ P $, $ Q_{1} $, $ Q_{2} $, and $ R $, and matrices $ H_{1} $, $ H_{2} $, $ M $, and $ N $, in conjunction with specific scalars $ \gamma_{1} $, $ \gamma_{2} $, $ d $, and $ \rho $, that meet the subsequent inequalities, it can be concluded that system (2.1) exhibits asymptotic stability:
where
Proof: An LKF candidate is formulated as follows:
Setting
one has
Setting $ a = t-\tau, b = t $, it yields the following:
If $ a = t-d, b = t-\tau $, one has the following:
Furthermore, from $ \dot{V}(t) $, we have the following:
where the terms $ \Psi_{1}(\tau, \dot{\tau}) $, $ \Psi_{2}(\tau, \dot{\tau}) $, and $ \Psi_{4}(\dot{\tau}) $ remain consistent with those outlined in previous part. Upon differentiating $ v_{1i}(t) $ and $ v_{2i}(t) $ in $ \eta_{1h}(t) $ and $ \eta_{2h}(t) $, the following results are obtained:
Utilizing Lemma 1, we obtain the following:
where $ \tilde{\Psi}_{3}(\tau, \dot{\tau}) = \frac{(\rho-\gamma_{1}-\gamma_{2}\dot{\tau})}{\rho}d[\tau M^{T}\tilde{R}M+d_{\tau}N^{T}\tilde{R}N\bigg] $. Applying Lemma 1 with $ h = 0 $, one has
where $ \hat{\Psi}_{5}(\tau, \dot{\tau}) = \frac{(\rho-\gamma_{1}-\gamma_{2}\dot{\tau})}{\rho}d\bigg[\tau c_{7}^{T}H^{T}_{1}Z^{-1}H_{1}c_{7}+d_{\tau}c_{8}^{T}H^{T}_{2}Z^{-1}H_{2}c_{8}\bigg] $.
From the fact (2.4)
one has
Based on the discussions above, we can deduce
where $ \bar{\Psi}(\tau, \dot{\tau}) = \tilde{\Psi}(\tau, \dot{\tau})+\hat{\Psi}_{3}(\tau)+\hat{\Psi}_{5}(\tau). $ Define
Here $ a_{2}(\dot{\tau}) $ has been defined in Theorem 1, and $ a_{1} $, $ a_{0} $ are the appropriate dimensional matrices. By the Schur complement lemma, the inequalities are equivalent to $ \tilde{\Psi}(0, \dot{\tau}) < 0 $, $ \tilde{\Psi}(d, \dot{\tau}) < 0 $, and $ -d^{2}a_{2}(\dot{\tau})+\tilde{\Psi}(0, \dot{\tau}) < 0 $. These correspond to the three conditions $ f(0) < 0 $, $ f(d) < 0 $, and $ -d^{2}a_{2}+f(0) < 0 $ in Lemma 2 of Ref. [4]. Therefore, $ \bar{\Psi}(\tau, \dot{\tau}) < 0 $ is ensured for any $ \tau\in[0, d] $.
Additionally, $ \bar{\Psi}(\tau, \dot{\tau}) $ is affine with respect to $ \dot{\tau} $. Therefore, $ \bar{\Psi}(\tau, \dot{\tau}) < 0 $ is ensured for any $ \dot{\tau}\in[\rho_{1}, \rho_{2}] $ by $ \bar{\Psi}(\tau, \rho_{1}) < 0 $ and $ \bar{\Psi}(\tau, \rho_{2}) < 0 $.
In conclusion, based on Theorem 1, for a small positive scalar $ \epsilon $, it follows that $ \dot{V}(t)\leq-\epsilon||u(t)|| < 0 $ for $ u(t)\neq 0 $. This implies the asymptotical stability of NNs (2.1).
Remark 3. In earlier research such as [6,27,28], the inclusion of the delay derivative $ \dot{\tau} $ has predominantly been dependent on the derivative of the LKFs. Yet, the full integration of the delay derivative $ \dot{\tau} $ remains unaccomplished. In contrast to the LKFs, CPBII effectively incorporates the delay derivative $ \dot{\tau} $. This methodology facilitates the concurrent introduction of $ \dot{\tau} $, the delay amplitude $ \rho $, slack matrices M, N, and the augmented vector $ \eta_{h}(t) $ along with positive definite matrices. As a result, the system information can be efficiently interconnected. Additionally, the inclusion of parameters $ \gamma_{1} $ and $ \gamma_{2} $ assists in circumventing zero terms, thereby enabling the extraction of more coupling information. For example, consider $ \rho d(\rho-\gamma_{1}-\gamma_{2}\dot{\tau}) $ in (3.1). If $ \gamma_{1} = 0 $, $ \gamma_{2} = 1 $, and $ \dot{d} = \rho $ are set, the interrelation between $ \dot{\tau} $ and $ \eta_{h}(t) $ is connected via $ N $ would vanish. Furthermore, permitting any parameters where $ \gamma_{1}\leq0 $ and $ \gamma_{2}\leq1 $ (since $ \rho-\gamma_{1}-\gamma_{2}\dot{d}\geq0 $) enhances the adaptability of Theorem 1, in which demonstrates reduced conservatism.
4.
Numerical example
In this section, we will demonstrate the effectiveness of the proposed stability condition.
We scrutinize NN that is characterized by the structure (2.1), where $ F_2 = I $. The parameters employed in this analysis are derived from the study [27]:
As depicted in Table 1, with the same LKF in [27], the maximum allowable upper bound of the delay amplitude is presented for a range of $ \rho $ values. A clear observation from the table is that the conservatism in the results derived in this study is less pronounced compared to previous studies [6,17,19,27]. A comparative analysis between Theorem 1 of this paper and the results of [27] underscores the efficacy of CPBII in mitigating conservatism. Moreover, it is discerned that the parameters $ \gamma_{1} $ and $ \gamma_2 $ augment the adaptability of the stability condition. It should be highlighted that the values of $ \gamma_1 $ and $ \gamma_2 $ in Table 1 are random under $ \gamma_{1}\leq0 $ and $ \gamma_2\leq1 $. Thus, the maximum allowable upper bounds of $ d $ may be larger by choosing more suitable values, which deserves a further study in the future.
On the other hand, by setting $ u(t) = [0.5 0.3-0.3-0.5]^{T} $, $ \tau(t) = 4.7601+0.1sin(t) $, $ g(t) = 0.1tanh(u) $, it can be seen from Figure 1 that the state response is stable, which shows the effectiveness of proposed method.
5.
Conclusions
This study addresseed stability analysis of neural networks with time-varying delays. We introduced to CPBII to incorporate delay derivatives into integral inequalities. Then, a novel stability criterion for such neural networks was derived using CPBII. Notably, CPBII encompassed all augmented vectors and their derivatives from the LKF, thus facilitating comprehensive coupling with the delay amplitude and the delayderivative via slack matrices and tunable parameters. This integration led to less conservative outcomes. The effectiveness of our approach was demonstrated through numerical examples.
Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Author contributions
Writing-original draft, Wenlong Xue; Validation, Zhenghong Jin; Writing-review & editing, Yufeng Tian.
Conflict of interest
The author declares that there is no conflict of interest.