Next Article in Journal
Tachism: Tri-Port Antenna with Triple Notching Characteristic and High Isolation System for MIMO Application
Previous Article in Journal
Optimal Parameters Selection in Advanced Multi-Metallic Co-Extrusion Based on Independent MCDM Analytical Approaches and Numerical Simulation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Towards Higher-Order Zeroing Neural Network Dynamics for Solving Time-Varying Algebraic Riccati Equations

1
Department of Industrial Engineering, College of Engineering, University of Háil, Hail 1234, Saudi Arabia
2
Department of Computer Engineering, College of Computer Science and Engineering, University of Háil, Hail 1234, Saudi Arabia
3
Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah 21589, Saudi Arabia
4
Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdul Aziz University, Jeddah 21589, Saudi Arabia
5
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
6
Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia
7
Data Recovery Key Laboratory of Sichun Province, Neijing Normal University, Neijiang 641100, China
8
Section of Mathematics, Department of Civil Engineering, Democritus University of Thrace, 67100 Xanthi, Greece
9
Department of Economics, Mathematics-Informatics and Statistics-Econometrics, National and Kapodistrian University of Athens, Sofokleous 1 Street, 10559 Athens, Greece
10
Laboratory “Hybrid Methods of Modelling and Optimization in Complex Systems”, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(23), 4490; https://doi.org/10.3390/math10234490
Submission received: 28 October 2022 / Revised: 14 November 2022 / Accepted: 24 November 2022 / Published: 28 November 2022
(This article belongs to the Section Engineering Mathematics)

Abstract

:
One of the most often used approaches for approximating various matrix equation problems is the hyperpower family of iterative methods with arbitrary convergence order, whereas the zeroing neural network (ZNN) is a type of neural dynamics intended for handling time-varying problems. A family of ZNN models that correlate with the hyperpower iterative methods is defined on the basis of the analogy that was discovered. These models, known as higher-order ZNN models (HOZNN), can be used to find real symmetric solutions of time-varying algebraic Riccati equations. Furthermore, a noise-handling HOZNN (NHOZNN) class of dynamical systems is introduced. The traditional ZNN and HOZNN dynamic flows are compared theoretically and numerically.

1. Introduction and Preliminaries

Since Kalman demonstrated the widespread use of algebraic Riccati equations (ARE) in filtering theory and optimal control [1], ARE have drawn significant attention in science, applied mathematics, and a variety of engineering problems, including controlling doubly-fed wind generators [2], wheeled inverted pendulums [3], and linear multi-agent systems [4]. Particularly, the continuous-time algebraic Riccati equation (CARE) [5,6,7,8,9,10],
A T V + V A V B V + Q = 0 ,
is a quadratic matrix equation that is essential to Kalman filtering [5], linear–quadratic regulator, linear–quadratic–Gaussian and H 2 / H control [6,7,8], and co-prime or spectral factorizations [9,10]. Note that the superscript ( ) T signifies transposition, 0 R n × n signifies the n × n zero matrix and all the coefficient matrices in (1) belong to R n × n , whereas B and Q are symmetric and non-negative definite matrices (i.e., B = B T 0 and Q = Q T 0 ). The solution set for the CARE can either have an infinite or finite number of symmetric or non-symmetric solutions V R n × n with indefinite or definite signs. In this study, the following time-varying ARE (TV-ARE) [11,12] is addressed using the zeroing neural network (ZNN):
A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) = 0 ,
where t signifies the time, all the time-varying coefficient matrices belong to R n × n , and the matrices B ( t ) , Q ( t ) are symmetric and non-negative definite. More specifically, this study proposes and examines two models: a higher-order ZNN (HOZNN) model that produces numerical TV-ARE real symmetric solutions, and a noise-handling HOZNN (NHOZNN) model that produces numerical TV-ARE real symmetric solutions when noise is present. It is important to mention that the TV-ARE (2) is based on the frozen-time (or forward-in-time) ARE [13,14] and has widely been used in the field of optimal control to stabilize linear time-varying systems with excellent performance; applications include controlling a Quanser 3 DOF Hover system [14], a spring-constrained mass with time-dependent stiffness [11], an elastic beam [13], and various numerical control cases [12,15]. Additionally, linear time-varying systems may be stabilized more effectively the faster the ZNN model for solving the TV-ARE converges, which improves the ZNN-based controller’s performance [11,12]. The novel NZNN and NHOZNN designs for solving the TV-ARE are particularly valuable for future research because ZNN models have not yet been employed in linear time-varying systems with noise. Therefore, it is crucial to conduct more research on ZNN models for addressing the TV-ARE (2).
The ZNN approach, created by Zhang et al. in [16], is based on the Hopfield neural network and is utilized to generate online solutions to time-varying problems. It is important to note that the great majority of ZNN dynamical systems fall within the class of recurrent neural networks, which are employed for finding equation zeros. The ZNN approach has been extensively studied and has been applied to a wide range of time-varying problems, with the principal applications being problems of matrix equation systems [17,18], tensor and matrix inversion [19], quadratic optimization [20], linear equations systems [18,19], generalized inversion [21], and approximation of many matrix functions [22,23,24]. Defining an error matrix equation (EME), Z ( t ) R n × n , for the underlying problem is the initial step in producing ZNN dynamics. The next step takes advantage of the dynamical evolution [16]:
E ˙ ( t ) = d E ( t ) d t = λ F E ( t ) ,
where λ > 0 is a design parameter that is utilized to scale the convergence, ( ˙ ) signifies the time derivative, whereas F ( · ) : R n × n R n × n denotes element-wise utilization of an odd and increasing activation function (AF) on E ( t ) .
The family of hyperpower iterations has undergone substantial study and modification in recent years [25,26,27,28,29]. However, because iterative methods are implementable to discrete-time models and since these methods typically need initial conditions that are estimated and occasionally may not be easily satisfied, numerous continuous-time HOZNN models were introduced and examined in [22,30,31]. Starting from the following hyperpower iterations with order p 2 [29,30]:
V k + 1 = V k i = 0 p 1 E k i ,
where E k R n × n signifies an appropriate time-invariant EME, the time-invariant (4) can be extended to a time-varying case. That is, considering the EME below:
E H p ( t ) = i = 1 p 1 E i ( t ) ,
where p 2 and E i ( t ) R n × n , the general HOZNN dynamical evolution can be obtained by combining the ZNN design and the hyperpower iterations method [22,30,31]:
E ˙ ( t ) E ˙ H p ( t ) = d E H p ( t ) d t = λ F E H p ( t ) ,
for finding the online solution to a time-varying problem. In this study, we investigate the HOZNN evolution (6) under the linear AF, which results in the following:
E ˙ ( t ) λ E H p ( t ) .
A modified noise-handling model for addressing time-varying problems was introduced and studied in [32] due to the fact that every type of noise has a great effect on the proposed ZNN methods’ accuracy and that any preprocessing for a noise reduction adds time, jeopardizing desired real-time requirements. Particularly, the following noise-handling ZNN (NZNN) dynamical system was defined [32]:
E ˙ ( t ) = λ E ( t ) ζ 0 t E ( τ ) d τ + N ( t ) ,
where λ and ζ are design parameters which monitor the convergence of NZNN and N ( t ) signifies the matrix-form noises of appropriate dimensions. Note that the generalization of the NZNN design to the NHOZNN form for approximating a time-varying problem was introduced and investigated in [31]. With the same principle as the HOZNN design in (5)–(7), the general NHOZNN dynamical evolution can be obtained by combining the NZNN design and the hyperpower iterations method:
E ˙ ( t ) λ E H p ( t ) ζ 0 t E H p ( τ ) d τ + N ( t ) .
The following are the main points of this research:
  • A new HOZNN model that produces numerical TV-ARE real symmetric solutions.
  • A novel NHOZNN model that produces numerical TV-ARE real symmetric solutions when noise is present.
  • All models are effective for solving the TV-ARE, according to two numerical experiments that include three different types of noise. Both the HOZNN and NHOZNN models converge to the TV-ARE solution faster than the corresponding ZNN and NZNN models.
