Next Article in Journal
Tax Fraud Reduction Using Analytics in an East European Country
Next Article in Special Issue
Advancements in Numerical Methods for Forward and Inverse Problems in Functional near Infra-Red Spectroscopy: A Review
Previous Article in Journal
Interval Valued Pythagorean Fuzzy AHP Integrated Model in a Smartness Assessment Framework of Buildings
Previous Article in Special Issue
Multiplicative Mixed-Effects Modelling of Dengue Incidence: An Analysis of the 2019 Outbreak in the Dominican Republic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Accelerated Double-Integral ZNN with Resisting Linear Noise for Dynamic Sylvester Equation Solving and Its Application to the Control of the SFM Chaotic System

1
College of Computer Science and Engineering, Jishou University, Jishou 416000, China
2
School of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(3), 287; https://doi.org/10.3390/axioms12030287
Submission received: 3 February 2023 / Revised: 23 February 2023 / Accepted: 3 March 2023 / Published: 9 March 2023
(This article belongs to the Special Issue Mathematical Methods in the Applied Sciences)

Abstract

:
The dynamic Sylvester equation (DSE) is frequently encountered in engineering and mathematics fields. The original zeroing neural network (OZNN) can work well to handle DSE under a noise-free environment, but may not work in noise. Though an integral-enhanced zeroing neural network (IEZNN) can be employed to solve the DSE under multiple-noise, it may fall flat under linear noise, and its convergence speed is unsatisfactory. Therefore, an accelerated double-integral zeroing neural network (ADIZNN) is proposed based on an innovative design formula to resist linear noise and accelerate convergence. Besides, theoretical proofs verify the convergence and robustness of the ADIZNN model. Moreover, simulation experiments indicate that the convergence rate and anti-noise ability of the ADIZNN are far superior to the OZNN and IEZNN under linear noise. Finally, chaos control of the sine function memristor (SFM) chaotic system is provided to suggest that the controller based on the ADIZNN has a smaller amount of error and higher accuracy than other ZNNs.

1. Introduction

The Sylvester equation is a crucial matrix equation. It has a crucial position in many fields, such as image fusion [1], object detection [2], control configuration selection [3], fast tensor product solution [4], robotics [5,6,7,8], permanent magnet synchronous motors [9] and mobile manipulators [10]. Therefore, finding a quick solution to handle the dynamic Sylvester equation (DSE) is exceptionally crucial. Many scholars previously utilized numerical methods to solve the Sylvester equation, such as the Hessenberg–Schur iteration method [11] and Krylov subspace methods [12]. Nevertheless, numerical methods are only suitable for small-scale matrix issues and cannot solve DSE well. In recent years, the advantages of feedforward neural networks and recurrent neural networks (RNNs) with the parallel process and easy implementation in hardware have been gradually excavated [13,14,15,16]. The gradient neural network (GNN), an important type of RNN, has become increasingly popular in high-dimensional Sylvester equation solving [17,18]. Nevertheless, when the GNN approach was extended to dynamic domains, researchers discovered the two defects of GNN: first, the GNN method cannot make the residual value reach zero; second, its convergence rate is deficient.
After that, the original zeroing neural network (OZNN) was reported, aiming at the shortcomings of the GNN [19]. With the development of the zeroing neural network (ZNN) model, many scholars have focused on ZNN because it can deal with many dynamic mathematical problems [20,21,22]. Simultaneously, scholars constantly improved and innovated on the basis of the ZNN and they obtained many derived ZNN models for specific problems [7,9,23,24,25]. For instance, He et al. presented a double-accelerated ZNN for handling dynamic matrix inversion [23]. Xiao et al. proposed two nonlinear ZNN models and applied them to the 3D moving target location [24]. A noise-suppression variable parameter ZNN was proposed to handle the DSE [26]. In addition, there is much related work on the universal DSE [27,28].
It is worth noting that noise cannot be ignored, and it will affect the stability of the system [29,30,31]. Therefore, we should consider both convergence and robustness when designing ZNN models [32,33,34]. In order to better suppress noise, the PID control method is usually used by the public [35]. The control principle also mentions that the integral term can eliminate noise so that the error in the system is continuously reduced. Thus, the integral-enhanced ZNN model (IEZNN) was designed [32], and the integral term made up for the defect that the original ZNN could not suppress noise. Besides, many anti-noise ZNNs were researched and applied [36,37,38].
Nevertheless, the IEZNN model cannot suppress linear noise well. Many researchers point out that the activation functions can accelerate convergence and suppress noise [39,40,41]. Utilizing double integration and the fixed-time activation function (FTAF), we propose an accelerated double integral ZNN (ADIZNN) model with anti-linear noise interference to settle the DSE under linear noise. In brief, the ADIZNN has the characteristic of accelerated convergence and enhanced robustness due to the introduction of the FTAF and the double integral term. In addition, the theoretical proofs and simulation experiments under the linear noise environments are given. At last, the design ideas of ZNNs are extended to chaos control of the SFM chaotic system to show that the controller based on the ADIZNN has significant advantages compared with other controllers.
The remaining part of this paper is divided into five sections. Section 2 introduces the OZNN, IEZNN and ADIZNN models. Theoretical analyses of the ADIZNN are provided in Section 3. Section 4 offers two specific examples under linear noise. Besides, the chaos control experiment of the SFM chaotic system is provided in Section 5. Section 6 is the summary part of paper. These are the significant contributions of this research.
  • Based on the novel ZNN design formula, an innovative ADIZNN is constructed for settling the dynamic Sylvester equation under the linear noise.
  • The ADIZNN model has a novel double integral structure and activation function, which guarantees accelerated convergence and enhanced anti-noise capacity.
  • Theoretical analyses and simulation results are provided to ensure that the ADIZNN model can handle the DSE with excellent convergence and robustness.
  • Chaos control schemes of the TFM chaotic system are established to display that the controller based on the ADIZNN has superior performance than that based on the OZNN and IEZNN.

2. DSE Description and Models Design

Firstly, the general dynamic Sylvester equation (DSE), OZNN and IEZNN are offered. Posteriorly, the novel ADIZNN model proposed is particularly elaborated.

2.1. Description of DSE

The definition of the DSE is described in detail as follows:
U ( t ) P ( t ) P ( t ) V ( t ) + G ( t ) = 0 ,
in which U ( t ) , V ( t ) , G ( t ) R n × n are time-varying matrices, and P ( t ) R n × n is an unknown matrix.
The purpose of the ZNN model is to solve the unknown P ( t ) in Equation (1) under noise, and the theoretical solution is denoted by P * ( t ) . Moving matrix G ( t ) of (1), we have
U ( t ) P ( t ) P ( t ) V ( t ) = G ( t ) .
For further derivation, we need to vectorize Equation (2) and obtain
I n U ( t ) V T ( t ) I n vec P ( t ) = vec G ( t ) ,
in which I n R n × n is an identity matrix, and vec ( · ) and the symbol ⊗ signify the vectorization and Kronecker product operation. Setting Q ( t ) = I n U ( t ) V T ( t ) I n R n n × n n , p ( t ) = vec P ( t ) R n n × 1 , g ( t ) = vec G ( t ) R n n × 1 of (3), the DSE is transformed into a linear equation:
Q ( t ) p ( t ) = g ( t ) .
For monitoring the solution process, we define
W ( t ) = Q ( t ) p ( t ) + g ( t )
as an error function. The derivative of (4) with respect to time can be written as
W ˙ ( t ) = Q ˙ ( t ) p ( t ) + Q ( t ) p ˙ ( t ) + g ˙ ( t ) .

