Next Article in Journal
Optimal Energy-Aware Scheduling of Heterogeneous Jobs with Monotonically Increasing Slot Costs
Previous Article in Journal
A High-Accuracy PCB Defect Detection Algorithm Based on Improved YOLOv12
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis of Stability of Delayed Quaternion-Valued Switching Neural Networks via Symmetric Matrices

School of Mathematics and Statistics, Chongqing Three Gorges University, Chongqing 404100, China
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(7), 979; https://doi.org/10.3390/sym17070979
Submission received: 5 May 2025 / Revised: 12 June 2025 / Accepted: 18 June 2025 / Published: 20 June 2025
(This article belongs to the Section Mathematics)

Abstract

:
The stability of a class of quaternion-valued switching neural networks (QVSNNs) with time-varying delays is investigated in this paper. Limited prior research exists on the stability analysis of quaternion-valued neural networks (QVNNs). This paper addresses the stability analysis of quaternion-valued neural networks (QVNNs). With the help of some symmetric matrices with excellent properties, the stability analysis method in this paper is undecomposed. The QVSNN discussed herein evolves with average dwell time. Based on the Lyapunov theoretical framework and Wirtinger-based inequality, QVSNNs under any switching law have global asymptotic stability (GAS) and global exponential stability (GES). The state decay estimation of the system is also given and proved. Finally, the effective and practical applicability of the proposed method is demonstrated by two comprehensive numerical calculations.

1. Introduction

Quaternions are the expanded form of real and complex numbers, comprising a real component paired with three orthogonal imaginary components. With the advancement of deep learning, researchers have begun to explore the possibility of incorporating quaternions into neural networks (NNs). Early studies primarily focused on the mathematical properties of quaternions. In recent years, QVNNs have demonstrated promising applications in areas such as satellite attitude control (UAV attitude control and multi-degree-of-freedom vehicle control) [1,2,3] and robotic motion control (robotic arm end-effector trajectory tracking, humanoid robot gait planning, and vibration suppression in flexible robotic arms) [4,5]. Researchers have proposed quaternion-valued convolutional NNs for processing color images and video data [6,7,8]. Quaternion-valued recurrent NNs have been utilized for processing time series data and natural language processing tasks [9,10]. These applications are closely related to the dynamic characteristics of QVNNs. Therefore, analyzing the stability of QVNNs is both necessary and meaningful. Essentially, it utilizes its high-dimensional algebraic structure, parameter efficiency, and physical interpretability to achieve more robust learning dynamics in complex tasks. This brings unique advantages in terms of higher-dimensional feature representation and stability, parameter efficiency and generalization ability, and robustness to complex perturbations and facilitates the long-term stability of dynamic systems. Recently, Wang [11], Humphries [12], Yang [13], and Shu [14] used the method of decomposing quaternions to analyze the stability of QVNNs. However, using decomposition to handle quaternions increases the computational complexity of the model, which means that a quaternion has to be decomposed into four real numbers to be computed. It also increases the conservatism of the activation function, which is demonstrated by the fact that the real and imaginary parts of the activation function can be separated, whereas in practice, it is possible that a quaternion -valued function does not fulfill this condition. If the undecomposed method is used, then the multiplication of quaternions (conjugate, dot product, etc.) can be accomplished by 16 real multiplications and additions, reducing the number of computational steps, and the overall operation is consistent with properties such as multiplicative combinativity. Therefore, for this study, the direct quaternion approach was used to reduce the computational cost and ensure a wider range of applicability for the system proposed in this paper.
In the modeling and design of NNs, time-varying delays are frequently encountered due to delays in information processing, which is also a source of oscillations in neural systems. Therefore, it is both necessary and meaningful to consider time-varying delays in the process of stability analysis for NNs. In recent years, Chen [15] discussed leakage delays and discrete delays. Song [16] addressed neutral-type delays. You [17] explored mixed time-varying delays. Wu [18], Shen [19], and Liu [20] discussed state delays. Tu [21] discussed discrete and distributed delays. Although many researchers have considered time-varying delays during stability analysis, fewer have considered both state time-varying delays and neutral-type time-varying delays. Therefore, in this paper, both state time-varying delays and neutral-type time-varying delays are taken into account simultaneously, helping to expand the applicability of the model and more accurately characterize the dynamic behavior of NNs.
A switching system is composed of multiple dynamic modes and a switching rule. Given a switching rule, a mode will be activated at a specific time and evolve over time intervals. System switching approaches are generally categorized into two types: time-dependent switching [22] and mode-dependent switching [23]. Time-dependent switching is based on switching at fixed time intervals, and state-dependent switching is based on switching when the system state reaches a specified switching threshold. This means that state-dependent switching is more complex than time-dependent switching, so time-dependent switching is used to reduce the complexity in this paper. Switching neural networks(SNNs) are a specialized form of NNs that incorporate the concept of switching. Such systems are capable of switching among multiple NNs subsystems in accordance with shifting external conditions and operational needs, thereby achieving more flexible and efficient information processing and control. Applications of such systems encompass associative memory and knowledge representation [24], control systems and automation [25], pattern recognition and image processing [26,27], and other related research areas. These wide-ranging applications are inextricably linked to the stability of SNNs. Bao [28] discussed the resilient fixed-time stability of SNNs affected by impulsive deception attacks; a novel theorem for the fixed-time stability of impulsive systems was established by virtue of the comparison principle. Guo [29] discussed the multistability of SNNs under state-dependent switching; the switching threshold was found to play an important role in stabilizing the equilibrium in the unsaturated region of the activation function. Jiao [30] discussed the stability of stochastic impulsive and SNNs; a result concerned with the existence and uniqueness of solutions to random impulsive and switching neural networks was developed under some general conditions. Yang [31] discussed the robust stability of stochastic SNNs, and Wu [32] discussed the GES of NNs with switching parameters, combining the mean residence time method with the segmented Lyapunov function technique. The above studies discussed a certain stability of the SNNs, while fewer studies discuss different stabilities at the same time. Therefore, we discuss both GAS (the state eventually converges to the equilibrium point, but the convergence speed is not explicitly specified) and GES (the state converges to the equilibrium point at an exponential rate, and the convergence rate is clear and fast) of SNNs and give more comprehensive stability results in this paper.
From the above discussion, we know that most of the current studies on quaternion-valued neural networks [11,12,13,14] do not consider switching, and the studies on switching neural networks [28,30,31,32] do not consider quaternions. Therefore, we try to combine quaternion and switching neural networks and use the method of undecomposition to deal with the quaternion while considering state time-varying time delay and neutral-type time-varying time delay. The research method is relatively novel and has some research significance. Meanwhile, the QVSNN model is not only limited to the theoretical establishment but is also necessary in practice. It has a wide range of practical applications in 3D/4D motion analysis, weather forecasting, electromagnetic signal processing, image matching, EEG/EMI signal analysis, medical image fusion, and UAV swarm collaboration.
Based on existing discussions, this paper endeavors to establish sufficient conditions for the GAS and GES of a class of QVSNNs with state time-varying delays and neutral-type time-varying delays. Our key contributions are summarized below:
(1)
The combination of quaternions and switching neural networks has been rarely studied, so in this paper, we try to explore the stability of QVSNNs by analysing the properties of some symmetric matrices in an undecomposed approach.
(2)
The QVSNN discussed in this paper has a global asymptotic stability under arbitrary switching laws and a global exponential stability under a given switching sequence and switching condition;
(3)
The Wirtinger-based inequality is generalized to the domain of quaternions and used in the analysis of stability, where the method of proof differs from the existing literature.
The remainder of this paper is structured as follows: Section 2 introduces the studied system and formulates the underlying assumptions, formal definitions, and core lemmas. In Section 3, two key theorems are given, and their accuracy is proved by means of rigorous theoretical derivations. Section 4 verifies the theoretical analysis through numerical simulations. Finally, Section 5 gives conclusions.

2. Preliminaries

Notations: Let R (reals), C (complexes), and Q (quaternions) denote the respective number systems. The matrix spaces R n × n , C n × n , and Q n × n consist of all n × n matrices over R , C , and Q , correspondingly. We write R n (resp. C n , Q n ) for the space of n-dimensional real (resp. complex, quaternion) vectors. Let A T be the transpose, A ¯ the conjugate, and A * = A ¯ T the conjugate transpose of matrix A . For any A Q n × n , the module of A is denoted by A , while A indicates its norm, and λ m i n A and λ m a x A correspond to the minimum and maximum eigenvalues, respectively.

2.1. Quaternion Algebra