Few of the paper’s basic symbols are also worth noting: 1 and I signify the all-ones and identity matrices with dimensions n × n , respectively; 0 ˜ signifies the zero matrix with dimensions n 2 × ( n 2 + n ) / 2 ; I ˜ signifies the identity matrix with dimensions n 2 × n 2 ; ⊗ denotes the Kronecker product; vec ( · ) denotes the vectorization procedure; · F denotes the matrix Frobenius norm.
The following is the structure of the paper: The HOZNN model that produces numerical TV-ARE solutions is defined and analyzed in Section 2, while the NHOZNN model that produces numerical TV-ARE solutions when noise is present is described and analyzed in Section 3. The results of two experiments for addressing the TV-ARE under three different types of noise are shown and analyzed in Section 4. Last, Section 5 includes the last comments and inferences.

2. Higher-Order ZNN for Solving the TV-ARE

This section introduces and analyzes the HOZNN model that solves the TV-ARE (2). Based on the following EME of ZNN design from [11]:
E ( t ) = A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) ,
where V ( t ) is the unknown solution of the TV-ARE, while its derivative is
E ˙ ( t ) = A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) .
the following EME is defined in the case of the HOZNN design:
E H p ( t ) = i = 1 p 1 A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) i ,
while its derivative is:
E ˙ H p ( t ) = i = 1 p 1 j = 0 i 1 A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) j ( t ) A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) i 1 j ,
the replacement A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) = 0 in (13) transforms each of the summations into zero matrices, except the summand corresponding to i = 1 , j = 0 . Hence, (13) is approximated as:
E ˙ H p ( t ) A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) = E ˙ ( t ) ,
where E ˙ ( t ) is the first derivative of E ( t ) defined in (11). This leads to the following dynamical system:
E ˙ ( t ) = λ i = 1 p 1 E i ( t ) .
Theorem 1. 
Assume that A ( t ) , B ( t ) , Q ( t ) R n × n are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices. The dynamical system (15) converges to the theoretical solution V * ( t ) of TV-ARE (2), for each integer p 2 . Based on Lyapunov, the solution is stable.
Proof. 
The substitution V ˜ ( t ) : = V * ( t ) V ( t ) implies V ( t ) = V * ( t ) V ˜ ( t ) , where V * ( t ) is a theoretical solution. The time derivative of V ( t ) is V ˙ ( t ) = V ˙ * ( t ) V ˜ ˙ ( t ) . Notice that
A T ( t ) V * ( t ) + V * ( t ) A ( t ) V * ( t ) B ( t ) V * ( t ) + Q ( t ) = 0 ,
and its first derivative
A ˙ T ( t ) V * ( t ) + A T ( t ) V ˙ * ( t ) + V ˙ * ( t ) A ( t ) + V * ( t ) A ˙ ( t ) V ˙ * ( t ) B ( t ) V * ( t ) V * ( t ) B ˙ ( t ) V * ( t ) V * ( t ) B ( t ) V ˙ * ( t ) + Q ˙ ( t ) = 0 .
As a result, after substituting V ( t ) = V * ( t ) V ˜ ( t ) into (12), one can verify
E ˜ H p ( t ) = E H p ( V ˜ ( t ) , t ) = i = 1 p 1 A T ( t ) V ˜ ( t ) + V ˜ ( t ) A ( t ) V * ( t ) B ( t ) V ˜ ( t ) V ˜ ( t ) B ( t ) V * ( t ) V ˜ ( t ) B ( t ) V ˜ ( t ) i ,
Further, the implicit dynamics (15) imply
E ˜ ˙ H p ( t ) = E ˙ H p ( V ˜ ( t ) , t ) = A ˙ T ( t ) V ˜ ( t ) + A T ( t ) V ˜ ˙ ( t ) + V ˜ ˙ ( t ) A ( t ) + V ˜ ( t ) A ˙ ( t ) V ˜ ˙ ( t ) B ( t ) V ˜ ( t ) V ˜ ˙ ( t ) B ( t ) V * ( t ) V ˙ * ( t ) B ( t ) V ˜ ( t ) V ˜ ( t ) B ˙ ( t ) V ˜ ( t ) V ˜ ( t ) B ˙ ( t ) V * ( t ) V * ( t ) B ˙ ( t ) V ˜ ( t ) V ˜ ( t ) B ( t ) V ˜ ˙ ( t ) V ˜ ( t ) B ( t ) V ˙ * ( t ) V * ( t ) B ( t ) V ˜ ˙ ( t ) = λ E H p ( V ˜ ( t ) , t ) .
To confirm convergence, the candidate Lyapunov function is determined as follows:
L ( t ) = 1 2 E ˜ H p ( t ) F 2 = 1 2 Tr E ˜ H p ( t ) E ˜ H p ( t ) T .
Then, the next identities can be verified:
L ˙ ( t ) = 2 Tr E ˜ H p ( t ) T E ˜ ˙ H p ( t ) 2 = Tr E ˜ H p ( t ) T E ˜ ˙ H p ( t ) = λ Tr E ˜ H p ( t ) T E ˜ H p ( t ) .
Consequently, it holds
d L ( V ˜ ( t ) , t ) d t < 0 , E H p ( V ˜ ( t ) , t ) 0 = 0 , E H p ( V ˜ ( t ) , t ) = 0 , L ˙ ( t ) < 0 , A T ( t ) V ˜ ( t ) + V ˜ ( t ) A ( t ) V * ( t ) B ( t ) V ˜ ( t ) V ˜ ( t ) B ( t ) V * ( t ) V ˜ ( t ) B ( t ) V ˜ ( t ) 0 = 0 , A T ( t ) V ˜ ( t ) + V ˜ ( t ) A ( t ) V * ( t ) B ( t ) V ˜ ( t ) V ˜ ( t ) B ( t ) V * ( t ) V ˜ ( t ) B ( t ) V ˜ ( t ) = 0 , L ˙ ( t ) < 0 , V ˜ ( t ) 0 = 0 , V ˜ ( t ) = 0 .
Since V ˜ ( t ) is the equilibrium point of the system (19) and E H p ( 0 ) = 0 , we have that:
d L ( V ˜ ( t ) , t ) d t 0 , V ˜ ( t ) 0 .
The equilibrium state V ˜ ( t ) = V * ( t ) V ( t ) = 0 is stable as a result of the Lyapunov stability theory. Consequently, V ( t ) V * ( t ) as t . □
Therefore, in view of (15), it follows the expanded HOZNN design for addressing the TV-ARE problem:
A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) = λ E H p ( t ) ,
or equivalently
A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) = λ E H p ( t ) A ˙ T ( t ) V ( t ) V ( t ) A ˙ ( t ) + V ( t ) B ˙ ( t ) V ( t ) Q ˙ ( t ) .
In order to solve (25) through the HOZNN approach, V ˙ ( t ) cannot be contained in the mass matrix of (25). As a result, we set s ( t ) the vectorized right part of (25), i.e.,
s ( t ) = vec λ E H p ( t ) A ˙ T ( t ) V ( t ) V ( t ) A ˙ ( t ) + V ( t ) B ˙ ( t ) V ( t ) Q ˙ ( t )
and vectorize the left part of (25), i.e.,
vec A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) = I A T ( t ) + A ( t ) T I I V ( t ) B ( t ) B ( t ) V ( t ) T I vec V ˙ ( t ) .
As the goal of this research is to explicitly discover real symmetric solutions, we only have to locate the components of V ( t ) positioned on and above its main diagonal. Therefore, it is significant to use x ˙ ( t ) in place of V ˙ ( t ) by positioning the aforementioned components of V ( t ) into the vector x ( t ) . In this approach, the dimension of (27) is reduced, while V ( t ) is compelled to be a symmetric matrix.
Therefore, the next equation that substitutes vec ( V ˙ ( t ) ) in (27) can be derived by employing the r = ( n 2 + n ) / 2 components on and above the main diagonal of V ( t ) :
vec ( V ˙ ( t ) ) = Z x ˙ ( t ) ,
where the matrix Z R n 2 × r is an operational matrix, which may be constructed by utilizing Algorithm 1. Note that the definitions of the notations zeros ( · ) , mod ( · ) , and floor ( · ) in Algorithm 1 match those of the respective MATLAB functions [33]. Furthermore, the components on and above the main diagonal of V ˙ ( t ) are stacked to form the column vector x ˙ ( t ) R r .
Algorithm 1 Calculation method for the operational matrix Z.
Require: 
The columns or rows number n of a real symmetric matrix.
1:
Put r = ( n 2 + n ) / 2 and Z = zeros ( n 2 , r )
2:
for q = 1 : n 2 do
3:
       Put d = mod ( q 1 , n ) + 1 and h = floor ( q 1 n ) + 1