2.2. Relevant Models Design

A detailed description of the relevant models are introduced in this subsection. The design formula of error in the ZNN model is defined as
W ˙ ( t ) = ξ Φ W ( t ) ,
in which ξ R + and Φ · is a mapping array composed by the activation function. The elemental form of (6) is as follows
w ˙ i ( t ) = ξ ϕ w i ( t ) ,
where ϕ ( · ) denotes the nonlinear monotone non-decreasing odd activation function, and w i ( · ) and ϕ ( · ) are element forms of the W ( · ) and Φ · , where i = 1 , 2 , , n 2 . When ϕ ( · ) is the linear activation function (i.e., ϕ ( ı ) = ı ), we get the design formula of the OZNN model:
W ˙ ( t ) = ξ W ( t ) .
Considering the case of linear noise, the design formula of the OZNN is
W ˙ ( t ) = ξ W ( t ) + Z ( t ) ,
where Z ( t ) R n n × 1 refers to linear noise. Linear noise is a significant kind of noise, and it is generally shaped like Z ( t ) = A t + B , where A , B R n n × 1 . Let z i ( t ) , a i and b i stand for the ith elements of Z ( t ) , A and B. Then, the element form of Z ( t ) is rewritten as z i ( t ) = a i t + b i . Substituting Equations (4) and (5) into (8), the OZNN model to solve the DSE is obtained
Q ( t ) p ˙ ( t ) = Q ˙ ( t ) p ( t ) g ˙ ( t ) ξ Q ( t ) p ( t ) + g ( t ) + Z ( t ) .
On this basis, Jin et al. added an integral term to suppress the noise and proposed an integral-enhanced ZNN (IEZNN) [32], and its design formula is
W ˙ ( t ) = ξ W ( t ) λ 0 t W ( τ ) d τ ,
with ξ and λ R > 0 . Then, we obtain the case of (10) under noise:
W ˙ ( t ) = ξ W ( t ) λ 0 t W ( τ ) d τ + Z ( t ) .
Substituting (4) and (5) into (11), the model of the IEZNN can be rewritten as
Q ( t ) p ˙ ( t ) = Q ˙ ( t ) p ( t ) g ˙ ( t ) ξ Q ( t ) p ( t ) + g ( t ) λ 0 t Q ( τ ) p ( τ ) + g ( τ ) d τ + Z ( t ) .
Now that all the relevant models descriptions are complete, the accelerated double integral ZNN will be introduced.

2.3. ADIZNN Model Design

In this subsection, an accelerated double integral ZNN (ADIZNN) model is proposed, which can resist the linear noise effectively. We know that W ˙ ( t ) = ξ Φ W ( t ) from Section 2.2, to describe the evolution of the model more intuitively, set
Θ ( t ) = W ˙ ( t ) + ξ Φ W ( t ) ,
where Φ ( · ) denotes the fixed-time activation function (FTAF) here, and its element form is
ϕ ( ı ) = ( ε 1 | ı | μ + ε 2 | ı | σ ) sign ( ı ) + ε 3 ı + ε 4 sign ( ı ) ,
in which ε 1 and ε 2 > 0 , ε 3 and ε 4 0 , 0 < μ < 1 , σ > 1 .
Remark 1.
We make some detailed remarks about FTAF (14).
  • The   ε 1 | ı | μ sign(ı) and ε 2 | ı | σ sign(ı) of FTAF (14) are to accelerate convergence.
  • The ε 3 ı and ε 4 sign(ı) of FTAF (14) are to suppress noise;
In addition, let
Θ ( t ) = λ 0 t Θ ( τ ) d τ ,
with λ R + . We define
Y ( t ) = Θ ( t ) + λ 0 t Θ ( τ ) d τ .
Substituting (13) into (15), one can get
Y ( t ) = W ˙ ( t ) + ξ Φ W ( t ) + λ 0 t W ˙ ( τ ) + ξ Φ W ( τ ) d τ .
Similarly, set
Y ( t ) = λ 0 t Y ( τ ) d τ .
Substituting (16) into (17), we obtain
W ˙ ( t ) + ξ Φ W ( t ) + λ W ( t ) + λ ξ 0 t Φ W ( τ ) d τ = λ 0 t W ˙ ( τ ) + ξ Φ W ( τ ) + λ W ( τ ) + λ ξ 0 τ Φ W ( σ ) d σ d τ = λ W ( t ) λ ξ 0 t Φ W ( τ ) d τ λ 2 0 t W ( τ ) d τ λ 2 ξ 0 t 0 τ Φ W ( σ ) d σ d τ .
Thus, the design formula of the ADIZNN for DSE is obtained:
W ˙ ( t ) = 2 λ W ( t ) ξ Φ W ( t ) λ 2 0 t W ( τ ) d τ 2 λ ξ 0 t Φ W ( τ ) d τ λ 2 ξ 0 t 0 τ Φ W ( σ ) d σ d τ .
Furthermore, the design formula of the ADIZNN with noise can be written as
W ˙ ( t ) = 2 λ W ( t ) ξ Φ W ( t ) λ 2 0 t W ( τ ) d τ 2 λ ξ 0 t Φ W ( τ ) d τ λ 2 ξ 0 t 0 τ Φ W ( σ ) d σ d τ + Z ( t ) .
Furthermore, W ( t ) = Q ( t ) p ( t ) + g ( t ) and W ˙ ( t ) = Q ˙ ( t ) p ( t ) + Q ( t ) p ˙ ( t ) + g ˙ ( t ) are already known. Hence, the ADIZNN model that included noise can be further obtained:
Q ( t ) p ˙ ( t ) = Q ˙ ( t ) p ( t ) g ˙ ( t ) 2 λ Q ( t ) p ( t ) + g ( t ) ξ Φ Q ( t ) p ( t ) + g ( t ) 2 λ ξ 0 t Φ Q ( τ ) p ( τ ) + g ( τ ) d τ λ 2 0 t Q ( τ ) p ( τ ) + g ( τ ) d τ λ 2 ξ 0 t 0 τ Φ Q ˙ ( σ ) p ( σ ) + Q ( σ ) p ˙ ( σ ) + g ˙ ( σ ) d σ d τ + Z ( t ) .
Remark 2.
We make some detailed remarks about ADIZNN (19).
  • Based on the novel ZNN design formula, an innovative ADIZNN is constructed for settling the DSE under the linear noise.
  • The novel double integral structure and activation function, which guarantees accelerated convergence and enhanced anti-noise capacity.

3. Theoretical Analyses