Quaternions are an associative algebra defined over the real field R . The real form of a quaternion can be expressed as follows:
U = U 0 + U 1 ξ 1 + U 2 ξ 2 + U 3 ξ 3 Q .
with a real component R U = U 0 and a vector component I U = U 1 ξ 1 + U 2 ξ 2 + U 3 ξ 3 , where U 0 , U 1 , U 2 , U 3 are real coefficients. The basis elements ξ 1 , ξ 2 , ξ 3 satisfy the following relations:
ξ 1 2 = ξ 2 2 = ξ 3 2 = 1 , ξ 1 ξ 2 = ξ 2 ξ 1 = ξ 3 , ξ 2 ξ 3 = ξ 3 ξ 2 = ξ 1 , ξ 3 ξ 1 = ξ 1 ξ 3 = ξ 2 .
This defines a non-commutative multiplication operation in the quaternion algebra.
For any two quaternions V = V 0 + V 1 ξ 1 + V 2 ξ 2 + V 3 ξ 3 and U = U 0 + U 1 ξ 1 + U 2 ξ 2 + U 3 ξ 3 , give the operation between them.
(i)
Additive operation:
V + U = V 0 + U 0 + V 1 + U 1 ξ 1 + V 2 + U 2 ξ 2 + V 3 + U 3 ξ 3 ;
(ii)
Multiplication operation:
V U = V 0 U 0 V 1 U 1 V 2 U 2 V 3 U 3 + V 0 U 1 + V 1 U 0 + V 2 U 3 V 3 U 2 ξ 1 + V 0 U 2 + V 2 U 0 V 1 U 3 + V 3 U 1 ξ 2 + V 0 U 3 + V 3 U 0 + V 1 U 2 U 2 V 1 ξ 3 .
For a given quaternion U = U 0 + U 1 ξ 1 + U 2 ξ 2 + U 3 ξ , we denote the conjugate of U by U ¯ .
U ¯ = U 0 U 1 ξ 1 U 2 ξ 2 U 3 ξ 3 .
The definitions of the modulus of U are given below:
U = U U * = U 0 2 + U 1 2 + U 2 2 + U 3 2 .
For a given vector U = ( U 1 , , U n ) Q n , the definitions of the norm of U are given below:
U = i = 1 n U i 2 .

2.2. Model Description

In general, we represent a switching system that switches according to time(s) by the following differential equation:
Ƶ ˙ s = g s s , Ƶ s ,
where s is the switching signal, and it is a right-continuous segmented constant-valued function s : 0 , Z = 1 , 2 , , n , where Z is the subsystem index set. s = B , B Z denotes that the B th subsystem is activated.
This study examines the dynamical behaviour of QVSNNs with time-varying delays under the action of switching signals, whose models are described as follows:
g s s , Ƶ s = A S Ƶ s + B s f Ƶ s + C s f Ƶ s δ s + D t Ƶ ˙ s ϱ s + Ξ ,
where Ƶ s = Ƶ 1 s , Ƶ 2 s , , Ƶ n s T Q n is the state vector of the neuron, f · = f 1 · , f 2 · , , f n · T Q n is the activation function of the neuron, A s R n × n is a positive definite diagonal matrix, B s = b i j n × n , C s = c i j n × n , and D s = d i j n × n Q n × n are the matrix of connection rights. Ξ = Ξ 1 , Ξ 2 , Ξ n T Q n is an external input to a neural network, δ s is state time delays, and ϱ s is neutral-type time delays.
To make it easier to analyze, we transform (2) into the following model (3) for the equilibrium point at the origin, and subsequent studies are based on this model, described as follows:
Ƶ ˙ s = A s Ƶ s + B s f Ƶ s + C s f Ƶ s δ s + D s Ƶ ˙ s ϱ s , Ƶ s = ð s , ð s δ M , 0 ,
the parameters in model (3) are consistent with those in model (2), and ð t is the initial value of the neuron state.
A schematic of the quaternion -valued switching neural network model (3) is given below in Figure 1.
The structural framework of QVSNN can be clearly seen from the above diagram, where switching between n subsystems is performed, and the switching signals only need to satisfy the given switching sequences and average dwell time.
Some assumptions needed for this paper are given below.
Assumption 1.
The activation function f s is a bounded function and satisfies f 0 = 0 .
Assumption 2.
Diagonal matrices such as L = d i a g L 1 , L 2 , , L n > 0 R n exist, meaning that
f i U 1 f i U 2 L i U 1 U 2 , U 1 , U 2 Q , L i R , i = 1 , 2 , , n .
Assumption 3.
For δ s and ϱ s , s 0 and constant δ m 0 , δ M 0 , ϱ m 0 , ϱ M 0 , δ > 0 , ϱ > 0 satisfies
0 δ m δ s δ M , δ ˙ s δ < 1 , 0 ϱ m ϱ s ϱ M , ϱ ˙ s ϱ < 1 .
We give the above assumptions due to the fact that bounded activation functions are advantageous in scenarios that require stable outputs (e.g., control tasks, financial forecasting). In control systems where inference or training of neural networks must be completed in a fixed time (e.g., robot control), delay bounds ensure that the system response time satisfies the stability condition. Overall, assumptions such as bounded activation functions and delay bounds are not purely mathematical abstractions, but rather a bridge between theoretical stability and engineering practice. Although practical systems may not fully satisfy these ideal conditions, they provide a framework for designing robust, interpretable neural networks and have spawned numerous practical techniques (e.g., gradient tailoring, delay compensation).
Assumption 4.
For s , the following switching sequence is designed:
s = B 0 , s 0 , B 1 , s 1 , , B m , s m , | B m Z , m = 0 , 1 , , n ,
where 0 = s 0 < s 1 < s 2 < < s m < , and the B m th subsystem is activated when s s m , s m + 1 .
The definitions and lemmas needed for this paper are given below.
Definition 1.
If there is constant η > 0 and γ > 0 such that
Ƶ s η Ƶ s 0 e γ s s 0 , s s 0 ,
then system (3) is GES.
Definition 2.
If there exists Z 0 0 , Z = 1 , 2 , , n , S 1 S 2 such that
Z σ S 1 , S 2 Z 0 + S 2 S 1 S a ,
where Z σ S 1 , S 2 count the switchings of s on S 1 , S 2 , S a represents the average dwell time, and Z 0 is the chatter bound; for computational simplicity, we set Z 0 = 0 .
Lemma 1.
[15] Given a positive definite matrix K Q n × n (Hermitian) and a function ϑ κ : a , b Q n ( a < b ), the following inequality holds:
a b ϑ κ d κ * K a b ϑ κ d κ b a a b ϑ * κ K ϑ κ d κ .
Lemma 2.
[33] Given a matrix Γ = Γ ξ 0 + Γ ξ 1 + Γ ξ 2 + Γ ξ 3 Q n × n (Hermitian), then Γ < 0 is equivalent to
Γ ξ 0 Γ ξ 2 Γ ξ 2 Γ ξ 0 Γ ξ 1 Γ ξ 3 Γ ξ 3 Γ ξ 1 Γ ξ 1 Γ ξ 3 Γ ξ 3 Γ ξ 1 Γ ξ 0 Γ ξ 2 Γ ξ 2 Γ ξ 0 < 0 .
Lemma 3.
(Wirtinger-based inequality) For any positive definite matrix H Q n × n (Hermitian), the function ζ κ : c , d Q n is continuously differentiable, and the following inequality holds:
c d ζ ˙ * κ H ζ ˙ κ d κ 1 d c ζ d ζ c * H ζ d ζ c + 3 d c * H ,
where
= ζ d + ζ c 2 d c c d ζ κ d κ .
Proof. 
By Lemma 2, we can find that H > 0 is equivalent to
H ξ 0 H ξ 2 H ξ 2 H ξ 0 H ξ 1 H ξ 3 H ξ 3 H ξ 2 H ξ 1 H ξ 3 H ξ 3 H ξ 1 H ξ 0 H ξ 2 H ξ 2 H ξ 0 > 0 .
Because of ζ κ : c , d Q n , it is found that ζ ˙ κ = ζ ˙ 1 κ + ζ ˙ 2 κ ξ 1 + ζ ˙ 3 κ ξ 2 + ζ ˙ 4 κ ξ 3 , and then the following equation holds:
c d ζ ˙ * κ H ζ ˙ κ d κ = c d ζ ˙ 1 κ ζ ˙ 2 κ ζ ˙ 3 κ ζ ˙ 4 κ T H ξ 0 H ξ 2 H ξ 2 H ξ 0 H ξ 1 H ξ 3 H ξ 3 H ξ 2 H ξ 1 H ξ 3 H ξ 3 H ξ 1 H ξ 0 H ξ 2 H ξ 2 H ξ 0 ζ ˙ 1 κ ζ ˙ 2 κ ζ ˙ 3 κ ζ ˙ 4 κ d κ 1 d c ζ 1 d ζ 1 c ζ 2 d ζ 2 c ζ 3 d ζ 3 c ζ 4 d ζ 4 c T H ξ 0 H ξ 2 H ξ 2 H ξ 0 H ξ 1 H ξ 3 H ξ 3 H ξ 2 H ξ 1 H ξ 3 H ξ 3 H ξ 1 H ξ 0 H ξ 2 H ξ 2 H ξ 0 ζ 1 d ζ 1 c ζ 2 d ζ 2 c ζ 3 d ζ 3 c ζ 4 d ζ 4 c + 3 d c ζ 1 d + ζ 1 c ζ 2 d + ζ 2 c ζ 3 d ζ 3 c ζ 4 d ζ 4 c 2 d c c d ζ 1 κ ζ 2 κ ζ 3 κ ζ 4 κ d κ T × H ξ 0 H ξ 2 H ξ 2 H ξ 0 H ξ 1 H ξ 3 H ξ 3 H ξ 2 H ξ 1 H ξ 3 H ξ 3 H ξ 1 H ξ 0 H ξ 2 H ξ 2 H ξ 0 ζ 1 d + ζ 1 c ζ 2 d + ζ 2 c ζ 3 d + ζ 3 c ζ 4 d + ζ 4 c 2 d c c d ζ 1 κ ζ 2 κ ζ 3 κ ζ 4 κ d κ = 1 d c ζ d ζ c * H ζ d ζ c + 3 d c * H .
By decomposing quaternions into their four real components, this work extends the Wirtinger-based inequality to the quaternion domain, thereby completing the proof.
In the above proof of the generalization of Lemma 3, we use the decomposition method, this is because we want to generalize Lemma 3 to quaternionic domains, but there are existing results that use the undecomposed method, so we try to use the decomposition method to generalize it and verify that this method is also feasible. This does not contradict our subsequent derivation, and the treatment of the main model in this paper still uses the undecomposed method.
The above inequality can also be transformed into the following linear matrix inequality:
c d ζ ˙ * κ H ζ ˙ κ d κ 1 d c ˜ * œ ˜ ˜ ,
where
œ ˜ = 4 H 2 H 6 H 2 H * 4 H 6 H 6 H * 6 H * 12 H ,
˜ = ζ * d ζ * c 1 d c c d ζ * κ d κ * .
Remark 1.
The inequalities used during the stability analysis of neural networks have a significant impact on the conditions for determining stability. This paper employs Wirtinger-based inequalities to handle the quadratic term integrals; compared to other inequalities used in the literature [34,35], the Wirtinger-based inequality can provide tighter lower bounds. Moreover, these Wirtinger-based inequalities are transformed into linear matrix inequalities, making them more tractable.