4:
       if h d then
5:
             Put Z q , d + h h 1 2 = 1
6:
       else
7:
             Put Z q , h + d d 1 2 = 1
8:
       end if
9:
end for
10:
returnZ
Ensure: 
The matrix Z.
Additionally, by setting
Y ( t ) = A ( t ) T I + I A T ( t ) B ( t ) V ( t ) T I I V ( t ) B ( t ) Z ,
then, (26), (28), (29) combined with (25) provide the next implicit dynamics:
Y ( t ) x ˙ ( t ) = s ( t ) .
The next unified HOZNN model is obtained by multiplying both sides by Y T ( t ) :
Y T ( t ) Y ( t ) x ˙ ( t ) = Y T ( t ) s ( t ) .
Therefore, (31) is the recommended HOZNN model that may effectively be addressed by utilizing an ode MATLAB solver. It is worth noting that the product Y T ( t ) Y ( t ) R r × r is a state-dependent mass matrix.According to Theorem 2, the HOZNN model (31) converges to the theoretical solution. It is important to mention that the HOZNN model (31) for p = 2 becomes the ZNN model in [11].
Theorem 2. 
Assume that A ( t ) , B ( t ) , Q ( t ) R n × n are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices. At each time t [ 0 , t f ) [ 0 , + ) , if the product Y T ( t ) Y ( t ) R r × r with r = ( n 2 + n ) / 2 in (31) is non-singular then the HOZNN model (31) converges to the symmetric theoretical solution of TV-ARE (2) exponentially, beginning from any primary price x ( 0 ) , for each integer p 2 .
Proof. 
The proof is omitted since it is similar to the proof in [11] (Theorem 3.1) after replacing [34] (Theorem 1) with Theorem 1. □

3. Noise-Tolerant HOZNN for Solving the TV-ARE