We mainly discuss and prove properties of the ADIZNN in this section. In order to better express the Frobenius norm of W ( t ) , we introduce the error norm W ( t ) F = Q ( t ) p ( t ) + g ( t ) F .

3.1. Convergence

The convergence performance of ADIZNN (19) is investigated and studied under the ideal noise-free condition in this subsection.
Theorem 1.
Given matrices U ( t ) R n × n , V ( t ) R n × n and G ( t ) R n × n . From any initial value P ( 0 ) , the error norm W ( t ) F of ADIZNN (19) can reach zero under the ideal noise-free condition, that is,
lim t W ( t ) F = 0 .
Proof of Theorem 1.
In order to give a clearer proof process, let w i ( t ) , θ i ( t ) , γ i ( t ) and ϕ ( · ) represent the elements form of W ( t ) , Θ ( t ) , Y ( t ) and Φ ( · ) . First, considering
Y ( t ) = W ˙ ( t ) + ξ Φ W ( t ) + λ 0 t W ˙ ( τ ) + ξ Φ W ( τ ) d τ ,
ADIZNN model (19) under the noiseless environment can be transformed into
Y ( t ) = λ 0 t Y ( τ ) d τ .
The element form of (21) is
γ i ( t ) = λ 0 t γ i ( τ ) d τ .
Then, the derivative of (22) is
γ ˙ i ( t ) = λ γ i ( t ) .
Setting a Lyapunov equation
( t ) = γ i 2 ( t ) ,
its derivative is
˙ ( t ) = 2 γ ˙ i ( t ) γ i ( t ) .
Substituting (23) into (24), we have
˙ ( t ) = 2 λ γ i ( t ) γ i ( t ) = 2 λ γ i 2 ( t ) .
Because ( t ) is positive definite and ˙ ( t ) is negative definite, ( t ) is globally asymptotically stable, and we have
lim t ( t ) = lim t γ i 2 ( t ) = lim t γ i ( t ) = 0 .
Thus, γ i = w ˙ i ( t ) + ξ ϕ w i ( t ) + λ 0 t w ˙ i ( τ ) + ξ ϕ w i ( τ ) d τ = 0 as t based on (20) and (25). Considering θ i ( t ) = w ˙ i ( t ) + ξ ϕ w i ( t ) , then we have
θ i ( t ) = λ 0 t θ i ( τ ) d τ , t .
Therefore,
lim t θ i ( t ) + λ 0 t θ i ( τ ) d τ = 0 .
It is not difficult to know
lim t θ i ( t ) = lim t λ 0 t θ i ( τ ) d τ .
The derivative of the above equation is
lim t θ ˙ i ( t ) = lim t λ θ i ( t ) + Δ , Δ 0 ,
where Δ is a small error in the derivative of θ i ( t ) . Setting another Lyapunov equation
( t ) = θ i 2 ( t ) .
The derivative of (27) is
˙ ( t ) = 2 θ ˙ i ( t ) θ i ( t ) = 2 λ θ i 2 ( t ) .
According to the Lyapunov theorem, we get
lim t θ i ( t ) = 0 .
Because θ i ( t ) = w ˙ i ( t ) + ξ ϕ w i ( t ) , thus,
lim t θ i ( t ) = lim t w ˙ i ( t ) + ξ ϕ w i ( t ) = 0 .
Thus,
w ˙ i ( t ) = ξ ϕ w i ( t ) .
Clearly, we get
lim t w i ( t ) = 0 .
Thus, writing it in matrix form gives the following
lim t W ( t ) F = 0 .
The proof is completed now.    □

3.2. Robustness

Furthermore, the ADIZNN model can still approximate the theoretical solution infinitely when solving the DSE in a noisy environment. In other words, the ADIZNN model has strong robustness. Its robustness proof process is presented below.
Theorem 2.
Given matrices U ( t ) R n × n , V ( t ) R n × n and G ( t ) R n × n , the identity matrix I n R n × n . From any initial value P ( 0 ) , P ( t ) of the proposed ADIZNN can reach P * ( t ) in solving the DSE under the linear noise condition, that is,
lim t W ( t ) F = 0 .
Proof of Theorem 2.
Linear noise can be written as
Z ( t ) = A t + B ,
where A R n n × 1 and B R n n × 1 are constant matrices. Its element form can be written as
z i ( t ) = a i t + b i .
According to (20) and (21) of Theorem 1, the ADIZNN model (19) can be converted to
Y ( t ) = λ 0 t Y ( τ ) d τ + Z ( t ) .
Its element is
γ i ( t ) = λ 0 t γ i ( κ ) d κ + z i ( t ) .
Taking the derivative of γ i twice, we get
γ ¨ i ( t ) = λ γ ˙ i ( t ) + z ¨ i ( t ) .
Differentiating the linear noise once and twice yield z ˙ i ( t ) = a and z ¨ i ( t ) = 0 . Then,
γ ¨ i ( t ) = λ γ ˙ i ( t ) .
We set up a Lyapunov function ( t ) = γ ˙ i 2 ( t ) , so
˙ ( t ) = 2 γ ¨ i ( t ) γ ˙ i ( t ) = λ γ ˙ i 2 ( t ) .
Due to the ( t ) being positive definite and ˙ ( t ) being negative definite, ( t ) is globally asymptotically stable, and we have
lim t ( t ) = lim t γ ˙ i 2 ( t ) = lim t γ ˙ i ( t ) = 0 .
According to (31) and (33), we obtain
lim t γ ˙ i ( t ) = lim t λ γ i ( t ) + z ˙ i ( t ) = 0 .
We know that z ˙ i ( t ) = a , so it is not hard to figure out
lim t λ γ i ( t ) + a = 0 .
Then it is concluded that
lim t λ γ i ( t ) = a .
Thus we get
lim t γ i ( t ) = a λ .
Thus γ i ( t ) = w ˙ i ( t ) + ξ ϕ w i ( t ) + λ 0 t w ˙ i ( τ ) + ξ ϕ w i ( τ ) d τ = a / λ as t . Let
θ i ( t ) = w ˙ i ( t ) + ξ ϕ w i ( t ) ,
then we have γ i ( t ) = θ i ( t ) + λ 0 t θ i ( τ ) d τ = a / λ as t . Thus we can infer that
lim t θ ˙ i ( t ) + λ θ i ( t ) = 0 .
Then, we can draw
lim t θ ˙ i ( t ) = lim t λ θ i ( t ) .
Obviously, due to λ > 0 , θ ˙ i ( t ) and θ i ( t ) having different signs, thus we get
lim t θ i ( t ) = 0 .
In addition, θ i ( t ) = w ˙ i ( t ) + ξ ϕ w i ( t ) is known from (34), that means
lim t θ i ( t ) = lim t w ˙ i ( t ) + ξ ϕ w i ( t ) = 0 .
The above equation and (28) are the same, we can say
lim t w i ( t ) = 0 .
The corresponding matrix form is
lim t W ( t ) F = 0 .
Thus, the proof is accomplished now.   □

4. Examples Verification