3. Main Results

In this section, based on the Lyapunov theoretical framework, we will give three detailed proof procedures—for the GAS of system (3) under arbitrary switching laws, for the GES of system (3) under a given switching sequence, and for the GES of system (3) under the average dwell time condition—and estimations of the state decay by means of the Wirtinger-based inequality and the LMI techniques.

3.1. Global Asymptotic Stability

The proof procedure for the GAS of system (3) under an arbitrary switching law is given below.
Theorem 1.
Under Assumptions 1–3, if there exist symmetric matrices P > 0 , Q 1 > 0 , Q 2 > 0 , Q 3 > 0 , Q 4 > 0 , and R 1 > 0 R n × n , then we have any matrix M 1 , M 2 , and M 3 R n × n , guaranteeing the feasibility of the following LMIs:
Ω = Ω 11 Ω 12 0 Ω 14 Ω 15 Ω 16 0 * Ω 22 0 Ω 24 M 2 B B M 2 C B 0 * * Ω 33 0 0 0 0 * * * Ω 44 M 3 B B M 3 C B 0 * * * * Ω 55 0 0 * * * * * Ω 66 0 * * * * * * Ω 77 < 0 ,
with
Ω 11 = A B * P P * A B + Q 1 + L 1 * R 1 L 1 M 1 A B A B * M 1 * , Ω 12 = M 1 A B * M 2 * , Ω 14 = P * D B + M 1 D B A B * M 3 * , Ω 15 = P * B B + M 1 B B , Ω 16 = P * C B + M 1 C B , Ω 22 = Q 3 M 2 M 2 * + δ M Q 4 , Ω 24 = M 2 D B M 3 * , Ω 33 = 1 δ Q 1 , Ω 44 = 1 ϱ Q 3 + M 3 D B + D B * M 3 * , Ω 55 = Q 2 R 1 , Ω 66 = 1 δ Q 2 , Ω 77 = 1 δ M Q 4 ,
Then, system (3) is GAS under any switching law.
Proof. 
Our analysis is based on the construction of a Lyapunov–Krasovskii functional with the following form:
V s Ƶ s = i = 1 5 V i s Ƶ t ,
with
V 1 s Ƶ s = Ƶ * s P Ƶ s , V 2 s Ƶ s = s δ s s Ƶ * κ Q 1 Ƶ κ d κ , V 3 s Ƶ s = s δ s s f * Ƶ κ Q 2 f Ƶ κ d κ , V 4 s Ƶ s = s ϱ s s Ƶ ˙ * κ Q 3 Ƶ ˙ κ d κ , V 5 s Ƶ s = δ M 0 s + θ s Ƶ ˙ * κ Q 4 Ƶ ˙ κ d κ d θ .
Based on Assumption 3 and Lemma 1, combined with the dynamical behavior of the B th subsystem described in (3), a derivative operation on V Ƶ s leads to
V ˙ 1 B Ƶ s = Ƶ Ż * s P Ƶ s + Ƶ * s P * Ƶ ˙ s = A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * P Ƶ s + Ƶ * s P * A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s = Ƶ * s A B * P Ƶ s + f * Ƶ s B B * P Ƶ s + f * Ƶ s δ s C B * P Ƶ s + Ƶ ˙ * s ϱ s D B * P Ƶ s + Ƶ * s P * A B Ƶ s + Ƶ * s P * B B f Ƶ s + Ƶ * s P * C B f Ƶ s δ s + Ƶ * s P * D B Ƶ ˙ s ϱ s ,
V ˙ 2 B Ƶ s = Ƶ * s Q 1 Ƶ s 1 δ ˙ s Ƶ * s δ s Q 1 Ƶ s δ s Ƶ * s Q 1 Ƶ s 1 δ Ƶ * s δ s Q 1 Ƶ s δ s ,
V ˙ 3 B Ƶ s = f * Ƶ s Q 2 f Ƶ s 1 δ ˙ s f * Ƶ s δ s Q 2 f Ƶ s δ s f * Ƶ s Q 2 f Ƶ s 1 δ f * Ƶ s δ s Q 2 f Ƶ s δ s ,
V ˙ 4 B Ƶ s = Ƶ ˙ * s Q 3 Ƶ ˙ s 1 ϱ s Ƶ ˙ * s ϱ s Q 3 Ƶ ˙ s ϱ s Ƶ ˙ * s Q 3 Ƶ ˙ s 1 ϱ Ƶ ˙ * s ϱ s Q 3 Ƶ ˙ s ϱ s ,
V ˙ 5 B Ƶ s = δ M 0 Ƶ ˙ * s Q 4 Ƶ ˙ s Ƶ ˙ * s θ Q 4 Ƶ ˙ s θ d θ = δ M Ƶ ˙ * s Q 4 Ƶ ˙ s δ M 0 Ƶ ˙ * s θ Q 4 Ƶ ˙ s θ d θ = δ M Ƶ ˙ * s Q 4 Ƶ ˙ s s δ M s q ˙ * κ Q 4 Ƶ ˙ κ d κ δ M Ƶ ˙ * s Q 4 Ƶ ˙ s 1 δ M s δ M s Ƶ ˙ κ d κ * Q 4 s δ M s Ƶ ˙ κ d κ .
Due to the non-commutative nature of quaternion multiplication, it does not satisfy V ˙ 1 B Ƶ s = 2 Ƶ ˙ * s P Ƶ s in the derivation of V ˙ 1 B Ƶ s , and we need to pay attention to the way quaternions are treated here.
For any matrix M 1 , M 2 , M 3 , the following equation holds:
0 = Ƶ * s Ƶ ˙ * s Ƶ ˙ * s ϱ s M 1 M 2 M 3 × Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s + Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * × M 1 * M 2 * M 3 * Ƶ s Ƶ ˙ s Ƶ ˙ s ϱ s .
Under Assumption 2, there exists L 1 > 0 , which leads to the following inequality:
Ƶ * s L 1 * R 1 L 1 Ƶ s f * Ƶ s R 1 f Ƶ s 0 .
By (5)–(12), one can get
V ˙ B Ƶ s = V ˙ 1 B Ƶ s + V ˙ 2 B Ƶ s + V ˙ 3 B Ƶ s + V ˙ 4 B Ƶ s + V ˙ 5 B Ƶ s Ƶ * s A B * P Ƶ s + f * Ƶ s B B * P Ƶ s + f * Ƶ s δ s C B * P Ƶ s + Ƶ ˙ * s ϱ s D B * P Ƶ s + Ƶ * s P * A B Ƶ s + Ƶ * s P * B B f Ƶ s + Ƶ * s P * C B f Ƶ s δ s + Ƶ * s P * D B Ƶ ˙ s ϱ s + Ƶ * s Q 1 Ƶ s 1 δ Ƶ * s δ s Q 1 Ƶ s δ s + f * Ƶ s Q 2 f Ƶ s 1 δ f * Ƶ s δ s Q 2 f Ƶ s δ s + Ƶ ˙ * s Q 3 Ƶ ˙ s 1 ϱ Ƶ ˙ * s ϱ s Q 3 Ƶ ˙ s ϱ s + δ M Ƶ ˙ * s Q 4 Ƶ ˙ s 1 δ M s δ M s Ƶ ˙ κ d κ * Q 4 s δ M s Ƶ ˙ κ d κ + Ƶ * s L 1 * R 1 L 1 Ƶ s f * Ƶ s R 1 f Ƶ s + Ƶ * s Ƶ ˙ * s Ƶ ˙ * s ϱ s M 1 M 2 M 3 × Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s + Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * × M 1 * M 2 * M 3 * Ƶ s Ƶ ˙ s Ƶ ˙ s ϱ s = ω * s Ω ω s ,
where
ω s = Ƶ * s , Ƶ ˙ * s , Ƶ * s δ s , Ƶ ˙ * s ϱ s , f * Ƶ s , f * Ƶ s δ s , s δ M s Ƶ ˙ κ d κ * * .
From (4), it follows that
V ˙ B Ƶ s 0 ,
V ˙ B Ƶ s = 0 if and only if Ƶ s = f Ƶ s = 0 ; thus, we can conclude that system (3) is GAS under arbitrary switching laws, and the proof is complete. □
Remark 2.
There are fewer studies that consider the GAS of QVSNNs; basically, such studies directly analyze the GAS of QVNNs [36], real-valued NNs [37], or complex-valued NNs [38] without considering SNNs, so Theorem 1 considers the GAS of the QVSNNs, and it is required that each subsystem of system (3) be stable to ensure that even if one subsystem encounters an issue, the remaining stable subsystems can continue to operate. This outcome can be achieved under any switching law, which helps to reduce conservatism.