This section introduces and analyzes the NHOZNN model that solves the TV-ARE (2) when noise is present. Consider the EMEs E ( t ) in (10) and E H p ( t ) in (12), as well as their derivatives E ˙ ( t ) in (11) and E ˙ H p ( t ) in (13). Replacing E H p ( t ) and E ˙ H p ( t ) into the NZNN design (8), we have
E ˙ H p ( t ) = λ E H p ( t ) ζ 0 t E H p ( τ ) d τ + N ( t ) ,
or equivalent
i = 1 p 1 j = 0 i 1 A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) j ( t ) A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) i 1 j = λ i = 1 p 1 A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) i ζ 0 t i = 1 p 1 A T ( τ ) V ( τ ) + V ( τ ) A ( t ) V ( τ ) B ( t ) V ( τ ) + Q ( t ) i d τ + N ( t ) .
The replacement A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) = 0 on the left-hand side of (33) transforms each of the summations there into zero matrices, except the summand corresponding to j = 0 , i = 1 . As a result, we ended up with the following approximated higher-order design:
A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) = λ i = 1 p 1 A T ( t ) V ( t ) + V ( t ) A ( t ) V ( t ) B ( t ) V ( t ) + Q ( t ) i ζ 0 t i = 1 p 1 A T ( τ ) V ( τ ) + V ( τ ) A ( t ) V ( τ ) B ( t ) V ( τ ) + Q ( t ) i d τ + N ( t ) ,
or equivalent
E ˙ ( t ) = λ E H p ( t ) ζ 0 t E H p ( τ ) d τ + N ( t ) .
The performance of NHOZNN dynamics (35) is investigated in the following theorems aimed to solve various types of noise, and restated from [31].
Theorem 3 
([31]). Assume that A ( t ) , B ( t ) , Q ( t ) R n × n are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices. Then the NHOZNN dynamics (35) globally converge to the theoretical solution, despite the constant noise N ( t ) = N R n × n .
Theorem 4 
([31]). Under the suppositions of Theorem 3, the NHOZNN dynamics (35) polluted with the linear noise N ( t ) = N t R n × n is convergent towards the theoretical solution, with the upper bound of the EME fulfilling lim t E ( t ) F = N F ζ . In addition, E ( t ) satisfies lim t E H p ( t ) F 0 , as ζ + .
Theorem 5 
([31]). Under the suppositions of Theorem 3, the NHOZNN dynamics (35) when there is bounded random noise N ( t ) : = σ ( t ) = [ σ i j ( t ) ] i , j = 1 , , n R n × n , retain bounded residual error E H p ( t ) F . In addition, lim t E H p ( t ) F of NHOZNN is bounded by
2 n sup 0 τ t | σ i j ( τ ) | / R 1 / 2 , R > 0 4 ζ n sup 0 τ t | σ i j ( τ ) / ( R ) 1 / 2 , R < 0
where R = γ 2 4 ζ with parameters γ , ζ > 0 . Consequently, the upper bound of lim t E H p ( t ) F is in roughly inverse proportion to γ, and lim t E H p ( t ) F becomes arbitrarily low for sufficiently big γ and appropriate ζ in the instance of R 0 .
Consequently, in view of (35), it follows the expanded NHOZNN design for addressing the TV-ARE problem, when noise is present:
A ˙ T ( t ) V ( t ) + A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) + V ( t ) A ˙ ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ˙ ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) + Q ˙ ( t ) = λ E H p ( t ) ζ 0 t E H p ( τ ) d τ + N ( t ) ,
or equivalently
A T ( t ) V ˙ ( t ) + V ˙ ( t ) A ( t ) V ˙ ( t ) B ( t ) V ( t ) V ( t ) B ( t ) V ˙ ( t ) = λ E H p ( t ) A ˙ T ( t ) V ( t ) V ( t ) A ˙ ( t ) + V ( t ) B ˙ ( t ) V ( t ) Q ˙ ( t ) ζ 0 t E H p ( τ ) d τ + N ( t ) .
In order to solve (37) through the HOZNN approach, V ˙ ( t ) cannot be contained in the mass matrix of (37). Also note that the intention of this research is to explicitly discover real symmetric solutions V ( t ) . As a consequence, we use x ˙ ( t ) instead of V ˙ ( t ) as defined in (28). Furthermore, since the left part of (37) is identical to the left part of (25), we use the vectorized left part Y ( t ) as defined in (29) and vectorize the right part of (37), that is
k ( t ) = vec λ E H p ( t ) A ˙ T ( t ) V ( t ) V ( t ) A ˙ ( t ) + V ( t ) B ˙ ( t ) V ( t ) Q ˙ ( t ) ζ K ( t ) + N ( t ) ,
where
K ( t ) = 0 t E H p ( τ ) d τ .
Then, (38), (39), (28), (29)
Y ( t ) x ˙ ( t ) = k ( t ) .
The fact that E ( t ) is symmetric (see [5]) implies that E H p ( t ) and K ( t ) are symmetric matrices as well.Therefore, it is significant to apply r ˙ ( t ) in place of K ˙ ( t ) by separating the K ( t ) components that are positioned on and above its main diagonal into the vector r ( t ) . We may therefore set the following:
vec ( K ˙ ( t ) ) = Z r ˙ ( t ) .
Furthermore, to simplify the process of finding the matrix r ( t ) , we set
d ( t ) = r ( t ) x ( t ) , d ˙ ( t ) = r ˙ ( t ) x ˙ ( t ) and W ( t ) = I ˜ Z 0 ˜ 0 ˜ Y ( t ) .
As a result, we have the following dynamics instead of (40):
W ( t ) d ˙ ( t ) = vec ( E H p ( t ) ) k ( t ) .
The next unified NHOZNN model is obtained by multiplying both sides by W T ( t ) :
W T ( t ) W ( t ) d ˙ ( t ) = W T ( t ) vec ( E H p ( t ) ) k ( t ) .
Therefore, (44) is the recommended NHOZNN model that may effectively be addressed by utilizing an ode MATLAB solver. It is worth mentioning that the product W T ( t ) W ( t ) R 2 r × 2 r is a state-dependent mass matrix. Note that, with the exception of the difference between the solved problems, (39) is calculated separately from the model’s dynamics described in [31], whereas (39) is incorporated into the dynamics of the NHOZNN model (44) to reduce the computational cost in this paper. According to Theorem 6, the NHOZNN model (44) converges to the theoretical solution when noise is present.
Theorem 6. 
Assume that A ( t ) , B ( t ) , Q ( t ) R n × n are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices. At each time t [ 0 , t f ) [ 0 , + ) , if the product W T ( t ) W ( t ) R 2 r × 2 r with r = ( n 2 + n ) / 2 in (44) is non-singular then the NHOZNN model (44) converges to the theoretical solution d * ( t ) when noise is present exponentially, beginning from any primary price d ( 0 ) . Furthermore, the symmetric theoretical solution of TV-ARE (2) when noise is present, for each integer p 2 , is the last r components of d * ( t ) .
Proof. 
The proof is omitted since it is similar to the proof in [11] (Theorem 3.1) after replacing [34] (Theorem 1) with Theorems 3–5 for the constant noise, the linear noise and the bounded random noise, respectively. □