In Section 3, the properties of the ADIZNN are proved. In this section, comparative experiments are adopted to highlight the outstanding performance of ADIZNN (19). The OZNN (9), IEZNN (12) and ADIZNN (19) models are applied in solving the dynamic Sylvester equation problem. Besides, P * ( t ) refers to the theoretical value of P ( t ) in the experiment 1 and experiment 2.
Remark 3.
Sylvester matrix equations play an important role in the field of control [3,42,43], and they are widely used in the fields of manipulators [10], signal processing [1,44] and statistics [45]. For example, the redundant decomposition of manipulator in the Ref. [10] can first be represented by the quadratic programming problem with equality constraints, then this problem can be further converted into a dynamic linear equation (i.e., a special case of the DSE when V ( t ) = 0 ) by the Lagrange multiplier method. Therefore, this paper only verifies the effect of the proposed model to solve the DSE, which can be extended to related fields.

4.1. Experiment 1

The dynamic matrices U ( t ) , V ( t ) and G ( t ) are provided
U ( t ) = s ( 2 t ) c ( 2 t ) c ( 2 t ) s ( 2 t ) , V ( t ) = t 0 0 2 , G ( t ) = s ( 3 t ) c ( 3 t ) 2 s ( 3 t ) 2 c ( 3 t ) ,
where s ( · ) and c ( · ) represent the sine function and cosine function. The default model parameters are: ξ = 2 , λ = 1 , ε 1 = ε 2 = ε 3 = ε 4 = 0.5 and μ = 0.5 , σ = 2 .
Figure 1 presents state trajectories synthesized by the OZNN model (9), IEZNN model (12) and ADIZNN model (19) using FTAF (14) for the DSE with (35) in the noiseless environment. It is obvious that the OZNN model (9), IEZNN model (12) and ADIZNN model (19) can fit the theoretical solutions in a noiseless environment. Even without linear noise, ADIZNN (19) has the fastest convergence speed, which means that its convergence performance is better than the other two models.
Although in the noiseless environment, all three models can fit the theoretical value, model testing in noisy environment is more important. In Figure 2, we explore the state trajectories of these three models under linear noise z i ( t ) = t / 4 + 4 for the DSE with (35). Obviously, the OZNN’s state trajectory completely deviates from the theoretical results, that is to say, OZNN (9) cannot calculate the theoretical result of DSE under z i ( t ) = t / 4 + 4 . In Figure 2, the fitting trend of IEZNN (12) is closer and closer to P * ( t ) with the increase of t, p 11 ( t ) , p 12 ( t ) , p 21 ( t ) and p 22 ( t ) of IEZNN (12) still cannot converge to p 11 * ( t ) , p 12 * ( t ) , p 21 * ( t ) and p 22 * ( t ) . However, the p 11 ( t ) , p 12 ( t ) , p 21 ( t ) and p 22 ( t ) of ADIZNN (19) converge to theoretical values within 1.3 s. The above results are sufficient to illustrate that ADIZNN (19) can suppress z i ( t ) = t / 4 + 4 when solving the DSE problem.
Remark 4.
Here, we have a discussion of the results of the comparison about Figure 1 and Figure 2. Since the OZNN model (9) does not contain an integral term, it has no ability to suppress linear noise. The IEZNN model (12) contains an integral term, which can resist linear noise to a certain extent, and the error results obtained by solving the DSE with the IEZNN model (12) are not satisfactory. However, the ADIZNN model (19) contains the double integral term and FTAF (14), which can effectively suppress linear noise, and its convergence time is much faster than IEZNN.
In Figure 3, we study the error norms W ( t ) F of OZNN model (9), IEZNN model (12) and ADIZNN model (19) with ξ = 2 and λ = 1 under the different noise environments for the two-dimensional matrices (35). Figure 3a–d correspond to z i ( t ) = 0 , z i ( t ) = t / 4 + 4 , z i ( t ) = 4 t + 4 and z i ( t ) = 16 t + 4 , respectively. From Figure 3a, W ( t ) F of the OZNN model (9), IEZNN model (12) and ADIZNN model (19) can achieve convergence to zero. However, in the comparison of convergence time, the OZNN model (9) is the slowest, and the IEZNN (12) and ADIZNN model (19) can converge within 1.3 and 4.7 s, respectively. Under linear noise, the information suggested by the Figure 3b–d is that the error norms W ( t ) F of the OZNN model (9) and IEZNN model (12) present a divergence trend. However, W ( t ) F of the ADIZNN model (19) can converge under the linear noise, and the convergence accuracy can reach 1 × 10 3 . It can be seen that the convergence accuracy of the ADIZNN model (19) does not decrease with the increase of linear noise z i ( t ) . Besides, the detailed comparison of the three models under the four different noises is given in Table 1.
Furthermore, the different parameters of ADIZNN (19) are reported for the DSE with (35) under the noise z i ( t ) = 16 t + 4 in Figure 4. The parameter λ = 1 of the ADIZNN is fixed, and ξ = 1.2 , ξ = 2.4 , ξ = 3.6 are selected respectively in Figure 4a. Then, the parameter ξ = 1 of the ADIZNN is fixed, and λ = 0.8 , λ = 1.6 , λ = 2.4 are investigated respectively in Figure 4b. From Figure 4a,b, as ξ and λ increase, the convergence speed of ADIZNN (19) becomes faster. By contrast, the gain of parameter λ on the convergence rate of the model is greater than that of parameter ξ .

4.2. Experiment 2

Furthermore, the two-dimensional matrices are extended to the four-dimensional matrices are considered:
U ( t ) = s ( t ) s ( t ) s ( t ) c ( t ) s ( t ) c ( t ) c ( t ) s ( t ) s ( t ) c ( t ) c ( t ) s ( t ) c ( t ) s ( t ) s ( t ) c ( t ) , V ( t ) = t 0 0 0 0 1 t + 1 0 0 0 0 t + 2 0 0 0 0 1 , G ( t ) = s ( 3 t ) s ( 3 t ) s ( 3 t ) c ( 3 t ) 0 s ( 3 t ) c ( 3 t ) c ( 3 t ) 0 0 c ( 3 t ) c ( 3 t ) 0 0 0 c ( 3 t ) .
The parameters of FTAF (14) are ε 1 = ε 2 = ε 3 = ε 4 = 0.5 and μ = 0.5 , σ = 2 .
Figure 5 presents the error norms W ( t ) F of OZNN (9), IEZNN (12) and ADIZNN (19) with ξ = 2 and λ = 1 under the different noise environments for the four-dimensional matrices (36). In Figure 5a, all three models can achieve convergence in a noiseless environment, but the convergence rate of ADIZNN (19) is much faster than OZNN (9) and IEZNN (12). However, the convergence time of these three models is very different. ADIZNN (19) can achieve convergence within 1.1 s, OZNN (9) can achieve convergence within 5.2 s, and IEZNN (12) takes a longer time to achieve convergence. Figure 5b–d presents the error norms W ( t ) F of ADIZNN (19) can achieve convergence, while the error norms of the other two models are diverging. It can be seen that when the noise are z i ( t ) = t / 4 + 4 , z i ( t ) = 4 t + 4 and z i ( t ) = 16 t + 4 , the convergence time of ADIZNN (19) are 1.1 s, 2.1 s and 4.3 s, respectively. It shows that only ADIZNN (19) can still solve the DSE problem under linear noise well for the high-dimensional matrices.