3.2. Global Exponential Stability

Since GAS under an arbitrary switching law only guarantees that the system state eventually converges to an equilibrium point, the rate of convergence cannot be described. However, GES explicitly requires that the states converge at an exponential rate, providing quantitative bounds on the rate of convergence. Therefore, in order to analyze the stability results of the system more comprehensively, in the following, we give the proof procedure of the GES of system (3) under the switching sequence.
Theorem 2.
Under Assumptions 1–4, for constants ρ > 0 and ε > 1 , if there exist symmetric matrices P 1 B > 0 , Q 5 B > 0 , Q 6 B > 0 , Q 7 B > 0 , Q 8 B > 0 , R 2 B > 0 a n d R 3 B > 0 R n × n , we have any matrix M 4 B , M 5 B , and M 6 B R n × n , guaranteeing the feasibility of the following LMIs:
P 1 B ε P 1 A , Q 5 B ε Q 5 A , Q 6 B ε Q 6 A , Q 7 B ε Q 7 A , Q 8 B ε Q 8 A , B A Z ,
Ψ B = Ψ 11 B Ψ 12 B 0 0 0 Ψ 16 B Ψ 17 B Ψ 18 B 0 * Ψ 22 B 0 0 0 Ψ 26 B M 5 B B B M 5 B C B 0 * * Ψ 33 B 0 0 0 0 0 0 * * * Ψ 44 B Ψ 45 B 0 0 0 Ψ 49 B * * * * Ψ 55 B 0 0 0 Ψ 59 B * * * * * Ψ 66 B M 6 B B B M 6 B C B 0 * * * * * * Ψ 77 B 0 0 * * * * * * * Ψ 88 B 0 * * * * * * * * Ψ 99 B < 0 ,
with
Ψ 11 B = ρ P 1 B A B * P 1 B P 1 B * A B + Q 5 B + L 2 B * R 2 B L 2 B M 4 B A B A B * M 4 B * , Ψ 12 B = M 4 B A B * M 5 B * , Ψ 16 B = P 1 B * D B + M 4 B D B A B * M 6 B * , Ψ 17 B = P 1 B * B B + M 4 B B B , Ψ 18 B = P 1 B * C B + M 4 B C B , Ψ 22 B = Q 7 B + δ M δ m Q 8 B M 5 B M 5 B * , Ψ 26 B = M 5 B D B M 6 B * , Ψ 33 B = 1 δ e ρ δ M Q 5 B + L 3 B * R 3 B L 3 B , Ψ 44 B = 4 e ρ δ M δ M δ m Q 8 B , Ψ 45 B = 2 e ρ δ M δ M δ m Q 8 B , Ψ 49 B = 6 e ρ δ M δ M δ m Q 8 B , Ψ 55 B = 4 e ρ δ M δ M δ m Q 8 B , Ψ 59 B = 6 e ρ δ M δ M δ m Q 8 B , Ψ 66 B = 1 ϱ e ρ ϱ M Q 7 B + M 6 B D B + D B * M 6 B * , Ψ 77 B = Q 6 B R 2 B , Ψ 88 B = 1 δ e ρ δ M Q 6 B R 3 B , Ψ 99 B = 12 e ρ δ M δ M δ m Q 8 B ,
Then, system (3) is GES when the switching signals s satisfy the switching sequence.
Proof. 
Our analysis is based on the construction of a Lyapunov–Krasovskii functional with the following form:
V s Ƶ s = i = 1 5 V i s Ƶ s ,
with
V 1 B Ƶ s = Ƶ * s P 1 B Ƶ s , V 2 B Ƶ s = s δ s s Ƶ * κ e ρ s κ Q 5 B Ƶ κ d κ , V 3 B Ƶ s = s δ s s f * Ƶ κ e ρ s κ Q 6 B f Ƶ κ d κ , V 4 B Ƶ s = s ϱ s s Ƶ ˙ * κ e ρ s κ Q 7 B Ƶ ˙ κ d κ , V 5 B Ƶ s = δ M δ m s + θ s Ƶ ˙ * κ e ρ s κ Q 8 B Ƶ ˙ κ d κ d θ .
Based on Assumption 3 and Lemma 3, combined with the dynamical behavior of the B th subsystem described in (3), a derivative operation on V Ƶ s leads to
V ˙ 1 B Ƶ s = Ƶ ˙ * s P 1 B Ƶ s + Ƶ * s P 1 B * Ƶ ˙ s = A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * P 1 B Ƶ s + Ƶ * s P 1 B * A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s = Ƶ * s A B * P 1 B Ƶ s + f * Ƶ s B B * P 1 B Ƶ s + f * Ƶ s δ s C B * P 1 B Ƶ s + Ƶ ˙ * s ϱ s D B * P 1 B Ƶ s + Ƶ * s P 1 B * A B Ƶ s + Ƶ * s P 1 B * B B f Ƶ s + Ƶ * s P 1 B * C B f Ƶ s δ s + Ƶ * s P 1 B * D B Ƶ ˙ s ϱ s ,
V ˙ 2 B Ƶ s = ρ s δ s s Ƶ * κ e ρ s κ Q 5 B Ƶ κ d κ + Ƶ * s Q 5 B Ƶ s 1 δ ˙ s Ƶ * s δ s e ρ δ s Q 5 B Ƶ s δ s ρ s δ s s Ƶ * κ e ρ s κ Q 5 B Ƶ κ d κ + Ƶ * s Q 5 B Ƶ s 1 δ e ρ δ M Ƶ * s δ s Q 5 B Ƶ s δ s ,
V ˙ 3 B Ƶ s = ρ s δ s s f * Ƶ κ e ρ s κ Q 6 B f Ƶ κ d κ + f * Ƶ s Q 6 B f Ƶ s 1 δ ˙ s f * Ƶ s δ s e ρ δ s Q 6 B f Ƶ s δ s ρ s δ s s f * Ƶ κ e ρ s κ Q 6 B f Ƶ κ d κ + f * Ƶ s Q 6 B f Ƶ s 1 δ e ρ δ M f * Ƶ s δ s Q 6 B f Ƶ s δ s ,
V ˙ 4 B Ƶ s = ρ s ϱ s s Ƶ ˙ * κ e ρ s κ Q 7 B Ƶ ˙ κ d κ + Ƶ ˙ * s Q 7 B Ƶ ˙ s 1 ϱ ˙ s Ƶ ˙ * s ϱ s e ρ ϱ s Q 7 B Ƶ ˙ s ϱ s ρ s ϱ s s Ƶ ˙ * κ e ρ s κ Q 7 B Ƶ ˙ κ d κ + Ƶ ˙ * s Q 7 B Ƶ ˙ s 1 ϱ e ρ ϱ M Ƶ ˙ * s ϱ s Q 7 B Ƶ ˙ s ϱ s ,
V ˙ 5 B Ƶ s = ρ δ M δ m s + θ s Ƶ ˙ * κ e ρ s κ Q 8 B Ƶ ˙ κ d κ d θ + δ M δ m Ƶ ˙ * s Q 8 B Ƶ ˙ s Ƶ ˙ * s + θ e ρ θ Q 8 B Ƶ ˙ s + θ d θ = ρ δ M δ m s + θ s Ƶ ˙ * κ e ρ s κ Q 8 B Ƶ ˙ κ d κ d θ + δ M δ m Ƶ ˙ * s Q 8 B Ƶ ˙ s δ M δ m Ƶ ˙ * s + θ e ρ θ Q 8 B Ƶ ˙ s + θ d θ ρ δ M δ m s + θ s Ƶ ˙ * κ e ρ s κ Q 8 B Ƶ ˙ κ d κ d θ + δ M δ m Ƶ ˙ * s Q 8 B Ƶ ˙ s e ρ δ M s δ M s δ m Ƶ ˙ * κ Q 8 B Ƶ ˙ κ d κ ρ δ M δ m s + θ s Ƶ ˙ * κ e ρ s κ Q 8 B Ƶ ˙ κ d κ d θ + δ M δ m Ƶ ˙ * s Q 8 B Ƶ ˙ s + e ρ δ M 1 δ M δ m Ƶ * s δ m Ƶ * s δ M 1 δ M δ m s δ M s δ m q * κ d κ × 4 Q 8 B 2 Q 8 B 6 Q 8 B 2 Q 8 B * 4 Q 8 B 6 Q 8 B 6 Q 8 B * 6 Q 8 B * 12 Q 8 B Ƶ t δ m Ƶ s δ M 1 δ M δ m s δ M s δ m Ƶ * κ d κ .
For any matrix M 4 B , M 5 B a n d M 6 B , the following equation holds:
0 = Ƶ * s Ƶ ˙ * s Ƶ ˙ * s ϱ s M 4 B M 5 B M 6 B × Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s + Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * × M 4 B * M 5 B * M 6 B * Ƶ s Ƶ ˙ s Ƶ ˙ s ϱ s .
Under Assumption 2, there exist L 2 B > 0 and L 3 B > 0 , which leads to the following inequalities
Ƶ * s L 2 B * R 2 B L 2 B Ƶ s f * Ƶ s R 2 B f Ƶ s 0 ,
Ƶ * s δ s L 3 B * R 3 B L 3 B Ƶ s δ s f * Ƶ s δ s R 3 B f Ƶ s δ s 0 .
By (18)–(26), one can get
V ˙ B Ƶ s + ρ V B Ƶ s = V ˙ 1 B Ƶ s + V ˙ 2 B Ƶ s + V ˙ 3 B Ƶ s + V ˙ 4 B Ƶ s + V ˙ 5 B Ƶ s + ρ V B Ƶ s ρ Ƶ * s P 1 B Ƶ s + Ƶ * s A B * P 1 B Ƶ s + f * Ƶ s B B * P 1 B Ƶ s + f * Ƶ s δ s C B * P 1 B Ƶ s + Ƶ ˙ * s ϱ s D B * P 1 B Ƶ s + Ƶ * s P 1 B * A B Ƶ s + Ƶ * s P 1 B * B B f Ƶ s + Ƶ * s P 1 B * C B f Ƶ s δ s + Ƶ * s P 1 B * D B Ƶ ˙ s ϱ s + Ƶ * s Q 5 B Ƶ s 1 δ e ρ δ M Ƶ * s ϱ s Q 5 B Ƶ s δ s + f * Ƶ s Q 6 B f Ƶ s 1 δ e ρ δ M f * Ƶ s δ s Q 6 B f Ƶ s δ s + Ƶ ˙ * s Q 7 B Ƶ ˙ s 1 ϱ e ρ ϱ M Ƶ ˙ * s ϱ s Q 7 B Ƶ ˙ s ϱ s + δ M δ m Ƶ ˙ * s Q 8 B Ƶ ˙ s + e ρ δ M 1 δ M δ m Ƶ * s δ m Ƶ * s δ M 1 δ M δ m s δ M s δ m Ƶ * κ d κ × 4 Q 8 B 2 Q 8 B 6 Q 8 B 2 Q 8 B * 4 Q 8 B 6 Q 8 B 6 Q 8 B * 6 Q 8 B * 12 Q 8 B Ƶ s δ m Ƶ s δ M 1 δ M δ m s δ M s δ m Ƶ * κ d κ + Ƶ * s Ƶ ˙ * s Ƶ ˙ * s ϱ s M 4 B M 5 B M 6 B × Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s + Ƶ ˙ s A B Ƶ s + B B f Ƶ s + C B f Ƶ s δ s + D B Ƶ ˙ s ϱ s * × M 4 B * M 5 B * M 6 B * Ƶ s Ƶ ˙ s Ƶ ˙ s ϱ s + Ƶ * s L 2 B * R 2 B L 2 B Ƶ s f * Ƶ s R 2 B f Ƶ s + Ƶ * s δ s L 3 B * R 3 B L 3 B Ƶ s δ s f * Ƶ s δ s R 3 B f Ƶ s δ s = ϖ * s Ψ B ϖ s ,
where
ϖ s = Ƶ * s , Ƶ ˙ * s , Ƶ * s δ s , Ƶ * s δ m , Ƶ * s δ M , Ƶ ˙ * s ϱ s , f * Ƶ s , f * Ƶ s δ s , 1 δ M δ m s δ M s δ m Ƶ * κ d κ * .
From (17), it follows that
V ˙ s Ƶ s + ρ V s Ƶ s 0 ,
the GES of system (3) is obtained, and the proof is complete. □
Remark 3.
There are few studies in the literature considering the GES of QVSNNs, with most discussing the GES of QVNNs [39,40] or SNNs [41,42], so Theorem 2 gives the GES of QVNNs. We use the Wirtinger-based inequality methodology to handle the quadratic terms in Theorem 2, which gives even tighter lower bounds. Also, in dealing with time-varying delays, we require that the lower bounds δ m and ϱ m for δ s and ϱ s are strictly greater than zero, which makes our proof more accurate.