4. Computational Assessments

This section investigates the performance of the HOZNN (31) and NHOZNN (44) models in two numerical experiments (NEs), which involve solving the TV-ARE (2). On the one hand, to investigate the performance of the HOZNN model, two different initial conditions (ICs) are used. Under the first IC (IC1), the HOZNN model produces the unique non-negative solution of the TV-ARE. The figures in this instance also include the Schur method solution [5], which generates this specific solution. Under the second IC (IC2), the HOZNN model produces a random symmetric solution of the TV-ARE. On the other hand, to investigate the performance of the NHOZNN model, three different noises are used under IC2. These noises are the following:
  • Constant noise (CN): N ( t ) = 10 × 1 ;
  • Linear noise (LN): N ( t ) = ( 2 + t / 4 ) × 1 ;
  • Bounded random noise (BRN): N ( t ) = ( 2 + s i n ( t ) ) × 1 .
It is important to note that in the figures legend, the subscript number to HOZNN and NHOZNN refer to the value of p. Furthermore, it is important to mention that the HOZNN (31) and NHOZNN (44) models for p = 2 become the traditional ZNN models. That is, ZNN≡HOZNN 2 and NZNN≡NHOZNN 2 . Additionally, each model’s convergence is represented by its EME value (Error) for the corresponding model in terms of time per second (Time/s). Finally, during the computation of all NEs, the MATLAB solver ode15s is used under the time interval [ 0 , 10 ] , with the parameters λ = 10 and ζ = 10 .

4.1. Numerical Experiment 1

Consider the following 2 × 2 input matrices:
A ( t ) = 2 cos ( t ) + 4 cos ( t ) 3 sin ( 2 t ) + 5 6 sin ( t ) 17 , B ( t ) = sin ( 2 t ) + 3 cos ( 2 t ) + 2 cos ( 2 t ) + 2 sin ( 2 t ) + 7 , Q ( t ) = 4 sin ( t ) + 8 sin ( t ) 3 sin ( t ) 3 3 cos ( 2 t ) + 2 .
By defining the ICs as below:
IC1:
x ( 0 ) = [ 2 , 0.5 , 0 ] T
IC2:
x ( 0 ) = r ( 0 ) = [ 0 , 0 , 0 ] T
the findings of HOZNN and NHOZNN for p = 2 , 3 , 4 are depicted in Figure 1 and Figure 2. Specifically, the error E H p ( t ) F , referring to the HOZNN solutions V ( t ) convergence, is presented in Figure 1a,c for IC1 and IC2, respectively, while the trajectories of these solutions are shown in Figure 1b,d. Under IC2, the error E H p ( t ) F referring to the NHOZNN solutions V ( t ) convergence is shown in Figure 2a,c,e for CN, LN, and BRN, respectively, whereas the trajectories of these solutions are depicted in Figure 2b,d,f.

4.2. Numerical Experiment 2

Consider the following 3 × 3 input matrices:
A ( t ) = cos ( t ) + 7 sin ( t ) + 5 cos ( 2 t ) + 5 sin ( t ) + 5 sin ( t ) + 8 sin ( t ) 4 cos ( 2 t ) + 5 sin ( t ) 4 sin ( 2 t ) + 9 , B ( t ) = 3 cos ( t ) + 8 sin ( 3 t ) 2 0 sin ( 3 t ) 2 sin ( t ) + 6 4 0 4 6 , Q ( t ) = 2 sin ( t ) + 7 cos ( t ) 4 sin ( 2 t ) + 6 cos ( t ) 4 8 cos ( t ) 4 sin ( 2 t ) + 6 cos ( t ) 4 cos ( 2 t ) + 8 .
After defining the next ICs:
IC1:
x ( 0 ) = [ 3 , 2 , 8 , 0.3 , 6 , 7 ] T
IC2:
x ( 0 ) = r ( 0 ) = [ 0 , 0 , 0 , 0 , 0 , 0 ] T
the results of HOZNN and NHOZNN for p = 2 , 4 , 6 are depicted in Figure 1 and Figure 2. Particularly, the error E H p ( t ) F referring to the HOZNN solutions V ( t ) convergence is presented in Figure 2e,g for IC1 and IC2, respectively, whereas the trajectories of these solutions are shown in Figure 2f,h. Under IC2, the error E H p ( t ) F referring to the NHOZNN solutions V ( t ) convergence is shown in Figure 2g,i,k for CN, LN, and BRN, respectively, whereas the trajectories of these solutions are depicted in Figure 2h,j,l.

4.3. Numerical Experiments Discussion