5. Application to the Control of the Sine Function Memristor Chaotic System

The design method of ZNN can not only be effectively used to solve the DSE, but also can be utilized for the control of the chaotic system. Chaotic system [46] is a kind of common nonlinear systems, which is widely used in secure communication [47,48], power systems and network systems [49,50,51]. Hence, the SFM chaotic control system [52] and three controllers based on ZNNs are presented in this section.
The SFM [52] is introduced in detail as follows:
x ˙ 1 ( t ) = s x 2 ( t ) , x ˙ 2 ( t ) = 1 3 s x 1 ( t ) + 1 2 s x 2 ( t ) 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) , x ˙ 3 ( t ) = s x 2 ( t ) 0.6 s x 3 ( t ) + η s x 2 ( t ) s x 3 ( t ) ,
where X ( t ) = [ x 1 ( t ) , x 2 ( t ) , x 3 ( t ) ] T are state variables.
When considering uncertainties, noise and the controller, (37) is rewritten as
x ˙ 1 ( t ) = s x 2 ( t ) + Δ f 1 ( x ) + 1 ( t ) + u 1 ( t ) , x ˙ 2 ( t ) = 1 3 s x 1 ( t ) + 1 2 s x 2 ( t ) 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) + Δ f 2 ( x ) + 2 ( t ) + u 2 ( t ) , x ˙ 3 ( t ) = s x 2 ( t ) 0.6 s x 3 ( t ) + η s x 2 ( t ) s x 3 ( t ) + Δ f 3 ( x ) + 3 ( t ) + u 3 ( t ) ,
where Δ f 1 ( x ) , Δ f 2 ( x ) and Δ f 3 ( x ) are uncertainties of the system, 1 ( t ) , 2 ( t ) and 3 ( t ) refer to external disturbances, u 1 ( t ) , u 2 ( t ) and u 3 ( t ) represent the controllers.
Define error E ( t ) = X ( t ) 0 , where E ( t ) = [ e 1 ( t ) , e 2 ( t ) , e 3 ( t ) ] T .
According to design Formula (7), we have
E ˙ ( t ) = ξ E ( t ) .
Thus, combining (38) and (39), the controller based on OZNN (39) is
u 1 ( t ) = ξ x 1 ( t ) s x 2 ( t ) , u 2 ( t ) = ξ x 2 ( t ) + 1 3 s x 1 ( t ) 1 2 s x 2 ( t ) + 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) , u 3 ( t ) = ξ x 3 ( t ) + s x 2 ( t ) + 0.6 s x 3 ( t ) η s x 2 ( t ) s x 3 ( t ) .
Based on the (10), we get
E ˙ ( t ) = ξ E ( t ) λ 0 t E ( τ ) d τ .
Similarly, combining (38) and (41), we have the controller based on IEZNN (41) as follows:
u 1 ( t ) = ξ x 1 ( t ) λ 0 t x 1 ( τ ) d τ s x 2 ( t ) , u 2 ( t ) = ξ x 2 ( t ) λ 0 t x 2 ( τ ) d τ + 1 3 s x 1 ( t ) 1 2 s x 2 ( t ) + 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) , u 3 ( t ) = ξ x 3 ( t ) λ 0 t x 3 ( τ ) d τ + s x 2 ( t ) + 0.6 s x 3 ( t ) η s x 2 ( t ) s x 3 ( t ) .
Analogously, the design formula of the ADIZNN is
E ˙ ( t ) = 2 λ E ( t ) ξ Φ E ( t ) λ 2 0 t E ( τ ) d τ 2 λ ξ 0 t Φ E ( τ ) d τ λ 2 ξ 0 t 0 τ Φ E ( σ ) d σ d τ .
Thus, combining (38) and (43), the controller based on ADIZNN (43) is
u 1 ( t ) = 2 λ x 1 ( t ) ξ ϕ x 1 ( t ) λ 2 0 t x 1 ( τ ) d τ 2 λ ξ 0 t ϕ x 1 ( τ ) d τ λ 2 ξ 0 t 0 τ ϕ x 1 ( σ ) d σ d τ s x 2 ( t ) , u 2 ( t ) = 2 λ x 2 ( t ) ξ ϕ x 2 ( t ) λ 2 0 t x 2 ( τ ) d τ 2 λ ξ 0 t ϕ x 2 ( τ ) d τ λ 2 ξ 0 t 0 τ ϕ x 2 ( σ ) d σ d τ + 1 3 s x 1 ( t ) 1 2 s x 2 ( t ) + 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) , u 3 ( t ) = 2 λ x 3 ( t ) ξ ϕ x 3 ( t ) λ 2 0 t x 3 ( τ ) d τ 2 λ ξ 0 t ϕ x 3 ( τ ) d τ λ 2 ξ 0 t 0 τ ϕ x 3 ( σ ) d σ d τ + 1 3 s x 1 ( t ) + 1 2 s x 2 ( t ) 1 2 η 2 s x 2 ( t ) s 2 x 3 ( t ) .
Let Δ f ( x ) = [ s ( x 2 ( t ) ) , 2 c ( x 1 ( t ) ) , 3 s ( x 1 ( t ) ) c ( x 3 ( t ) ) ] T , ( t ) = [ t / 4 + 4 ] R 3 × 1 and set the η = 3 , ξ = 2 and λ = 1 , the ADIZNN model using the FTAF with ε 1 = ε 2 = ε 3 = ε 4 = 0.5 and μ = 0.5 , σ = 2 . Figure 6a presents space tracks of the original system (37) under no controller. Figure 6b–d indicate space tracks of system (38) under controller (40), controller (42) and controller (44) from initial values X ( 0 ) = [ 0.1 , 0.1 , 0.1 ] T . The end points of system (38) under controller (40), controller (42) and controller (44) are respectively [ 1266 , 1266 , 1266 ] T , [ 0.9748 , 0.9918 , 0.0518 ] T and [ 0.0033 , 0.0047 , 9.952 × 10 7 ] T . Figure 7a presents states of original system (37). It is obvious from the Figure 7b–d that the state (i.e., errors) of system (38) under controller (40) and controller (42) cannot reach zero in a three-dimensional space. At the same time, the state of and controller (44) can stable to zero. From the above data, it can be seen that the phase of the SFM system under controller (44) is fairly close to zero with a tiny error, and we hope that the end point of the phase of controller is the closest to zero, so as to achieve the smallest error as possible. The experimental results substantiate the effectiveness and feasibility of the controller (44). In other words, a double integral design scheme can also effectively suppress the existing linear noise and other additional interference items in the application of sine function memristor chaotic system control.

6. Conclusions

An innovative ZNN with a double integral was proposed, which can settle the DSE under linear noise. It is worth mentioning that the ADIZNN model has excellent convergence and robustness, which has been verified by theory. Additionally, two different dimensional experiments have revealed that the ADIZNN has more remarkable convergence and anti-noise ability than the OZNN and IEZNN under various linear noises. Finally, phases and states trajectories of the SFM chaotic system synthesized by several controllers have been given to indicate that the controller based on ADIZNN has the highest convergence rate in three-dimensional space.