3.3. State Decay Estimate

To combine the quaternion and the SNNs further, the switching condition for the average dwell time is added here. The state decay estimation can verify the feasibility of the above theoretical conditions by giving specific convergence rates based on the fact that the system is GES. Therefore, the proof procedure for the state decay estimation of system (3) under the condition that the average dwell time is satisfied is given below.

Switching Condition

For given constant ρ > 0 , ε 1 , let the average dwell time satisfy the following conditions:
S a > S a = ln ε ρ .
Theorem 3.
The state decay estimate for system (3) is given below:
Ƶ s α β e μ s s 0 Ƶ s 0 ,
where
μ = 1 2 ρ l n ε S a ,
β = m i n B Z λ m i n P 1 B ,
α = m a x B Z λ m a x P 1 B + δ M m a x B Z λ m a x Q 5 B + δ M m a x B Z λ m a x Q 6 B + ϱ M m a x B Z λ m a x Q 7 B + δ M 2 2 m a x B Z λ m a x Q 8 B .
Proof. 
For s s m , s m + 1 , application of (28) leads to the following inequality:
V s Ƶ s e ρ s s m V s m Ƶ s m .
From (16) and (18), when s = s m , the system switches from the B th subsystem to the A th subsystem without a jump in state, and the following inequality holds
V s m Ƶ s m ε V s m Ƶ s m .
From (34) and (35), one can get
V s Ƶ s e ρ s s m ε V s m Ƶ s m e ρ s s m ε e ρ s m s m 1 V s m 1 Ƶ s m 1 = e ρ s s m 1 ε V s m 1 Ƶ s m 1 e ρ s s m 1 ε 2 V s m 1 Ƶ s m 1 e ρ s s m 2 ε 2 V s m 2 s s m 2 e ρ s s 0 ε m V s 0 Ƶ s 0 ,
Combining the switching conditions, we can know that m s s 0 S a ; therefore, the following inequality holds:
V s Ƶ s e ρ s s 0 e m l n ε V s 0 Ƶ s 0 e ρ l n ε S a s s 0 V s 0 Ƶ s 0 .
Combining (30)–(33) and (18) yields the following inequality:
β Ƶ s 2 V s Ƶ s , V s 0 Ƶ s 0 α Ƶ s 0 2 .
Combining (37) and (38), the following inequality holds:
Ƶ s 2 1 β V s Ƶ s α β e ρ l n ε S a s s 0 Ƶ s 0 2 .
Then, system (3) is GES when the switching signals t satisfy the switching condition. The state decay estimation proof of system (3) is complete. □
Corollary 1.
Under Assumptions 1–4, for constants ρ > 0 , ε = 1 , if there exist symmetric matrices P 1 > 0 , Q 5 > 0 , Q 6 > 0 , Q 7 > 0 , Q 8 > 0 , R 2 B > 0 a n d R 3 B > 0 R n × n , we have any matrix M 4 B , M 5 B and M 6 B R n × n , guaranteeing the feasibility of the following LMIs:
P 1 B = ε P 1 A , Q 5 B = ε Q 5 A , Q 6 B = ε Q 6 A , Q 7 B = ε Q 7 A , Q 8 B = ε Q 8 A , B = A Z ,
Ξ B = Ξ 11 B Ξ 12 B 0 0 0 Ξ 16 B Ξ 17 B Ξ 18 B 0 * Ξ 22 B 0 0 0 Ξ 26 B M 5 B B B M 5 B C B 0 * * Ξ 33 B 0 0 0 0 0 0 * * * Ξ 44 B Ξ 45 B 0 0 0 Ξ 49 B * * * * Ξ 55 B 0 0 0 Ξ 59 B * * * * * Ξ 66 B M 6 B B B M 6 B B B 0 * * * * * * Ξ 77 B 0 0 * * * * * * * Ξ 88 B 0 * * * * * * * * Ξ 99 B < 0 ,
with
Ξ 11 B = ρ P 1 A B * P 1 P 1 * A B + Q 5 + L 2 B * R 2 B L 2 B M 4 B A B A B * M 4 B * , Ξ 12 B = M 4 B A B * M 5 B * , Ξ 16 B = P 1 * D B + M 4 B D B A B * M 6 B * , Ξ 17 B = P 1 * B B + M 4 B B B , Ξ 18 B = P 1 * C B + M 4 B C B , Ξ 22 B = Q 7 + δ M δ m Q 8 M 5 B M 5 B * , Ξ 26 B = M 5 B D B M 6 B * , Ξ 33 B = 1 δ e ρ δ M Q 5 + L 3 B * R 3 B L 3 B , Ξ 44 B = 4 e ρ δ M δ M δ m Q 8 , Ξ 45 B = 2 e ρ δ M δ M δ m Q 8 , Ξ 49 B = 6 e ρ δ M δ M δ m Q 8 , Ξ 55 B = 4 e ρ δ M δ M δ m Q 8 , Ξ 59 B = 6 e ρ δ M δ M δ m Q 8 , Ξ 66 B = 1 ϱ e ρ ϱ M Q 7 B + M 6 B D B + D B * M 6 B * , Ξ 77 B = Q 6 R 2 B , Ξ 88 B = 1 δ e ρ δ M Q 6 R 3 B , Ξ 99 B = 12 e ρ δ M δ M δ m Q 8 .
Then, system (3) is GES at the origin. The state decay estimate for the system is given below
Ƶ s α ˜ β ˜ e μ s s 0 Ƶ s 0 ,
with
β ˜ = λ m i n P ,
α ˜ = λ m a x P + δ M λ m a x Q 5 + δ M λ m a x Q 6 + ϱ M λ m a x Q 7 + δ M 2 2 λ m a x Q 8 .
The proof of Corollary 1 proceeds similarly to Theorem 2, and the proof will not be repeated here.
Remark 4.
Corollary 1 is a particular example when the parameter ε takes a particular value (i.e., ε = 1). When ε = 1, the system shows a unique stability characteristic: it maintains GES for any form of switching signal. This greatly reduces the conservatism of the system compared to other studies in the literature [43], where systems are stabilized only under multiple conditions.