The performance of the HOZNN and NHOZNN models for solving the TV-ARE is investigated through NEs Section 4.1 and Section 4.2. Keep in mind that when the EME of the ZNN, HOZNN, NZNN, and NHOZNN models converge to the zero matrix, the models converge to the theoretical solution. In other words, the solution generated by the ZNN, HOZNN, NZNN, and NHOZNN models makes the equality in the TV-ARE true. As a consequence, by looking at the EME values in the related figures, we can trust the solutions produced by the models.
In the case of the HOZNN model, the findings are presented in Figure 1. As can be observed in Figure 1b,f, the HOZNN model yields the unique non-negative solution of the TV-ARE under IC1, which is identical to the Schur method solution. However, as can be seen in Figure 1d,h, the HOZNN model yields a random symmetric solution of the TV-ARE under IC2. This means that different symmetric TV-ARE solutions are produced from the HOZNN model for different ICs. The EME convergence of the HOZNN models is depicted in Figure 1a,c for the NE Section 4.1, and Figure 1e,g for the NE Section 4.2. In all of these figures, we observe that the EME of the HOZNN models convergence begins at t = 0 with values in the range [ 10 , 10 2 ] , but it ends before t = 1 with lowest values in the range [ 10 4 , 10 2 ] . That is, the EME of the HOZNN models begins from a non-optimal IC and convergence to the zero matrix. Additionally, Figure 1a,c,e,g illustrate that the convergence occurs more quickly the higher the value of the parameter p. In other words, for p = 4 the HOZNN model converges more quickly than for p = 3 , and for p = 3 , the HOZNN model converges more quickly than for p = 2 in NE Section 4.1. Furthermore, for p = 6 , the HOZNN model converges more quickly than for p = 4 , and for p = 4 , the HOZNN model converges more quickly than for p = 2 in NE Section 4.2. The graphs in Figure 1b,d,f,h behave in the same way due to the convergence tendency of the EME convergence of the HOZNN models. In other words, the solution trajectories associated with the HOZNN models in these figures begin at t = 0 in a very different value from the objective and reach it before t = 1 . As a result, it is evident that Theorem 2 is proven true since we assume that A ( t ) , B ( t ) , Q ( t ) are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices.
In the case of the NHOZNN model, the findings are presented in Figure 2. As can be observed in Figure 2b,d,f,h,j,l, the NHOZNN model produces a random symmetric solution to the TV-ARE of NEs Section 4.1 and Section 4.2 under IC2 with three different types of noise, CN, LN, and BRN. Further, Figure 2a,c,e,g,i,k show that for every type of noise that was utilized, the NHOZNN model converges to the TV-ARE solution. Particularly, we observe that the EME of the NHOZNN models convergence begins at t = 0 with values in the range [ 10 , 10 2 ] and, at t = 0.5 , takes values in the range [ 1 , 10 1 ] . Until t = 10 , the EME of the NHOZNN models values continue to drop, with lowest values in the range [ 10 1 , 10 4 ] . That is, the EME of the NHOZNN models begin from a non-optimal IC and convergence to the zero matrix. Notice also in these figures that the convergence occurs more quickly as the parameter p increases in value. The graphs in Figure 2b,d,f,h,j,l behave in the same way due to the convergence tendency of the EME convergence of the NHOZNN models under three different types of noise, CN, LN, and BRN. In other words, the solutions trajectories associated with the NHOZNN models in these figures begin at t = 0 in a very different value from the objective and continue to drop until t = 10 under three different types of noise. As a result, it is evident that Theorem 6 is proven true since we assume that A ( t ) , B ( t ) , Q ( t ) are differentiable and B ( t ) , Q ( t ) are non-negative definite and symmetric matrices.
The following is deduced from the NEs of this section. As the parameter p increases in value, the HOZNN and NHOZNN models perform better at solving the TV-ARE than the traditional ZNN and NZNN models, i.e., HOZNN and NHOZNN with p = 2 . In other words, the HOZNN and NHOZNN models provide the smallest Frobenius norm for the EMEs when the parameter p increases in value. It is also important to note that the models will converge more quickly the larger the value of the design parameter λ . In essence, the HOZNN and NHOZNN models outperform the traditional ZNN and NZNN models, respectively, in solving the TV-ARE.

5. Conclusions

In this paper, the problems of solving the TV-ARE is addressed by employing a family of ZNN models that correlate to the hyperpower iterative methods. As a consequence, this study proposed and examined two models: a HOZNN model that produces numerical TV-ARE real symmetric solutions, and a NHOZNN model that produces numerical TV-ARE real symmetric solutions when noise is present. The HOZNN and NHOZNN models’ exponential convergence has been demonstrated theoretically, and NEs have demonstrated that the suggested models outperform the traditional ZNN and NZNN models, respectively, at addressing the TV-ARE. Particularly, two NEs demonstrate that, beginning from non-optimal ICs, both the NHOZNN model under three distinct types of noise and the HOZNN model converge to the symmetric theoretical solutions of TV-ARE. The efficacy of the suggested models has thus been theoretically and numerically confirmed.
Some potential study topics are listed below.
  • Future studies might examine the use of well chosen fuzzy parameters to create HOZNN dynamics enhancements.
  • Applications in engineering [35,36,37] could demonstrate the reliability of the HOZNN dynamics in practical scenarios.

Author Contributions

All authors (H.J., H.A., M.O., L.L., T.E.S., S.D.M. and V.N.K.) contributed equally. All authors have read and agreed to the published version of the manuscript.

Funding

This research work was funded by Institutional Fund Projects under grant no. (IFPIP 509-135-1443). Therefore, authors gratefully acknowledge technical and financial support from the Ministry of Education and King Abdulaziz University, Jeddah, Saudi Arabia.

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.

Nomenclature List

The following abbreviations and parameters are used in this manuscript:
AREalgebraic Riccati equations
CAREcontinuous-time algebraic Riccati equation
TV-AREtime-varying algebraic Riccati equation
ZNNzeroing neural network
HOZNNhigher-order zeroing neural network
NHOZNNnoise-handling higher-order zeroing neural network
AFactivation function
EMEerror matrix equation
NEsnumerical experiments
ICsinitial conditions
IC1first initial condition
IC2second initial condition
CNconstant noise
LNlinear noise
BRNbounded random noise
λ a design parameter that is utilized to scale the convergence of the zeroing neural
network dynamics and the noise-handling zeroing neural network dynamics
ζ a design parameter that is utilized to scale the convergence of the
noise-handling zeroing neural network dynamics