Author Contributions

Conceptualization, L.H. and Y.H.; methodology, C.H. and B.L.; software, Y.H.; validation, L.H. and B.L.; formal analysis, C.H.; investigation, Y.H.; data curation, Y.H. and C.H.; writing—original draft preparation, L.H.; writing—review and editing, B.L. and L.H.; visualization, Y.H.; supervision, B.L. and Y.H.; project administration, B.L.; funding acquisition, B.L. and L.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the National Natural Science Foundation of China under Grants 62066015 and 61962023; the Natural Science Foundation of Hunan Province of China under grant 2020JJ4511; and the Research Foundation of Education Bureau of Hunan Province of China under Grant 20A396; and the Hunan Provincial Innovation Foundation For Postgraduate under grant CX20221105.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
DSEDynamic Sylvester equation
ZNNZeroing neural network
OZNNOriginal zeroing neural network
ADIZNNAccelerated double integral ZNN
SFMSine function memristor
RNNsrecurrent neural networks
GNNGradient neural network
IEZNNintegral enhanced ZNN model
FTAFfixed-time activation function

References

  1. Wei, Q.; Dobigeon, N.; Tourneret, J.Y.; Bioucas-Dias, J.; Godsill, S. R-FUSE: Robust fast fusion of multiband images based on solving a Sylvester equation. IEEE Signal Process. Lett. 2016, 23, 1632–1636. [Google Scholar] [CrossRef] [Green Version]
  2. Huo, L.; Yang, S.; Jiao, L.; Wang, S.; Shi, J. Local graph regularized coding for salient object detection. Infrared Phys. Technol. 2016, 77, 124–131. [Google Scholar] [CrossRef]
  3. Shaker, H.R.; Tahavori, M. Control configuration selection for bilinear systems via generalised Hankel interaction index array. Int. J. Control 2015, 88, 30–37. [Google Scholar] [CrossRef]
  4. Dolgov, S.; Pearson, J.W.; Savostyanov, D.V.; Stoll, M. Fast tensor product solvers for optimization problems with fractional differential equations as constraints. Appl. Math. Comput. 2016, 273, 604–623. [Google Scholar] [CrossRef]
  5. Jin, L.; Yan, J.; Du, X.; Xiao, X.; Fu, D. RNN for solving time-variant generalized Sylvester equation with applications to robots and acoustic source localization. IEEE Trans. Ind. Inform. 2020, 16, 6359–6369. [Google Scholar] [CrossRef]
  6. Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S.; Zhang, Y. Solving complex-valued time-varying linear matrix equations via QR decomposition with applications to robotic motion tracking and on angle-of-arrival localization. IEEE Trans. Neural Netw. Learn. Syst. 2021, 33, 3415–3424. [Google Scholar] [CrossRef] [PubMed]
  7. Li, W.; Han, L.; Xiao, X.; Liao, B.; Peng, C. A gradient-based neural network accelerated for vision-based control of an RCM-constrained surgical endoscope robot. Neural Comput. Appl. 2022, 34, 1329–1343. [Google Scholar] [CrossRef]
  8. Li, Z.; Liao, B.; Xu, F.; Guo, D. A new repetitive motion planning scheme with noise suppression capability for redundant robot manipulators. IEEE Trans. Syst. Man Cybern. Syst. 2018, 50, 5244–5254. [Google Scholar] [CrossRef]
  9. Liao, B.; Han, L.; Cao, X.; Li, S.; Li, J. Double integral-enhanced Zeroing neural network with linear noise rejection for time-varying matrix inverse. CAAI Trans. Intell. Technol. 2023, 1–14. [Google Scholar] [CrossRef]
  10. Yan, X.; Liu, M.; Jin, L.; Li, S.; Hu, B.; Zhang, X.; Huang, Z. New zeroing neural network models for solving nonstationary Sylvester equation with verifications on mobile manipulators. IEEE Trans. Ind. Inform. 2019, 15, 5011–5022. [Google Scholar] [CrossRef]
  11. Song, C.; Feng, J.; Wang, X.; Zhao, J. Finite iterative method for solving coupled Sylvester-transpose matrix equations. J. Appl. Math. Comput. 2014, 46, 351–372. [Google Scholar] [CrossRef]
  12. Ali Beik, F.P.; Movahed, F.S.; Ahmadi-Asl, S. On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations. Numer. Linear Algebra Appl. 2016, 23, 444–466. [Google Scholar] [CrossRef]
  13. Wu, H.C.; Chen, T.C.T.; Chiu, M.C. Constructing a precise fuzzy feedforward neural network using an independent fuzzification approach. Axioms 2021, 10, 282. [Google Scholar] [CrossRef]
  14. Tuyen, D.N.; Tuan, T.M.; Le, X.H.; Tung, N.T.; Chau, T.K.; Van Hai, P.; Gerogiannis, V.C.; Son, L.H. RainPredRNN: A new approach for precipitation nowcasting with weather radar echo images based on deep learning. Axioms 2022, 11, 107. [Google Scholar] [CrossRef]
  15. Su, L.; Zhou, L. Exponential synchronization of memristor-based recurrent neural networks with multi-proportional delays. Neural Comput. Appl. 2019, 31, 7907–7920. [Google Scholar] [CrossRef]
  16. Khan, A.H.; Li, S.; Luo, X. Obstacle avoidance and tracking control of redundant robotic manipulator: An RNN-based metaheuristic approach. IEEE Trans. Ind. Inform. 2019, 16, 4670–4680. [Google Scholar] [CrossRef] [Green Version]
  17. Jin, L.; Li, S.; Hu, B. RNN models for dynamic matrix inversion: A control-theoretical perspective. IEEE Trans. Ind. Inform. 2017, 14, 189–199. [Google Scholar] [CrossRef]
  18. He, X.; Liu, Q.; Yang, Y. MV-GNN: Multi-view graph neural network for compression artifacts reduction. IEEE Trans. Image Process. 2020, 29, 6829–6840. [Google Scholar] [CrossRef]
  19. Zhang, Y.; Jiang, D.; Wang, J. A recurrent neural network for solving Sylvester equation with time-varying coefficients. IEEE Trans. Neural Netw. 2002, 13, 1053–1063. [Google Scholar] [CrossRef]
  20. Zhang, Z.; Zheng, L.; Weng, J.; Mao, Y.; Lu, W.; Xiao, L. A new varying-parameter recurrent neural-network for online solution of time-varying Sylvester equation. IEEE Trans. Cybern. 2018, 48, 3135–3148. [Google Scholar] [CrossRef] [PubMed]
  21. Xiao, L.; Zhang, Z.; Zhang, Z.; Li, W.; Li, S. Design, verification and robotic application of a novel recurrent neural network for computing dynamic Sylvester equation. Neural Netw. 2018, 105, 185–196. [Google Scholar] [CrossRef]
  22. Qiu, B.; Zhang, Y.; Yang, Z. New discrete-time ZNN models for least-squares solution of dynamic linear equation system with time-varying rank-deficient coefficient. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 5767–5776. [Google Scholar] [CrossRef] [PubMed]
  23. He, Y.; Liao, B.; Xiao, L.; Han, L.; Xiao, X. Double accelerated convergence ZNN with noise-suppression for handling dynamic matrix inversion. Mathematics 2021, 10, 50. [Google Scholar] [CrossRef]
  24. Xiao, L.; He, Y.; Li, Y.; Dai, J. Design and analysis of two nonlinear ZNN models for matrix LR and QR factorization with application to 3D moving target location. IEEE Trans. Ind. Inform. 2022, 1–11. [Google Scholar] [CrossRef]
  25. Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S.; Zhang, Y. Continuous-time varying complex QR decomposition via zeroing neural dynamics. Neural Process Lett. 2021, 53, 3573–3590. [Google Scholar] [CrossRef]
  26. Xiao, L.; He, Y. A noise-suppression ZNN model with new variable parameter for dynamic Sylvester equation. IEEE Trans. Ind. Inform. 2021, 17, 7513–7522. [Google Scholar] [CrossRef]
  27. Tang, G.; Li, X.; Xu, Z.; Li, S.; Zhou, X. An integration-enhanced noise-resistant RNN model with superior performance illustrated via time-varying sylvester equation solving. In Proceedings of the IEEE 2020 Chinese Control And Decision Conference (CCDC), Hefei, China, 22–24 August 2020; pp. 1906–1911. [Google Scholar]
  28. Gong, J.; Jin, J. A faster and better robustness zeroing neural network for solving dynamic Sylvester equation. Neural Process Lett. 2021, 53, 3591–3606. [Google Scholar] [CrossRef]
  29. Han, L.; Liao, B.; He, Y.; Xiao, X. Dual noise-suppressed ZNN with predefined-time convergence and its application in matrix inversion. In Proceedings of the IEEE 2021 11th International Conference on Intelligent Control and Information Processing (ICICIP), Denver, CO, USA, 28–30 September 2021; pp. 410–415. [Google Scholar]
  30. Xiao, L.; He, Y.; Dai, J.; Liu, X.; Liao, B.; Tan, H. A variable-parameter noise-tolerant zeroing neural network for time-variant matrix inversion with guaranteed robustness. IEEE Trans. Neural Netw. Learn. Syst. 2020, 33, 1535–1545. [Google Scholar] [CrossRef]
  31. Guo, D.; Li, S.; Stanimirović, P.S. Analysis and application of modified ZNN design with robustness against harmonic noise. IEEE Trans. Ind. Inform. 2019, 16, 4627–4638. [Google Scholar] [CrossRef]
  32. Jin, L.; Zhang, Y.; Li, S. Integration-enhanced Zhang neural network for real-time-varying matrix inversion in the presence of various kinds of noises. IEEE Trans. Neural Netw. Learn. Syst. 2015, 27, 2615–2627. [Google Scholar] [CrossRef]
  33. Dzieciol, H.; Sillekens, E.; Lavery, D. Extending phase noise tolerance in UDWDM access networks. In Proceedings of the 2020 IEEE Photonics Society Summer Topicals Meeting Series (SUM), Virtual, 13–15 July 2020; pp. 1–2. [Google Scholar]
  34. Xiang, Q.; Liao, B.; Xiao, L.; Jin, L. A noise-tolerant Z-type neural network for time-dependent pseudoinverse matrices. Optik 2018, 165, 16–28. [Google Scholar] [CrossRef]
  35. Johnson, M.A.; Moradi, M.H. PID Control; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
  36. Liao, B.; Han, L.; He, Y.; Cao, X.; Li, J. Prescribed-time convergent adaptive ZNN for time-varying matrix inversion under harmonic noise. Electronics 2022, 11, 1636. [Google Scholar] [CrossRef]
  37. Jin, J.; Qiu, L. A robust fast convergence zeroing neural network and its applications to dynamic Sylvester equation solving and robot trajectory tracking. J. Frankl. Inst. 2022, 359, 3183–3209. [Google Scholar] [CrossRef]
  38. Zhang, Y.; Yi, C.; Guo, D.; Zheng, J. Comparison on Zhang neural dynamics and gradient-based neural dynamics for online solution of nonlinear time-varying equation. Neural Comput. Appl. 2011, 20, 1–7. [Google Scholar] [CrossRef]
  39. Zhang, Y.; Jin, L.; Ke, Z. Superior performance of using hyperbolic sine activation functions in ZNN illustrated via time-varying matrix square roots finding. Comput. Sci. Inf. Syst. 2012, 9, 1603–1625. [Google Scholar] [CrossRef]
  40. Yang, Y.; Zhang, Y. Superior robustness of power-sum activation functions in Zhang neural networks for time-varying quadratic programs perturbed with large implementation errors. Neural Comput. Appl. 2013, 22, 175–185. [Google Scholar] [CrossRef]
  41. Zhang, Y.; Ding, Y.; Qiu, B.; Zhang, Y.; Li, X. Signum-function array activated ZNN with easier circuit implementation and finite-time convergence for linear systems solving. Inf. Process. Lett. 2017, 124, 30–34. [Google Scholar] [CrossRef]
  42. Benner, P. Factorized solution of Sylvester equations with applications in control. Sign (H) 2004, 1, 2. [Google Scholar]
  43. Castelan, E.B.; da Silva, V.G. On the solution of a Sylvester equation appearing in descriptor systems control theory. Syst. Control Lett. 2005, 54, 109–117. [Google Scholar] [CrossRef]
  44. Wei, Q.; Dobigeon, N.; Tourneret, J.Y. Fast fusion of multi-band images based on solving a Sylvester equation. IEEE Trans. Image Process. 2015, 24, 4109–4121. [Google Scholar] [CrossRef] [Green Version]
  45. Diao, H.; Shi, X.; Wei, Y. Effective condition numbers and small sample statistical condition estimation for the generalized Sylvester equation. Sci. China Math. 2013, 56, 967–982. [Google Scholar] [CrossRef]
  46. Zhang, R.; Xi, X.; Tian, H.; Wang, Z. Dynamical analysis and finite-time synchronization for a chaotic system with hidden attractor and surface equilibrium. Axioms 2022, 11, 579. [Google Scholar] [CrossRef]
  47. Rasouli, M.; Zare, A.; Hallaji, M.; Alizadehsani, R. The synchronization of a class of time-delayed chaotic systems using sliding mode control based on a fractional-order nonlinear PID sliding surface and its application in secure communication. Axioms 2022, 11, 738. [Google Scholar] [CrossRef]
  48. He, W.; Luo, T.; Tang, Y.; Du, W.; Tian, Y.C.; Qian, F. Secure communication based on quantized synchronization of chaotic neural networks under an event-triggered strategy. IEEE Trans. Neural Netw. Learn. Syst. 2019, 31, 3334–3345. [Google Scholar] [CrossRef] [PubMed]
  49. Xiao, L.; He, Y.; Liao, B. A parameter-changing zeroing neural network for solving linear equations with superior fixed-time convergence. Expert Syst. Appl. 2022, 208, 118086. [Google Scholar] [CrossRef]
  50. Su, H.; Luo, R.; Huang, M.; Fu, J. Robust fixed time control of a class of chaotic systems with bounded uncertainties and disturbances. Int. J. Control Autom. Syst. 2022, 20, 813–822. [Google Scholar] [CrossRef]
  51. Singer, J.; Wang, Y.; Bau, H.H. Controlling a chaotic system. Phys. Rev. Lett. 1991, 66, 1123. [Google Scholar] [CrossRef]
  52. Sun, J.; Zhao, X.; Fang, J.; Wang, Y. Autonomous memristor chaotic systems of infinite chaotic attractors and circuitry realization. Nonlinear Dyn. 2018, 94, 2879–2887. [Google Scholar] [CrossRef]