4. Numerical Example

The effective and practical applicability of the proposed method is demonstrated by two comprehensive numerical calculations.
Example 1.
Consider the following GAS of system (3) with two subsystems.
The parameter matrix for subsystem 1 is given below:
A 1 = 5 0 0 5 ; B 1 = 0.3 0.2 ξ 1 0.2 ξ 2 + 0.2 ξ 3 0.2 + 0.2 ξ 1 0.2 ξ 2 0.2 ξ 3 0.2 0.2 ξ 1 + 0.2 ξ 2 0.2 ξ 3 0.3 + 0.2 ξ 1 0.2 ξ 2 + 0.2 ξ 3 ; C 1 = 0.2 0.3 ξ 1 + 0.2 ξ 2 j + 0.3 ξ 3 0.3 + 0.2 ξ 1 + 0.3 ξ 2 0.1 ξ 3 0.2 + 0.4 ξ 1 0.3 ξ 2 0.3 ξ 3 0.2 + 0.3 ξ 1 + 0.4 ξ 2 + 0.3 ξ 3 ; D 1 = 0.1 + 0.1 ξ 1 + 0.1 ξ 2 0.1 ξ 3 0.1 + 0.1 ξ 1 0.1 ξ 2 0.1 ξ 3 0.1 0.1 ξ 1 + 0.1 ξ 2 0.1 ξ 3 0.1 + 0.1 ξ 1 0.1 ξ 2 + 0.1 ξ 3 .
The parameter matrix for subsystem 2 is given below:
A 2 = 4 0 0 4 ; B 2 = 0.4 0.3 ξ 1 0.5 Υ 2 + 0.2 ξ 3 0.2 + 0.4 ξ 1 0.3 ξ 2 0.3 ξ 3 0.4 0.5 ξ 1 + 0.2 ξ 2 0.2 ξ 3 0.3 + 0.2 ξ 1 0.1 ξ 2 + 0.4 ξ 3 ; C 2 = 0.3 0.2 ξ 1 + 0.1 ξ 2 + 0.1 ξ 3 0.2 + 0.3 ξ 1 + 0.1 ξ 2 0.2 ξ 3 0.4 + 0.2 ξ 1 0.1 ξ 2 0.2 ξ 3 0.2 + 0.3 ξ 1 + 0.1 ξ 2 + 0.3 ξ 3 ; D 2 = 0.12 + 0.12 ξ 1 + 0.12 v 2 0.12 ξ 3 0.12 + 0.12 ξ 1 0.12 ξ 2 0.12 ξ 3 0.12 0.12 ξ 1 + 0.12 ξ 2 0.12 ξ 3 0.12 + 0.12 ξ 1 0.12 ξ 2 + 0.12 ξ 3 .
The remaining parameters of the system are given below:
f Ƶ s = 0.18 t a n h Ƶ s ; δ s = 0.45 + 0.35 s i n s ; ϱ s = 0.55 + 0.15 s i n s ; δ = 0.6 ; ϱ = 0.7 ; δ m = 0.1 ; δ M = 0.8 ; ϱ m = 0.4 , ϱ M = 0.7 ; L 1 = 0.9 0 0 0.9 .
Applying Theorem 1 and the Matlab toolbox to inequality (4) yields the following feasible solutions.
Feasible solutions for subsystem 1:
P 1 = 67.6113 0 0 67.6113 ; Q 11 = 36.1458 0 0 36.1458 ; Q 21 = 70.6581 0 0 70.6581 ; Q 31 = 9.2745 0 0 9.2745 ; Q 41 = 3.9145 0 0 3.9145 ; R 11 = 105.1029 0 0 105.1029 ; M 11 = 52.2140 0.1648 0.1648 52.1176 ; M 21 = 12.5034 0.2328 0.2328 12.6901 ; M 31 = 0.1261 0.3657 0.3657 0.3097 ;
Feasible solutions for subsystem 2:
P 2 = 44.0816 0 0 44.0816 ; Q 12 = 22.7387 0 0 22.7387 ; Q 22 = 71.0550 0 0 71.0550 ; Q 32 = 9.0316 0 0 9.0316 ; Q 42 = 1.5457 0 0 1.5457 ; R 12 = 128.5438 0 0 128.5438 ; M 12 = 20.8403 0.7058 0.7058 21.9136 ; M 22 = 9.9510 0.3282 0.3282 9.5897 ; M 32 = 0.2783 0.5985 0.5985 0.6493 ;
The trend plot of the state variables over time for system (3) with the above parameters is given below:
Remark 5.
In Figure 2, Ƶ ξ 0 ( s ) , Ƶ ξ 1 , ( s ) , Ƶ ξ 2 ( s ) , Ƶ ξ 3 ( s ) are denoted by x r t , x i t , x j t , x k t , respectively. From the above image, it can be seen that the system is divided into four parts, and under any switching law, the trajectories of the state variables gradually converge to a fixed point over time, verifying the effectiveness of the results obtained.
Example 2.
Consider the GES of the following system (3) with two subsystems.
The parameter matrix for subsystem 1 is given below:
A 1 = 3.5 0 0 3.5 ; B 1 = 0.35 0.25 ξ 1 0.25 ξ 2 + 0.25 ξ 3 0.25 + 0.25 ξ 1 0.25 ξ 2 0.25 ξ 3 0.25 0.25 ξ 1 + 0.25 ξ 2 0.25 ξ 3 0.35 + 0.25 ξ 1 0.25 ξ 2 + 0.25 ξ 3 ; C 1 = 0.25 0.35 ξ 1 + 0.25 ξ 2 + 0.35 ξ 3 0.35 + 0.25 ξ 1 + 0.35 ξ 2 0.15 ξ 3 0.25 + 0.45 ξ 1 0.35 ξ 2 0.35 ξ 3 0.25 + 0.35 ξ 1 + 0.45 ξ 2 + 0.35 ξ 3 ; D 1 = 0.15 + 0.15 ξ 1 + 0.15 ξ 2 0.15 ξ 3 0.1 + 0.15 ξ 1 0.15 ξ 2 0.15 ξ 3 0.15 0.15 ξ 1 + 0.15 ξ 2 0.15 ξ 3 0.15 + 0.15 ξ 1 0.15 ξ 2 + 0.15 ξ 3 .
The parameter matrix for subsystem 2 is given below:
A 2 = 4.5 0 0 4.5 ; B 2 = 0.45 0.35 ξ 1 0.55 ξ 2 + 0.25 ξ 3 0.25 + 0.45 ξ 1 0.35 ξ 2 0.35 ξ 3 0.45 0.55 ξ 1 + 0.25 ξ 2 0.25 ξ 3 0.35 + 0.25 ξ 1 0.15 ξ 2 + 0.45 ξ 3 ; C 2 = 0.35 0.25 ξ 1 + 0.15 ξ 2 + 0.15 ξ 3 0.25 + 0.35 ξ 1 + 0.15 ξ 2 0.25 ξ 3 0.45 + 0.25 ξ 1 0.15 ξ 2 0.25 ξ 3 0.25 + 0.35 ξ 1 + 0.15 ξ 2 + 0.35 ξ 3 ; D 2 = 0.1 + 0.1 ξ 1 + 0.1 ξ 2 0.1 ξ 3 0.1 + 0.1 ξ 1 0.1 ξ 2 0.1 ξ 3 0.1 0.1 ξ 1 + 0.1 ξ 2 0.1 ξ 3 0.1 + 0.1 v 1 0.1 ξ 2 + 0.1 ξ 3 .
The remaining parameters of the system are given below:
f Ƶ s = 0.18 t a n h Ƶ s ; δ s = 1.25 + 0.75 s i n s ; ϱ s = 0.75 + 0.35 s i n s ; L 2 = 0.3 0 0 0.3 ; L 3 = 0.5 0 0 0.5 ; ε = 1.1 ; ρ = 0.8 ; δ = 0.8 ; ϱ = 0.5 ; δ M = 2 ; δ m = 0.5 ; ϱ M = 1.1 ; ϱ m = 0.4 .
Applying Theorem 2 and the Matlab toolbox to inequality (16) yields the following feasible solutions.
Feasible solutions for subsystem 1:
P 1 = 1.1007 0 0 1.1007 ; Q 51 = 1.2674 0 0 1.2674 ; Q 61 = 2.0343 0 0 2.0343 ; Q 71 = 2.9556 0 0 2.9556 ; Q 81 = 2.2358 0 0 2.2358 ; R 21 = 2.9633 0 0 2.9633 ;
R 31 = 8.0982 0 0 8.0982 ; M 41 = 1.5591 1.8255 1.8255 5.1721 ; M 51 = 3.5254 5.0599 5.0599 3.2349 ; M 61 = 4.7688 1.7046 1.7046 1.8366 ;
Feasible solutions for subsystem 2:
P 2 = 5.2007 0 0 5.2007 ; Q 52 = 1.0076 0 0 1.0076 ; Q 62 = 5.4335 0 0 5.4335 ; Q 72 = 1.1161 0 0 1.1161 ; Q 82 = 3.2796 0 0 3.2796 ; R 22 = 7.9832 0 0 7.9832 ; R 32 = 1.2764 0 0 1.2764 ; M 42 = 3.4542 3.2056 3.2056 3.5822 ; M 52 = 1.1603 7.1776 7.1776 1.1593 ; M 62 = 2.1826 1.5615 1.5615 1.0790 ;
By Theorem 2, system (3) with all the above parameters is GES. From switching condition, we know that S a > S a = l n ε ρ = 0.1191 ; thus, there is the option of S a = 0.3 > S a . By means of (31)–(33), one obtains μ = 0.2809 , β = 1.1007 , α = 28.4129 , and then, we can obtain the state decay estimate for system (3) with the above parameters as follows:
Ƶ s 5.0810 e 0.2809 s s 0 Ƶ s 0 .
The switching sequence diagram is as follows:
In this paper, we consider time-dependent switching. Thus, given a time sequence, switching takes palce at a specified point in time.
A trend plot of the state variables over time for system (3) with the above parameters is given below:
Remark 6.
Figure 4 has the same parameter representation as Figure 2. Combining Figure 3 and Figure 4, it can be seen that even though the switching node is given to allow the system to switch, it does not affect the result that the system eventually stabilizes. It can also be observed from Figure 4 that the system is divided into four parts, all of which eventually converge to stability, verifying the effectiveness of the results obtained.
Remark 7.
Most of the current studies on quaternion-valued neural networks [11,12,13,14] do not consider switching, and studies on switching neural networks [28,30,31,32] do not consider quaternions. Therefore, we try to combine quaternion and switching neural networks by using an undecomposed approach to deal with quaternions while considering both state time-varying time delay and neutral-type time-varying time delay. The activation function we use here is tanh, which is difficult to decompose.

5. Conclusions

This paper investigated the issues of GAS and GES for QVSNNs that simultaneously possess state time-varying delays and neutral-type time-varying delays. An appropriate Lyapunov–Krasovskii functional was proposed, guided by the fundamentals of Lyapunov theorem. The integral quaternion method and the average dwell time method are employed, and by utilizing Wirtinger-based inequality and LMI, combining the theoretical derivation process, it was shown that the considered system is GAS and GES. Additionally, the state decay estimation of the system and a specific case have been provided. Finally, the effective and practical applicability of the proposed method was demonstrated by two comprehensive numerical calculations. Considering that the activation weights of each subsystem vary, the switching probabilities are of paramount importance. Future research efforts will focus on switching probabilities, aiming to overcome this challenging issue.

Author Contributions

Conceptualization, Y.D. and T.P.; methodology, Y.D.; validation, Y.D., T.P., and Z.T.; formal analysis, H.D. and W.T.; investigation, H.D.; resources, T.P. and Z.T.; data curation, Y.D. and W.T.; writing—original draft preparation, Y.D.; writing—review and editing, Y.D. and T.P.; visualization, Y.D.; supervision, Z.T.; project administration, T.P.; funding acquisition, T.P. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Natural Science Foundation Project of Chongqing, China, under Grant No. CSTB2022NSCQ-MSX0393; in part by the Science and Technology Research Program of Chongqing Municipal Education Commission, China, under Grant Nos. KJZD-M202301202 and KJZD-K202201202; and in part by the Rural Revitalization Special Project of Chongqing Science and Technology Bureau, China, under Grant No. CSTB2023T-IADZXX0017.

Data Availability Statement

All data are available in the paper.

Acknowledgments

During the preparation of this manuscript/study, the authors used Matlab 2020a for the purposes of numerical simulation. The authors have reviewed and edited the publication and take full responsibility for its contents.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
QVNNsQuaternion-valued neural networks
QVSNNsQuaternion-valued switching neural networks
GASGlobal asymptotic stability
GESGlobal exponential stability

References

  1. Zou, A.M.; Kumar, K.D.; Hou, Z.G. Quaternion-based adaptive output feedback attitude control of spacecraft using Chebyshev neural networks. IEEE Trans. Neural Netw. 2010, 21, 1457–1471. [Google Scholar] [PubMed]
  2. Rochefort, D.; De Lafontaine, J.; Brunet, C.A. A new satellite attitude state estimation algorithm using quaternion neural networks. In Proceedings of the AIAA Guidance, Navigation, and Control Conference and Exhibit, San Francisco, CA, USA, 15–18 August 2005; p. 6447. [Google Scholar]
  3. Song, Q.; Wu, Q.; Liu, Y. Stabilization of chaotic quaternion-valued neutral-type neural networks via sampled-data control with two-sided looped functional approach. Nonlinear Anal. Model. Control 2024, 29, 1150–1166. [Google Scholar] [CrossRef]
  4. Peng, T.; Wu, Y.; Tu, Z.; Alofi, A.; Lu, J. Fixed-time and prescribed-time synchronization of quaternion-valued neural networks: A control strategy involving Lyapunov functions. Neural Netw. 2023, 160, 108–121. [Google Scholar] [CrossRef]
  5. Takahashi, K. Remarks on quaternion neural networks with application to trajectory control of a robot manipulator. In Proceedings of the 2019 Australian & New Zealand Control Conference (ANZCC), Auckland, New Zealand, 27–29 November 2019; pp. 116–121. [Google Scholar]
  6. Altamirano-Gomez, G.; Gershenson, C. Quaternion Convolutional Neural Networks: Current Advances and Future Directions. Adv. Appl. Clifford Algebr. 2024, 34, 42. [Google Scholar] [CrossRef]
  7. Miao, J.; Kou, K.I.; Yang, Y.; Yang, L.; Han, J. Quaternion matrix completion using untrained quaternion convolutional neural network for color image inpainting. Signal Process. 2024, 221, 109504. [Google Scholar] [CrossRef]
  8. Zhou, H.; Zhang, X.; Zhang, C.; Ma, Q. Quaternion convolutional neural networks for hyperspectral image classification. Eng. Appl. Artif. Intell. 2023, 123, 106234. [Google Scholar] [CrossRef]
  9. Kumar, S.; Rastogi, U. A comprehensive review on the advancement of high-dimensional neural networks in quaternionic domain with relevant applications. Arch. Comput. Methods Eng. 2023, 30, 3941–3968. [Google Scholar] [CrossRef]
  10. Hirose, A.; Shang, F.; Otsuka, Y.; Natsuaki, R.; Matsumoto, Y.; Usami, N.; Song, Y.; Chen, H. Quaternion Neural Networks: A physics-incorporated intelligence framework [Hypercomplex Signal and Image Processing]. IEEE Signal Process. Mag. 2024, 41, 88–100. [Google Scholar] [CrossRef]
  11. Wang, H.; Tan, J.; Wen, S. Exponential stability analysis of mixed delayed quaternion-valued neural networks via decomposed approach. IEEE Access 2020, 8, 91501–91509. [Google Scholar] [CrossRef]
  12. Humphries, U.; Rajchakit, G.; Kaewmesri, P.; Chanthorn, P.; Sriraman, R.; Samidurai, R.; Lim, C.P. Stochastic memristive quaternion-valued neural networks with time delays: An analysis on mean square exponential input-to-state stability. Mathematics 2020, 8, 815. [Google Scholar] [CrossRef]
  13. Yang, X.; Li, C.; Song, Q.; Li, H.; Huang, J. Effects of state-dependent impulses on robust exponential stability of quaternion-valued neural networks under parametric uncertainty. IEEE Trans. Neural Netw. Learn. Syst. 2018, 30, 2197–2211. [Google Scholar] [CrossRef] [PubMed]
  14. Shu, J.; Wu, B.; Xiong, L. Stochastic stability criteria and event-triggered control of delayed Markovian jump quaternion-valued neural networks. Appl. Math. Comput. 2022, 420, 126904. [Google Scholar] [CrossRef]
  15. Chen, X.; Li, Z.; Song, Q.; Hu, J.; Tan, Y. Robust stability analysis of quaternion-valued neural networks with time delays and parameter uncertainties. Neural Netw. 2017, 91, 55–65. [Google Scholar] [CrossRef]
  16. Song, Q.; Chen, Y.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Robust stability of fractional-order quaternion-valued neural networks with neutral delays and parameter uncertainties. Neurocomputing 2021, 420, 70–81. [Google Scholar] [CrossRef]
  17. You, X.; Song, Q.; Liang, J.; Liu, Y.; Alsaadi, F.E. Global μ-stability of quaternion-valued neural networks with mixed time-varying delays. Neurocomputing 2018, 290, 12–25. [Google Scholar] [CrossRef]
  18. Wu, L.; Feng, Z.; Lam, J. Stability and synchronization of discrete-time neural networks with switching parameters and time-varying delays. IEEE Trans. Neural Netw. Learn. Syst. 2013, 24, 1957–1972. [Google Scholar] [CrossRef]
  19. Shen, W.; Zeng, Z.; Wang, L. Stability analysis for uncertain switched neural networks with time-varying delay. Neural Netw. 2016, 83, 32–41. [Google Scholar] [CrossRef]
  20. Liu, C.; Yang, Z.; Sun, D.; Liu, X.; Liu, W. Stability of switched neural networks with time-varying delays. Neural Comput. Appl. 2018, 30, 2229–2244. [Google Scholar] [CrossRef]
  21. Tu, Z.; Zhao, Y.; Ding, N.; Feng, Y.; Zhang, W. Stability analysis of quaternion-valued neural networks with both discrete and distributed delays. Appl. Math. Comput. 2019, 343, 342–353. [Google Scholar] [CrossRef]
  22. Wang, Y.; Niu, B.; Wang, H.; Alotaibi, N.; Abozinadah, E. Neural network-based adaptive tracking control for switched nonlinear systems with prescribed performance: An average dwell time switching approach. Neurocomputing 2021, 435, 295–306. [Google Scholar] [CrossRef]
  23. Yang, X.; Liu, Y.; Cao, J.; Rutkowski, L. Synchronization of coupled time-delay neural networks with mode-dependent average dwell time switching. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 5483–5496. [Google Scholar] [CrossRef] [PubMed]
  24. Sun, J.; Han, J.; Liu, P.; Wang, Y. Memristor-based neural network circuit of pavlov associative memory with dual mode switching. AEU-Int. J. Electron. Commun. 2021, 129, 153552. [Google Scholar] [CrossRef]
  25. Chen, Z.; Niu, B.; Zhang, L.; Zhao, J.; Ahmad, A.M.; Alassafi, M.O. Command filtering-based adaptive neural network control for uncertain switched nonlinear systems using event-triggered communication. Int. J. Robust Nonlinear Control 2022, 32, 6507–6522. [Google Scholar] [CrossRef]
  26. Dong, Z.; Wang, X.; Zhang, X.; Hu, M.; Dinh, T.N. Global exponential synchronization of discrete-time high-order switched neural networks and its application to multi-channel audio encryption. Nonlinear Anal. Hybrid Syst. 2023, 47, 101291. [Google Scholar] [CrossRef]
  27. Wang, H.; Yang, X.; Xiang, Z.; Tang, R.; Ning, Q. Synchronization of switched neural networks via attacked mode-dependent event-triggered control and its application in image encryption. IEEE Trans. Cybern. 2022, 53, 5994–6003. [Google Scholar] [CrossRef]
  28. Bao, Y.; Zhang, Y.; Zhang, B. Resilient fixed-time stabilization of switched neural networks subjected to impulsive deception attacks. Neural Netw. 2023, 163, 312–326. [Google Scholar] [CrossRef] [PubMed]
  29. Guo, Z.; Liu, L.; Wang, J. Multistability of switched neural networks with piecewise linear activation functions under state-dependent switching. IEEE Trans. Neural Netw. Learn. Syst. 2018, 30, 2052–2066. [Google Scholar] [CrossRef]
  30. Jiao, T.; Park, J.H.; Zong, G.; Zhao, Y.; Du, Q. On stability analysis of random impulsive and switching neural networks. Neurocomputing 2019, 350, 146–154. [Google Scholar] [CrossRef]
  31. Yang, D.; Li, X. Robust stability analysis of stochastic switched neural networks with parameter uncertainties via state-dependent switching law. Neurocomputing 2021, 452, 813–819. [Google Scholar] [CrossRef]
  32. Wu, L.; Feng, Z.; Zheng, W.X. Exponential stability analysis for delayed neural networks with switching parameters: Average dwell time approach. IEEE Trans. Neural Netw. 2010, 21, 1396–1407. [Google Scholar]
  33. Tu, Z.; Yang, X.; Wang, L.; Ding, N. Stability and stabilization of quaternion-valued neural networks with uncertain time-delayed impulses: Direct quaternion method. Phys. A Stat. Mech. Its Appl. 2019, 535, 122358. [Google Scholar] [CrossRef]
  34. Zeng, H.B.; He, Y.; Wu, M.; Xiao, S.P. Stability analysis of generalized neural networks with time-varying delays via a new integral inequality. Neurocomputing 2015, 161, 148–154. [Google Scholar] [CrossRef]
  35. Chen, Z.W.; Yang, J.; Zhong, S.M. Delay-partitioning approach to stability analysis of generalized neural networks with time-varying delay via new integral inequality. Neurocomputing 2016, 191, 380–387. [Google Scholar] [CrossRef]
  36. Peng, T.; Qiu, J.; Lu, J.; Tu, Z.; Cao, J. Finite-time and fixed-time synchronization of quaternion-valued neural networks with/without mixed delays: An improved one-norm method. IEEE Trans. Neural Netw. Learn. Syst. 2021, 33, 7475–7487. [Google Scholar] [CrossRef]
  37. Syed Ali, M.; Hymavathi, M.; Saroha, S.; Krishna Moorthy, R. Global asymptotic stability of neutral type fractional-order memristor-based neural networks with leakage term, discrete and distributed delays. Math. Methods Appl. Sci. 2021, 44, 5953–5973. [Google Scholar] [CrossRef]
  38. Subramanian, K.; Muthukumar, P. Global asymptotic stability of complex-valued neural networks with additive time-varying delays. Cogn. Neurodynamics 2017, 11, 293–306. [Google Scholar] [CrossRef]
  39. Liu, Y.; Zhang, D.; Lu, J. Global exponential stability for quaternion-valued recurrent neural networks with time-varying delays. Nonlinear Dyn. 2017, 87, 553–565. [Google Scholar] [CrossRef]
  40. Xia, Y.; Chen, X.; Lin, D.; Li, B.; Yang, X. Global exponential stability analysis of commutative quaternion-valued neural networks with time delays on time scales. Neural Process. Lett. 2023, 55, 6339–6360. [Google Scholar] [CrossRef]
  41. Li, X.; Pal, N.R.; Li, H.; Huang, T. Intermittent event-triggered exponential stabilization for state-dependent switched fuzzy neural networks with mixed delays. IEEE Trans. Fuzzy Syst. 2021, 30, 3312–3321. [Google Scholar] [CrossRef]
  42. Zhan, T.; Ma, S.; Li, W.; Pedrycz, W. Exponential stability of fractional-order switched systems with mode-dependent impulses and its application. IEEE Trans. Cybern. 2021, 52, 11516–11525. [Google Scholar] [CrossRef]
  43. Xiao, H.; Zhu, Q.; Karimi, H.R. Stability of stochastic delay switched neural networks with all unstable subsystems: A multiple discretized Lyapunov-Krasovskii functionals method. Inf. Sci. 2022, 582, 302–315. [Google Scholar] [CrossRef]
Figure 1. Diagram of model (3).
Figure 1. Diagram of model (3).
Symmetry 17 00979 g001
Figure 2. Response curves over time for x r t , x i t , x j t , and x k t of system (3).
Figure 2. Response curves over time for x r t , x i t , x j t , and x k t of system (3).
Symmetry 17 00979 g002
Figure 3. Switching sequence diagrams.
Figure 3. Switching sequence diagrams.
Symmetry 17 00979 g003
Figure 4. Response curves over time for x r t , x i t , x j t , and x k t of system (3).
Figure 4. Response curves over time for x r t , x i t , x j t , and x k t of system (3).
Symmetry 17 00979 g004
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

Dong, Y.; Peng, T.; Tu, Z.; Duan, H.; Tan, W. Analysis of Stability of Delayed Quaternion-Valued Switching Neural Networks via Symmetric Matrices. Symmetry 2025, 17, 979. https://doi.org/10.3390/sym17070979

AMA Style

Dong Y, Peng T, Tu Z, Duan H, Tan W. Analysis of Stability of Delayed Quaternion-Valued Switching Neural Networks via Symmetric Matrices. Symmetry. 2025; 17(7):979. https://doi.org/10.3390/sym17070979

Chicago/Turabian Style

Dong, Yuan, Tao Peng, Zhengwen Tu, Huiling Duan, and Wei Tan. 2025. "Analysis of Stability of Delayed Quaternion-Valued Switching Neural Networks via Symmetric Matrices" Symmetry 17, no. 7: 979. https://doi.org/10.3390/sym17070979

APA Style

Dong, Y., Peng, T., Tu, Z., Duan, H., & Tan, W. (2025). Analysis of Stability of Delayed Quaternion-Valued Switching Neural Networks via Symmetric Matrices. Symmetry, 17(7), 979. https://doi.org/10.3390/sym17070979

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