References

  1. Kalman, R.E. Contributions to the theory of optimal control. Bol. Soc. Mat. Mex. 1960, 5, 102–119. [Google Scholar]
  2. Qin, B.; Sun, H.; Ma, J.; Li, W.; Ding, T.; Wang, Z.; Zomaya, A.Y. Robust H control of doubly fed wind generator via state-dependent Riccati equation technique. IEEE Trans. Power Syst. 2019, 34, 2390–2400. [Google Scholar] [CrossRef]
  3. Rigatos, G.; Busawon, K.; Pomares, J.; Abbaszadeh, M. Nonlinear optimal control for the wheeled inverted pendulum system. Robotica 2020, 38, 29–47. [Google Scholar] [CrossRef]
  4. Dong, X.; Hu, G. Time-varying formation tracking for linear multiagent systems with multiple leaders. IEEE Trans. Autom. Control 2017, 62, 3658–3664. [Google Scholar] [CrossRef]
  5. Laub, A. A Schur method for solving algebraic Riccati equations. IEEE Trans. Autom. Control 1979, 24, 913–921. [Google Scholar] [CrossRef] [Green Version]
  6. Aguilar, L.T.; Orlov, Y.; Acho, L. Nonlinear H-control of nonsmooth time-varying systems with application to friction mechanical manipulators. Automatica 2003, 39, 1531–1542. [Google Scholar] [CrossRef]
  7. Ferrante, A.; Ntogramatzidis, L. The generalized continuous algebraic Riccati equation and impulse-free continuous-time LQ optimal control. Automatica 2014, 50, 1176–1180. [Google Scholar] [CrossRef]
  8. Ohtsuka, T. A recursive elimination method for finite-horizon optimal control problems of discrete-time rational systems. IEEE Trans. Autom. Control 2014, 59, 3081–3086. [Google Scholar] [CrossRef] [Green Version]
  9. Oshman, Y.; Bar-Itzhack, I. Eigenfactor solution of the matrix Riccati equation–A continuous square root algorithm. IEEE Trans. Autom. Control 1985, 30, 971–978. [Google Scholar] [CrossRef]
  10. Dooren, P.V. A generalized eigenvalue approach for solving Riccati equations. SIAM J. Sci. Stat. Comput. 1981, 2, 121–135. [Google Scholar] [CrossRef]
  11. Simos, T.E.; Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S. Finite-time convergent zeroing neural network for solving time-varying algebraic Riccati equations. J. Frankl. Inst. 2022. [Google Scholar] [CrossRef]
  12. Simos, T.E.; Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S. Unique non-negative definite solution of the time-varying algebraic Riccati equations with applications to stabilization of LTV systems. Math. Comput. Simul. 2022, 202, 164–180. [Google Scholar] [CrossRef]
  13. Prach, A.; Tekinalp, O.; Bernstein, D.S. A numerical comparison of frozen-time and forward-propagating Riccati equations for stabilization of periodically time-varying systems. In Proceedings of the American Control Conference, Portland, OR, USA, 4–6 June 2014; pp. 5633–5638. [Google Scholar]
  14. Prach, A.; Kayacan, E.; Bernstein, D.S. An experimental evaluation of the forward propagating Riccati equation to nonlinear control of the Quanser 3 DOF Hover testbed. In Proceedings of the 2016 American Control Conference, ACC 2016, Boston, MA, USA, 6–8 July 2016; pp. 3710–3715. [Google Scholar] [CrossRef]
  15. Saiery, M.; Katebi, J.; Lakestani, M. Control of time-varying systems based on forward Riccati formulation in hybrid functions domain. Int. J. Control. 2022. [Google Scholar] [CrossRef]
  16. Zhang, Y.; Ge, S.S. Design and analysis of a general recurrent neural network model for time-varying matrix inversion. IEEE Trans. Neural Netw. 2005, 16, 1477–1490. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  17. Jin, L.; Zhang, Y.; Li, S.; Zhang, Y. Noise-tolerant ZNN models for solving time-varying zero-finding problems: A control-theoretic approach. IEEE Trans. Autom. Control 2017, 62, 992–997. [Google Scholar] [CrossRef]
  18. Jin, J.; Zhu, J.; Gong, J.; Chen, W. Novel activation functions-based ZNN models for fixed-time solving dynamirc Sylvester equation. Neural Comput. Appl. 2022, 34, 14297–14315. [Google Scholar] [CrossRef]
  19. Jin, J.; Zhu, J.; Zhao, L.; Chen, L.; Chen, L.; Gong, J. A robust predefined-time convergence zeroing neural network for dynamic matrix inversion. IEEE Trans. Cybern. 2022. [Google Scholar] [CrossRef]
  20. Mourtas, S.D.; Kasimis, C. Exploiting mean-variance portfolio optimization problems through zeroing neural networks. Mathematics 2022, 10, 3079. [Google Scholar] [CrossRef]
  21. Kornilova, M.; Kovalnogov, V.; Fedorov, R.; Zamaleev, M.; Katsikis, V.N.; Mourtas, S.D.; Simos, T.E. Zeroing neural network for pseudoinversion of an arbitrary time-varying matrix based on singular value decomposition. Mathematics 2022, 10, 1208. [Google Scholar] [CrossRef]
  22. Katsikis, V.N.; Stanimirović, P.S.; Mourtas, S.D.; Li, S.; Cao, X. Generalized Inverses: Algorithms and Applications; Mathematics Research Developments, Nova Science Publishers, Inc.: Hauppauge, NY, USA, 2021. [Google Scholar]
  23. Jin, L.; Li, J.; Sun, Z.; Lu, J.; Wang, F. Neural dynamics for computing perturbed nonlinear equations applied to ACP-based lower limb motion intention recognition. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 5105–5113. [Google Scholar] [CrossRef]
  24. Jin, L.; Wei, L.; Li, S. Gradient-based differential neural-solution to time-dependent nonlinear optimization. IEEE Trans. Autom. Control. 2022. [Google Scholar] [CrossRef]
  25. Climent, J.; Thome, N.; Wei, Y. A geometrical approach on generalized inverses by Neumann-type series. Linear Algebra Appl. 2001, 332, 533–540. [Google Scholar] [CrossRef] [Green Version]
  26. Li, W.; Li, Z. A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix. Appl. Math. Comput. 2010, 215, 3433–3442. [Google Scholar] [CrossRef]
  27. Liu, X.; Jin, H.; Yu, Y. Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices. Linear Algebra Appl. 2013, 439, 1635–1650. [Google Scholar] [CrossRef]
  28. Weiguo, L.; Juan, L.; Tiantian, Q. A family of iterative methods for computing Moore-Penrose inverse of a matrix. Linear Algebra Appl. 2013, 438, 47–56. [Google Scholar] [CrossRef]
  29. Stanimirović, P.S.; Srivastava, S.; Gupta, D.K. From Zhang neural network to scaled hyperpower iterations. J. Comput. Appl. Math. 2018, 331, 133–155. [Google Scholar] [CrossRef]
  30. Simos, T.E.; Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S.; Gerontitis, D. A higher-order zeroing neural network for pseudoinversion of an arbitrary time-varying matrix with applications to mobile object localization. Inf. Sci. 2022, 600, 226–238. [Google Scholar] [CrossRef]
  31. Stanimirović, P.S.; Katsikis, V.N.; Li, S. Higher-order ZNN dynamics. Neural Process. Lett. 2020, 51, 697–721. [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. 2016, 27, 2615–2627. [Google Scholar] [CrossRef]
  33. Gupta, A.K. Numerical Methods Using MATLAB; MATLAB Solutions Series; Springer Press: New York, NY, USA, 2014. [Google Scholar]
  34. Liu, H.; Wang, T.; Guo, D. Design and validation of zeroing neural network to solve time-varying algebraic Riccati equation. IEEE Access 2020, 8, 211315–211323. [Google Scholar] [CrossRef]
  35. Aloui, M.; Hamidi, F.; Jerbi, H.; Omri, M.; Popescu, D.; Abbassi, R.A. Chaotic Krill Herd optimization algorithm for global numerical estimation of the attraction domain for nonlinear systems. Mathematics 2021, 9, 1743. [Google Scholar] [CrossRef]
  36. Jerbi, H.; Ben Aoun, S.; Omri, M.; Simos, T.E.; Tsitouras, C. A neural network type approach for constructing Runge-Kutta pairs of orders six and five that perform best on problems with oscillatory solutions. Mathematics 2022, 10, 827. [Google Scholar] [CrossRef]
  37. Jerbi, H.; Omri, M.; Kchaou, M.; Simos, T.E.; Tsitouras, C. Runge-Kutta-Nyström pairs of orders 8(6) with coefficients trained to perform best on classical orbits. Mathematics 2022, 10, 654. [Google Scholar] [CrossRef]
Figure 1. Trajectories of the HOZNN’s solutions and convergence in NEs Section 4.1 and Section 4.2 under IC1 and IC2. (a) NE Section 4.1 under IC1: convergence. (b) NE Section 4.1 under IC1: solutions trajectories. (c) NE Section 4.1 under IC2: convergence. (d) NE Section 4.1 under IC2: solutions trajectories. (e) NE Section 4.2 under IC1: convergence. (f) NE Section 4.2 under IC1: solutions trajectories. (g) NE Section 4.2 under IC2: convergence. (h) NE Section 4.2 under IC2: solutions trajectories.
Figure 1. Trajectories of the HOZNN’s solutions and convergence in NEs Section 4.1 and Section 4.2 under IC1 and IC2. (a) NE Section 4.1 under IC1: convergence. (b) NE Section 4.1 under IC1: solutions trajectories. (c) NE Section 4.1 under IC2: convergence. (d) NE Section 4.1 under IC2: solutions trajectories. (e) NE Section 4.2 under IC1: convergence. (f) NE Section 4.2 under IC1: solutions trajectories. (g) NE Section 4.2 under IC2: convergence. (h) NE Section 4.2 under IC2: solutions trajectories.
Mathematics 10 04490 g001
Figure 2. Trajectories of the HOZNN’s solutions and convergence in NEs Section 4.1 and Section 4.2 with CN, LN, and BRN. (a) NE Section 4.1 with CN: convergence. (b) NE Section 4.1 with CN: solution trajectories. (c) NE Section 4.1 with LN: convergence. (d) NE Section 4.1 with LN: solution trajectories. (e) NE Section 4.1 with BRN: convergence. (f) NE Section 4.1 with BRN: solution trajectories. (g) NE Section 4.2 with CN: convergence. (h) NE Section 4.2 with CN: solution trajectories. (i) NE Section 4.2 with LN: convergence. (j) NE Section 4.2 with LN: solution trajectories. (k) NE Section 4.2 with BRN: convergence. (l) NE Section 4.2 with BRN: solution trajectories.
Figure 2. Trajectories of the HOZNN’s solutions and convergence in NEs Section 4.1 and Section 4.2 with CN, LN, and BRN. (a) NE Section 4.1 with CN: convergence. (b) NE Section 4.1 with CN: solution trajectories. (c) NE Section 4.1 with LN: convergence. (d) NE Section 4.1 with LN: solution trajectories. (e) NE Section 4.1 with BRN: convergence. (f) NE Section 4.1 with BRN: solution trajectories. (g) NE Section 4.2 with CN: convergence. (h) NE Section 4.2 with CN: solution trajectories. (i) NE Section 4.2 with LN: convergence. (j) NE Section 4.2 with LN: solution trajectories. (k) NE Section 4.2 with BRN: convergence. (l) NE Section 4.2 with BRN: solution trajectories.
Mathematics 10 04490 g002aMathematics 10 04490 g002b
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Jerbi, H.; Alharbi, H.; Omri, M.; Ladhar, L.; Simos, T.E.; Mourtas, S.D.; Katsikis, V.N. Towards Higher-Order Zeroing Neural Network Dynamics for Solving Time-Varying Algebraic Riccati Equations. Mathematics 2022, 10, 4490. https://doi.org/10.3390/math10234490

AMA Style

Jerbi H, Alharbi H, Omri M, Ladhar L, Simos TE, Mourtas SD, Katsikis VN. Towards Higher-Order Zeroing Neural Network Dynamics for Solving Time-Varying Algebraic Riccati Equations. Mathematics. 2022; 10(23):4490. https://doi.org/10.3390/math10234490

Chicago/Turabian Style

Jerbi, Houssem, Hadeel Alharbi, Mohamed Omri, Lotfi Ladhar, Theodore E. Simos, Spyridon D. Mourtas, and Vasilios N. Katsikis. 2022. "Towards Higher-Order Zeroing Neural Network Dynamics for Solving Time-Varying Algebraic Riccati Equations" Mathematics 10, no. 23: 4490. https://doi.org/10.3390/math10234490

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