Figure 1. State trajectories of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) in the absence of the noise. (a) State trajectory of p 11 ( t ) . (b) State trajectory of p 12 ( t ) . (c) State trajectory of p 21 ( t ) . (d) State trajectory of p 22 ( t ) .
Figure 1. State trajectories of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) in the absence of the noise. (a) State trajectory of p 11 ( t ) . (b) State trajectory of p 12 ( t ) . (c) State trajectory of p 21 ( t ) . (d) State trajectory of p 22 ( t ) .
Axioms 12 00287 g001
Figure 2. State trajectories of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) under the linear noise z i ( t ) = t / 4 + 4 . (a) State trajectory of p 11 ( t ) . (b) State trajectory of p 12 ( t ) . (c) State trajectory of p 21 ( t ) . (d) State trajectory of p 22 ( t ) .
Figure 2. State trajectories of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) under the linear noise z i ( t ) = t / 4 + 4 . (a) State trajectory of p 11 ( t ) . (b) State trajectory of p 12 ( t ) . (c) State trajectory of p 21 ( t ) . (d) State trajectory of p 22 ( t ) .
Axioms 12 00287 g002
Figure 3. Error norms W ( t ) F of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) in different noise environments. (a) No noise z i ( t ) = 0 . (b) Linear noise z i ( t ) = t / 4 + 4 . (c) Linear noise z i ( t ) = 4 t + 4 . (d) Linear noise z i ( t ) = 16 t + 4 .
Figure 3. Error norms W ( t ) F of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (35) in different noise environments. (a) No noise z i ( t ) = 0 . (b) Linear noise z i ( t ) = t / 4 + 4 . (c) Linear noise z i ( t ) = 4 t + 4 . (d) Linear noise z i ( t ) = 16 t + 4 .
Axioms 12 00287 g003
Figure 4. Error norms W ( t ) F of ADIZNN (19) with different parameters for the DSE with (35) in linear noise z i ( t ) = 16 t + 4 . (a) Fixed λ = 1 , different ξ . (b) Fixed ξ = 1 , different λ .
Figure 4. Error norms W ( t ) F of ADIZNN (19) with different parameters for the DSE with (35) in linear noise z i ( t ) = 16 t + 4 . (a) Fixed λ = 1 , different ξ . (b) Fixed ξ = 1 , different λ .
Axioms 12 00287 g004
Figure 5. Error norms W ( t ) F of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (36) in different noise environments. (a) z i ( t ) = 0 . (b) z i ( t ) = t / 4 + 4 . (c) z i ( t ) = 4 t + 4 . (d) z i ( t ) = 16 t + 4 .
Figure 5. Error norms W ( t ) F of OZNN (9), IEZNN (12) and ADIZNN (19) for the DSE with (36) in different noise environments. (a) z i ( t ) = 0 . (b) z i ( t ) = t / 4 + 4 . (c) z i ( t ) = 4 t + 4 . (d) z i ( t ) = 16 t + 4 .
Axioms 12 00287 g005aAxioms 12 00287 g005b
Figure 6. Phases of the original SFM system and the SFM under controller (40), controller (42) and controller (44) from X ( 0 ) = [ 0.1 , 0.1 , 0.1 ] T . (a) Original SFM system; (b) By controller (40); (c) By controller (42); (d) By controller (44).
Figure 6. Phases of the original SFM system and the SFM under controller (40), controller (42) and controller (44) from X ( 0 ) = [ 0.1 , 0.1 , 0.1 ] T . (a) Original SFM system; (b) By controller (40); (c) By controller (42); (d) By controller (44).
Axioms 12 00287 g006
Figure 7. State trajectories of the original SFM system and the SFM under controller (40), controller (42) and controller (44) from X ( 0 ) = [ 0.1 , 0.1 , 0.1 ] T . (a) Original SFM system; (b) By controller (40); (c) By controller (42); (d) By controller (44).
Figure 7. State trajectories of the original SFM system and the SFM under controller (40), controller (42) and controller (44) from X ( 0 ) = [ 0.1 , 0.1 , 0.1 ] T . (a) Original SFM system; (b) By controller (40); (c) By controller (42); (d) By controller (44).
Axioms 12 00287 g007
Table 1. The detailed comparison of OZNN (9), IEZNN (12) and ADIZNN (19) with ξ = 2 and λ = 1 for the DSE with (35) under the different noise environments.
Table 1. The detailed comparison of OZNN (9), IEZNN (12) and ADIZNN (19) with ξ = 2 and λ = 1 for the DSE with (35) under the different noise environments.
NoiseOZNN Model (9)IEZNN Model (12)ADIZNN Model (19)
z i ( t ) = 0 convergentconvergentconvergent
z i ( t ) = t / 4 + 4 divergingdivergingconvergent
z i ( t ) = 4 t + 4 divergingdivergingconvergent
z i ( t ) = 16 t + 4 divergingdivergingconvergent
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Han, L.; He, Y.; Liao, B.; Hua, C. An Accelerated Double-Integral ZNN with Resisting Linear Noise for Dynamic Sylvester Equation Solving and Its Application to the Control of the SFM Chaotic System. Axioms 2023, 12, 287. https://doi.org/10.3390/axioms12030287

AMA Style

Han L, He Y, Liao B, Hua C. An Accelerated Double-Integral ZNN with Resisting Linear Noise for Dynamic Sylvester Equation Solving and Its Application to the Control of the SFM Chaotic System. Axioms. 2023; 12(3):287. https://doi.org/10.3390/axioms12030287

Chicago/Turabian Style

Han, Luyang, Yongjun He, Bolin Liao, and Cheng Hua. 2023. "An Accelerated Double-Integral ZNN with Resisting Linear Noise for Dynamic Sylvester Equation Solving and Its Application to the Control of the SFM Chaotic System" Axioms 12, no. 3: 287. https://doi.org/10.3390/axioms12030287

APA Style

Han, L., He, Y., Liao, B., & Hua, C. (2023). An Accelerated Double-Integral ZNN with Resisting Linear Noise for Dynamic Sylvester Equation Solving and Its Application to the Control of the SFM Chaotic System. Axioms, 12(3), 287. https://doi.org/10.3390/axioms12030287

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop