Total positivity and dependence of order statistics

1.   Introduction

It is widely acknowledged that time-varying linear matrix equations (LMEs) solution is a key issue that is encountered in many domains ^[1,2,3,4], including robot manipulators ^[4], cell processors ^[3], control system architecture ^[2], and linear least squares regression ^[1]. In the past, academics have typically solved LMEs by the use of classical iterative methods ^[5]. However, time-invariant and real-valued LMEs are the only ones for which iterative approaches are appropriate. Due to their restricted computational capacity, only few studies have been produced to handle time-invariant or time-varying LMEs in the complex domain ^[6,7]. Therefore, iterative approaches are not the best option when tackling time-varying complex computing issues in real time.

In order to deal with time-varying tasks in real time, the zeroing neural network (ZNN) technique is introduced by Zhang et al. in ^[8]. ZNNs are a particular kind of recurrent neural networks that excel in parallel processing and their next acceptations were dynamic models for calculating the time-varying Moore-Penrose inverse in the real and complex domains ^[9,10,11,12]. They are now used to solve problems involving generalized inversion ^{[13,14,15,16,17,18]}, linear and quadratic programming ^[19,20,21], systems of nonlinear equations ^[22,23], and LMEs ^[7,24], among other issues. It is important to mention that ZNNs originated from the gradient neural network (or Hopfield network), whereas gradient neural networks are recently used to solve problems involving matrix inversion ^[25] and systems of nonlinear equations ^[26].

The issue of finding the minimum-norm least-squares solution of the time-varying quaternion LME (ML-TQ-LME) is addressed in this study. Hamilton first introduced quaternions, a non-commutative number system that expands on complex numbers, in 1843 ^[27]. They are useful for calculations requiring three-dimensional rotations in both theoretical and applied mathematics ^[28]. They are particularly important in several fields, including robotics ^[29,30], computer modeling ^[31,32], navigation ^[33], electromagnetism ^[34], quantum mechanics ^[35], and mathematical physics ^[36,37]. Recently, there has been increased interest in the study of time-varying quaternion (TQ) problems that involve matrices, including the inversion of TQ matrices ^[38], the solution of the dynamic TQ Sylvester matrix equation ^[39], the resolution of the TQ constrained matrix least-squares problem ^[40], and the resolution of the TQ linear matrix equation for square matrices ^[41]. Combining the quaternion and the time-varying LME can get the TQ LME. The TQ LME means that three elements in the equation are all quaternions, including two known quaternions and one unknown quaternion to be solved. By solving the ML-TQ-LME rather than the TQ LME, we are able to determine the minimum-norm least-squares solution of the TQ LMEs, which is particularly interesting when several solutions exist. Be aware that the solution provided by ML-TQ-LME always exists and is unique. Additionally, chaotic system synchronization ^[40], mobile manipulator control ^[38,42], kinematically redundant manipulator of robotic joints ^[30,43] and picture restoration ^[41,44] are real-world uses of TQ matrices. One thing unites all of these studies: they all use the ZNN technique to arrive at the solution.

In this paper, the ZNN technique is used to address the ML-TQ-LME problem. Particularly, two new ZNN models are developed inline with the designs presented in ^[45] to solve the ML-TQ-LME problem for TQ matrices of arbitrary dimension. The one model, named ZNNQ-G, is based on the gradient design and the other, named ZNNQ-D, on the direct design. Through two simulation experiments and two practical acoustic source tracking applications, the models' efficacy will be evaluated. It is significant to note that the results demonstrate the models' excellent functionality. Considering that since the TQ LMEs may be expanded to handle different types of matrix equations, the proposed models (i.e. ZNNQ-G and ZNNQ-D) can be extended to deal with other kinds of matrix equations, such as the static quaternion LME and the TQ inverse matrix equation. Last, by doing theoretical analysis and examining the computational complexity of each model that is described, this research study adds to the body of literature.

The major results of the paper are listed below.

(1) Two new ZNN models (i.e. ZNNQ-G and ZNNQ-D) for solving the ML-TQ-LME problem are presented.

(2) The suggested ZNNQ-G and ZNNQ-D models can be used with any TQ matrix.

(3) A theoretical investigation is conducted to support the models.

(4) To support the theoretical research, simulation experiments and practical acoustic source tracking applications are carried out.

The remainder of the paper is structured as follows. Section 2 presents preliminary information and the ML-TQ-LME problem. The ZNN model in line with gradient design is introduced in Section 3, while the ZNN model in line with is introduced in Section 4. It is important to note that the theoretical analysis and the computational complexity of the models are both included in Sections 3 and 4. Simulation experiments and applications to acoustic source tracking are presented in Section 5. Lastly, final thoughts and comments are provided in Section 6.

2.   Preliminary information and problem formulation

This part lays out some preliminary information about TQ matrices, the ML-TQ-LME issue, ZNNs and the notation that will be utilized throughout the remainder of the study along with the major results that will be covered.

A quaternion is a division algebra or skew-field over the real number field ^[46]. Let $\mathbb{H}$ be the set of quaternions, $\tilde{S}(t) = S_1(t)+S_2(t)\imath+S_3(t)\jmath+S_4(t)k\in\mathbb H^{m\times n}$ be a TQ matrix with coefficient matrices $S_i(t)\in\mathbb{R}^{m\times n}$ for $i = 1, 2, \cdots, 4$, and $t\in[0, t_f)\subseteq[0, +\infty)$ be the time. The conjugate transpose of $\tilde{S}(t)$ is the following ^[47]:

where $()^*$ is the conjugate transpose operator and $()^ {\mathrm T}$ is the transpose operator. Consider the TQ matrix $\tilde{B}(t)\in\mathbb H^{n\times g}$ with coefficient matrices $B_i(t)\in\mathbb{R}^{n\times g}$ for $i = 1, 2, \cdots, 4$. The product of $\tilde{S}(t)$ and $\tilde{B}(t)$ is as follows:

where the coefficient matrices $V_i(t)\in\mathbb{R}^{m\times g}$ for $i = 1, 2, \cdots, 4$ are the following:

Given that the quaternion foundations are covered, the ML-TQ-LME problem can be stated as follows:

in which $\tilde{X}(t)$ is the desired solution to the ML-TQ-LME problem.

Further, the ZNN technique will be used to address the ML-TQ-LME problem. Two main processes are normally involved in the construction of a ZNN model. The function of error matrix equation (EME) $E(t)$ must first be defined. Second, the following ZNN dynamical system must be employed:

where $( \dot)$ is the time derivative operator. On top of that, one can change the model's convergence rate by adjusting the parameter $\lambda > 0$, which is a positive real number. As an example, any ZNN model will converge even more quickly with a bigger value of $\lambda$ ^[48,49,50]. The ZNN's architecture is based on setting each element of $E(t)$ to 0, which is true as $t\rightarrow \infty$. This is accomplished using the continuous-time learning regulation that arises from the establishment of EME in (2.5). As a consequence, EME can be considered a tool for monitoring ZNN model learning.

For the remainder of this paper, the identity $g\times g$ matrix will be referred to as $I_g$ whereas the zero $g\times g$ and $m\times n$ matrices will be referred to as $\mathbf{0}_{g}$ and $\mathbf{0}_{m\times n}$, respectively. Moreover, the vectorization process will be denoted as $\mathrm{vec}(\cdot)$ and the Kronecker product will be denoted as $\otimes$. Last, $\left\lVert{\cdot}\right\rVert_ {\mathrm F}$ will denote the matrix Frobenius norm and $\beta\geq0$ is the Tikhonov regularization parameter. It is important to mention that the Tikhonov regularization parameter is frequently used to address singularity issues.

3.   Gradient ZNN model for solving the ML-TQ-LME

In this section we shall develop a ZNN model, named ZNNQ-G, in line with the gradient design presented in ^[45] to solve the ML-TQ-LME problem for TQ matrices of any dimension.

3.1.   The ZNNQ-G model

We suppose that $\tilde{B}(t)\in\mathbb{H}^{m\times g}$ when $m\geq n$, or $\tilde{B}(t)\in\mathbb{H}^{g\times n}$ when $n > m$, and $\tilde{A}(t)\in\mathbb{H}^{m\times n}$ are differentiable TQ matrices. The gradient approach converts the ML-TQ-LME problem of (2.4) into the following:

or equivalent,

where $\tilde{D}(t) = \tilde{A}^*(t)\tilde{A}(t)\in\mathbb{H}^{n\times n}$ and $\tilde{Q}(t) = \tilde{A}^*(t)\tilde{B}(t)\in\mathbb{H}^{n\times g}$ when $m\geq n$, otherwise $\tilde{D}(t) = \tilde{A}(t)\tilde{A}^*(t)\in\mathbb{H}^{m\times m}$ and $\tilde{Q}(t) = \tilde{B}(t)\tilde{A}^*(t)\in\mathbb{H}^{g\times m}$. It is important to note that $\tilde{X}(t)$ is the unknown TQ matrix to be found.

In line with (2.2) and (2.3), the following holds in the case of (3.2):

where $X_i(t)$ and $D_i(t)$ for $i = 1, \cdots, 4$ are the coefficient real matrices of $\tilde{X}(t)$ and $\tilde{D}(t)$, respectively. Then, setting

we convert the problem of (3.2) into the next problem:

Thereafter, we consider the next EME:

where its first derivative is:

The following is the outcome of addressing the ZNN dynamical system in terms of $\dot{Y}(t)$ when $E(t)$ and $\dot{E}(t)$ in (2.5) are substituted with $E^G(t)$ and $\dot{E}^G(t)$ defined in (3.6) and (3.7), respectively:

Thereafter, (3.8) may be made simpler with the use of vectorization and Kronecker product:

Furthermore, after setting:

we get at the next ZNN model:

where $G(t)$ is an invertible mass matrix. The suggested ZNN model to be employed in addressing the ML-TQ-LME problem of (2.4) is the dynamic model of (3.11), referred to as ZNNQ-G.

3.2.   ZNNQ-G model theoretical analysis

This section presents the ZNNQ-G (3.11) model's examination of convergence and stability.

Theorem 3.1. Let $W(t) \in \mathbb R^{4n\times g}$ and $Z(t) \in \mathbb R^{4n\times 4n}$ when $m\geq n$, and $W(t) \in \mathbb R^{g\times 4m}$ and $Z(t) \in \mathbb R^{4m\times 4m}$ when $n > m$. Also, suppose that $W(t)$ and $Z(t)$ are differentiable. Then, the system (3.8) converges to the theoretical solution (TSOL) $\hat{Y}(t)$ of the LME (3.5) and the solution is stable, in line with Lyapunov.

Proof. The replacement $\bar{Y}(t): = \hat{Y}(t)-Y(t)$ entails $Y(t) = \hat{Y}(t)-\bar{Y}(t)$, whereas $\hat{Y}(t)$ is the TSOL. The time-derivative of $Y(t)$ is $\dot{Y}(t) = \dot{\hat{Y}}(t)-\dot{\bar{Y}}(t)$. Note that

and its first derivative

Consequently, one can confirm the following after replacing $Y(t) = \hat{Y}(t)-\bar{Y}(t)$ with (3.6):

In addition, the dynamics of (2.5) yield

After that, we choose the following potential Lyapunov function to corroborate convergence:

The following identities can then be confirmed:

As a consequence, it holds

Due to the fact that $\bar{Y}(t)$ is the equilibrium point of (3.15) and $E^G(0) = 0$, the following holds:

We conclude that the equilibrium state $\bar{Y}(t) = \hat{Y}(t)-Y(t) = 0$ is stable in line with the Lyapunov stability theory. Thereafter, $Y(t)\rightarrow \hat{Y}(t)$ as $t\rightarrow \infty$.□

Theorem 3.2. Let $\tilde{B}(t)\in\mathbb{H}^{m\times g}$ when $m\geq n$, or $\tilde{B}(t)\in\mathbb{H}^{g\times n}$ when $n > m$, and $\tilde{A}(t)\in\mathbb{H}^{m\times n}$ be differentiable TQ matrices. At every $t\in[0, t_f)\subseteq[0, +\infty)$, the ZNNQ-G model (3.11) converges exponentially to the TSOL for every initial value $\mathbf{y}(0)$ that one may take into consideration.

Proof. First, the ML-TQ-LME problem of (2.4) is converted into the problem of (3.1), based on the gradient design presented in ^[45]. Second, using the matrices $\tilde{A}(t)$ and $\tilde{B}(t)$, we create the matrices $Z(t)$ and $W(t)$ in (3.4), where $W(t) \in \mathbb R^{4n\times g}$ and $Z(t) \in \mathbb R^{4n\times 4n}$ when $m\geq n$, and $W(t) \in \mathbb R^{g\times 4m}$ and $Z(t) \in \mathbb R^{4m\times 4m}$ when $n > m$. As a result, we convert the problem of (3.1) into the problem of (3.5). Third, to solve the problem of (3.5), the EME of (3.6) is declared. Then, for zeroing (3.6), the model (3.8) is deployed in line with the ZNN theme (2.5). According to Theorem 3.1, $Y(t)\rightarrow \hat{Y}(t)$ when $t\rightarrow \infty$ for any choice of initial value. So, the model (3.8) converges to the TSOL of the ML-TQ-LME (2.4). Fourth, the model (3.8) is simplified into the ZNNQ-G model (3.11) using the Kronecker product and vectorization. As an alternative version of (3.8), for every initial value $\mathbf{y}(0)$, the ZNNQ-G model (3.11) also converges to the TSOL $\mathbf{\hat{y}}(t)$ when $t\rightarrow \infty$. Thereafter, the proof is finished. □

3.3.   ZNNQ-G model computational complexity

The complexity of creating and addressing (3.11) adds to the ZNNQ-G's total computational complexity. Particularly, the computational complexity of creating (3.11) is $\mathcal{O}((4ng)^2)$ when $m\geq n$ operations and $\mathcal{O}((4mg)^2)$ operations when $n > m$ because at every iteration we conduct $(4ng)^2$ multiplications and $4ng$ additions/subtractions when $m\geq n$ and $(4mg)^2$ multiplications and $4mg$ additions/subtractions when $n > m$. On top of that, the implicit MATLAB solver ${\mathtt {ode15s}}$ is used to address at each step the linear system of equations. The complexity of addressing (3.11) is $\mathcal{O}((4ng)^3$ as it necessitates a $(4ng)\times (4ng)$ matrix when $m\geq n$, and $\mathcal{O}((4mg)^3$ as it necessitates a $(4mg)\times (4mg)$ matrix when $n > m$. So, the ZNNQ-G model's total computational complexity is $\mathcal{O}((4ng)^3)$ when $m\geq n$ and $\mathcal{O}((4mg)^3)$ when $n > m$.

4.   Direct ZNN model for solving the ML-TQ-LME

In this section we shall develop a ZNN model, named ZNNQ-D, in line with the direct design presented in ^[45] to solve the ML-TQ-LME problem for TQ matrices of any dimension.

4.1.   The ZNNQ-D model

We suppose that $\tilde{B}(t)\in\mathbb{H}^{m\times g}$ when $m\geq n$, or $\tilde{B}(t)\in\mathbb{H}^{g\times n}$ when $n > m$, and $\tilde{A}(t)\in\mathbb{H}^{m\times n}$ are differentiable TQ matrices. The direct approach converts the ML-TQ-LME problem of (2.4) into the following:

where $\tilde{X}(t)$ is the desired solution and $\tilde{A}^\dagger(t)$ is the Moore-Penrose inverse of $\tilde{A}(t)$. That is, the direct approach computes the solution generated directly by the Moore-Penrose inverse of $A(t)$. If $\tilde{A}^\dagger(t)$ is also thought of as an unknown $\tilde{C}(t)$, (4.1) can be rewritten as follows:

or equivalent,

where $\tilde{D}(t) = \tilde{A}^*(t)\tilde{A}(t)\in\mathbb{H}^{n\times n}$ when $m\geq n$, otherwise $\tilde{D}(t) = \tilde{A}(t)\tilde{A}^*(t)\in\mathbb{H}^{m\times m}$. It is crucial to note that $\tilde{C}(t)$ and $\tilde{X}(t)$ are both the unknown TQ matrices to be found.

According to (2.2), (2.3) and (2.1), the next system is satisfied in the case of (4.3):

where $X_i(t), C_i(t), D_i(t), A_i(t)$ and $B_i(t)$ for $i = 1, \cdots, 4$ are the coefficient real matrices of $\tilde{X}(t), \tilde{C}(t), \tilde{D}(t), \tilde{A}(t)$ and $\tilde{B}(t)$, respectively. Then, setting

we convert the problem of (4.3) into the next problem:

Thereafter, we consider the next EME:

where its first derivative is:

The following is the outcome of addressing the ZNN dynamical system in terms of $\dot{R}(t), \dot{L}(t)$ and $\dot{Y}(t)$ when $E(t)$ and $\dot{E}(t)$ in (2.5) are substituted with $E^D(t)$ and $\dot{E}^D(t)$ defined in (4.7) and (4.8), respectively:

Thereafter, (4.9) may be made simpler with the use of vectorization and Kronecker product:

It is significant to note that identical elements, but in different positions, can be found in the vectors $\mathrm{vec}(\dot{L}(t))$ and $\mathrm{vec}(\dot{R}(t))$. In other words, it is possible to further simplify (4.10) by rewriting the vector $\mathrm{vec}(\dot{L}(t))$ in terms of $\mathrm{vec}(\dot{R}(t))$. As a consequence, it is feasible to create the next equation that substitutes $\mathrm{vec}(\dot{L}(t))$ in (4.10):

where $J\in \mathbb{R}^{4mn\times 4mn}$ is an operational matrix that may be computed utilizing the algorithmic process presented in Algorithm 1. Notice that the notations in Algorithm 1 follow the usual MATLAB function theme ^[51].

By using (4.11), we can further simplify (4.10) as follows:

In addition, once the following has been set:

we get at the next ZNN model:

where $G(t)$ is an invertible mass matrix. The suggested ZNN model to be employed in addressing the ML-TQ-LME problem of (2.4) is the dynamic model of (4.14), referred to as ZNNQ-D.

4.2.   ZNNQ-D model theoretical analysis

This section presents the ZNNQ-D (4.14) model's examination of convergence and stability.

Theorem 4.1. Let $Z(t) \in \mathbb R^{4n\times 4n}$, $K(t) \in \mathbb R^{4m\times 4g}$, $L(t) \in \mathbb R^{4n\times m}$ and $W(t) \in \mathbb R^{4n\times m}$ when $m\geq n$, and $Z(t) \in \mathbb R^{4m\times 4m}$, $K(t) \in \mathbb R^{4g\times 4n}$, $L(t) \in \mathbb R^{n\times 4m}$ and $W(t) \in \mathbb R^{n\times 4m}$ when $n > m$. Also, suppose that $Z(t), K(t), W(t)$ and $L(t)$ are differentiable. Then, the system (4.9) converges to the TSOLs $\hat{L}(t)$ and $\hat{Y}(t)$ of the LMEs (4.6), and the solutions are stable, in line with Lyapunov.

Proof. The proof has been taken out since it resembles the proof of Theorem 3.1.□

Theorem 4.2. Let $\tilde{B}(t)\in\mathbb{H}^{m\times g}$ when $m\geq n$, or $\tilde{B}(t)\in\mathbb{H}^{g\times n}$ when $n > m$, and $\tilde{A}(t)\in\mathbb{H}^{m\times n}$ be differentiable TQ matrices. At every $t\in[0, t_f)\subseteq[0, +\infty)$, the ZNNQ-D model (4.14) model converges exponentially to the TSOL for any initial value $\mathbf{r}(0)$ that one may take into consideration.

Proof. The proof has been taken out since, if Theorem 3.1 is replaced with Theorem 4.1, it resembles the proof of Theorem 3.2.□

4.3.   ZNNQ-D model computational complexity

The complexity of creating and addressing (4.14) adds to the ZNNQ-D's total computational complexity. Particularly, the computational complexity of creating (4.14) is $\mathcal{O}((4n(m+g))^2)$ when $m\geq n$ operations and $\mathcal{O}((4m(n+g))^2)$ operations when $n > m$ because at every iteration we conduct $(4n(m+g))^2$ multiplications and $4n(m+g)$ additions/subtractions when $m\geq n$ and $(4m(n+g))^2$ multiplications and $4m(n+g)$ additions/subtractions when $n > m$. On top of that, the implicit MATLAB solver ${\mathtt {ode15s}}$ is used to address at each step the linear system of equations. The complexity of addressing (4.14) is $\mathcal{O}((4n(m+g))^3$ as it necessitates a $4n(m+g)\times 4n(m+g)$ matrix when $m\geq n$, and $\mathcal{O}((4m(n+g))^3$ as it necessitates a $4m(n+g)\times 4m(n+g)$ matrix when $n > m$. So, the ZNNQ-D model's total computational complexity is $\mathcal{O}((4n(m+g))^3)$ when $m\geq n$ and $\mathcal{O}((4m(n+g))^3)$ when $n > m$.

5.   Simulation experiments

This section will outline two applications for acoustic source tracking as well as two simulation examples (SEs). The following includes a few key justifications. The ZNN design parameter $\lambda$ is utilized with values $10$ and $100$ in SEs and with value $100$ in the applications. The initial conditions (ICs) of the ZNNQ-G and ZNNQ-D models have been set as follows:

● IC1: $\tilde{X}(0) = \mathbf{0}_{n\times g}$ when $m\geq n$, $\tilde{X}(0) = \mathbf{0}_{g\times m}$ when $n > m$, and $\tilde{C}(0) = \mathbf{0}_{n\times m}$.

● IC2: $\tilde{X}(0) = \tilde{A}^*(0)\tilde{B}(0)$ when $m\geq n$, and $\tilde{X}(0) = \tilde{B}(0)\tilde{A}^*(0)$ when $n > m$, and $\tilde{C}(0) = \tilde{A}^*(0)$.

The notation ML Error in the y-label of the figures corresponds to the following error:

For simplicity, we have set $\eta(t) = \cos(t)$ and $\zeta(t) = \sin(t)$. Lastly, in all SEs and applications, computations are performed using the MATLAB ode solver, ${\mathtt {ode15s}}$, with a time interval of $[0, 10]$. It is crucial to note that we utilize the ${\mathtt {ode15s}}$ with its standard double precision arithmetic ($eps = 2.22\cdot 10^{-16}$), which means that all of the errors in the figures of this section have a minimum value that is close to $10^{-5}$.

5.1.   Simulations

Example 5.1. In this SE, the input matrix $\tilde{A}(t)$ coefficients are set to

and the input matrix $\tilde{B}(t)$ coefficients are set to

As a result, $\tilde{A}(t)\in\mathbb H^{4\times 3}$ with $\mathrm{rank}({{\tilde{A}(t)}}) = 2$ and $\tilde{B}(t)\in\mathbb H^{4\times 2}$. Generated results are presented in Figure 1 and 2, where we have set $\beta = 10^{-6}$.

Example 5.2. In this SE, the input matrix $\tilde{A}(t)$ coefficients are set to

and the input matrix $\tilde{B}(t)$ coefficients are set to

Therefore, $\tilde{A}(t)\in\mathbb H^{2\times 5}$ with $\mathrm{rank}({{\tilde{A}(t)}}) = 2$ and $\tilde{B}(t)\in\mathbb H^{3\times 5}$. The results are presented in Figures 1 and 2.

5.2.   Discussion on simulation examples results

The performance of the ZNNQ-G (3.11) and ZNNQ-D (4.14) models for solving the ML-TQ-LME problem of (2.4) is investigated throughout the SEs 5.1 and 5.2. Each SE is associated with a unique ML-TQ-LME problem that is specified by the proper pair of matrices $\tilde{A}(t)$ and $\tilde{B}(t)$.

In the case of SE 5.1, we have that $\tilde{A}(t)\in\mathbb H^{4\times 3}$ with $\mathrm{rank}({{\tilde{A}(t)}}) = 2$ and $\tilde{B}(t)\in\mathbb H^{4\times 2}$. That is, $m\geq n > \mathrm{rank}({{\tilde{A}(t)}})$. Figure 1a and e, respectively, show the EMEs of the ZNNQ-G and ZNNQ-D models under IC1 for $\lambda = 10$ and $\lambda = 100$, while Figure 1b and 1f show the EMEs of the ZNNQ-G and ZNNQ-D models under IC2 for $\lambda = 10$ and $\lambda = 100$, respectively. In these figures, all models start at $t = 0$ from a high error value and converge to a low error value in the interval $[10^{-5}, 10^{-3}]$ at $t = 2$ when $\lambda = 10$ and at $t = 0.2$ $\lambda = 100$. The ZNNQ-D model, however, converges to its minimum value more quickly than the ZNNQ-G model and has a lower overall error value. Notice that the minimum value close to $10^{-5}$ is expected because of the MATLAB ${\mathtt {ode15s}}$ default double precision arithmetic. We can further confirm that the ZNN models converge to their minimal value regardless of the ICs, and that they do so even more swiftly the larger the value of $\lambda$ is. The ML errors in Figure 1i, 1m, 1j and 1n follow the convergence tendency of their corresponding EME in Figure 1a, 1e, 1b and 1f, respectively. However, unlike the comparable EMEs, the models' ML errors have a similar lower overall error value and converge to their minimum value at the same rate. For $\lambda = 10$, the trajectories of the solutions generated by the models under IC1 are presented in Figure 2a–2d and under IC2 are presented in Figure 2e–2h. The real part and the three imaginary parts of the solutions are depicted in these figures, respectively, and their relation to the TSOL is shown. These figures show that the solutions produced by the models match up to the TSOL and that they converge to the TSOL in a manner consistent with the corresponding ML error's convergence tendency.

In the case of SE 5.2, we have that $\tilde{A}(t)\in\mathbb H^{2\times 5}$ with $\mathrm{rank}({{\tilde{A}(t)}}) = 2$ and $\tilde{B}(t)\in\mathbb H^{3\times 5}$. That is, $n > m = \mathrm{rank}({{\tilde{A}(t)}})$. Figure 1c and 1g, respectively, show the EMEs of the ZNNQ-G and ZNNQ-D models under IC1 for $\lambda = 10$ and $\lambda = 100$, while Figure 1d and 1h show the EMEs of the ZNNQ-G and ZNNQ-D models under IC2 for $\lambda = 10$ and $\lambda = 100$, respectively. In these figures, all models start at $t = 0$ from a high error value and converge to a low error value in the interval $[10^{-5}, 10^{-3}]$ at $t = 2$ when $\lambda = 10$ and at $t = 0.2$ $\lambda = 100$. The ZNNQ-D model, however, converges to its minimum value more quickly than the ZNNQ-G model and has a lower overall error value. We can further confirm that the ZNN models converge to their minimal value regardless of the ICs, and that they do so even more swiftly the larger the value of $\lambda$ is. The ML errors in Figure 1k, 1o, 1l and 1p follow the convergence tendency of their corresponding EME in Figure 1c, 1g, 1d and 1h, respectively. However, unlike the comparable EMEs, the models' ML errors have a similar lower overall error value and converge to their minimum value at the same rate. For $\lambda = 10$, the trajectories of the solutions generated by the models under IC1 are presented in Figure 2i–2l and under IC2 are presented in Figure 2m–2p. The real part and the three imaginary parts of the solutions are depicted in these figures, respectively, and their relation to the TSOL is shown. These figures show that the solutions produced by the models match up to the TSOL and that they converge to the TSOL in a manner consistent with the corresponding ML error's convergence tendency.

Overall, the ZNNQ-G and ZNNQ-D models work excellent in solving two different ML-TQ-LME problems, while the aforementioned discussion verifies the results of Theorems 3.1–4.2. Additionally, the total computational complexity of the ZNNQ-G and ZNNQ-D models, respectively, is $\mathcal{O}((4ng)^3)$ and $\mathcal{O}((4n(m+g))^3)$ when $m\geq n$, and $\mathcal{O}((4mg)^3)$ and $\mathcal{O}((4m(n+g))^3)$ when $n > m$. That is, the ZNNQ-G model has lower total computational complexity than the ZNNQ-D model. Therefore, even though both models have comparable accuracy, we may conclude that the ZNNQ-G model has more advantages than the ZNNQ-D model.

5.3.   Applications to acoustic source tracking

The ZNNQ-G and ZNNQ-D models are utilized in this subsection to simulate acoustic source tracking based on the time delay of arrival (TDOA). TDOA is a technique for estimating the position of the signal source based on the difference in signal arrival times at receivers placed in various locations ^[52]. TDOA has been widely used in a variety of fields, including videoconferencing ^[53], indoor positioning ^[54], navigation ^[55] and a ultra-wideband localization system ^[56], as a form of passive source localization. The localization of an acoustic source could be transformed into a task of addressing LMEs based on TDOA.

The signal source for the acoustic source localization is an acoustic source, and the receivers are microphones. These applications examine the issue of localizing moving acoustic sources, where the position of the acoustic sound is subject to time. To keep things simple, we look into the 2-dimensional localization, from which we can expand to the 3-dimensional localization. First, we define the coordinates of the acoustic source, $w(t)$, and the coordinates of the $k$ microphones, $C$, as follows:

where the $k$ microphones are incidentally positioned and fixed. The acoustic source moves in the first application along a circular path trajectory as time passes, and in the second application along an infinity-shaped path trajectory as time passes. Particularly, taken from ^[57], the following circular path trajectory is used in the first application (App. 1):

where we have set the task duration $T = 5$ and the design parameter $\psi = 5$. In the second application (App. 2), the following infinity-shaped path trajectory is used ^[57]:

where we have set the task duration $T = 10$ and the design parameter $\psi = 10$.

The following equations are then provided, taken from ^[52]:

where $i = 1, 2, \dots, k$, the speed of sound is $u = 340.29$ m/s, $s_i(t)$ is the distance between the acoustic source and the $i$th microphone, the time at which sound arrives at the $i$th microphone is $T_i(t)$, and $\Delta T_i(t)$ is the difference in arrival time among the 1th and $i$th microphones. After the derivation process presented in ^[52], we set:

where

for $i = 3, 4, \dots, k$ with $k \geq 4$, to create the following equation:

where $w(t)$ is unknown. We chose the number of microphones to be 7 in both applications with $C = \begin{bmatrix}1 & 2.2 & -1 & 2.2 & -1 & 1 & 0\\1 & 1 & 2 & 0 & -1 & -1.2 & 0.3\end{bmatrix}\in\mathbb R^{2\times 7}$, whereas we have set the initial state $w(0) = [0.42, 0.27]^ {\mathrm T}$ in the first application and $w(0) = [-0.44, 0.25]^ {\mathrm T}$ in the second application. Therefore, we set the ICs $\tilde{X}(0) = w(0)$ and $\tilde{C}(0) = \mathbf{0}_{2\times 5}$ in the ZNNQ-G and ZNNQ-D models. The results are presented in Figure 3.

In App. 1, where the acoustic source moves in a circular path trajectory, Figure 3a shows the EMEs of the ZNNQ-G and ZNNQ-D models for $\lambda = 100$, and in App. 2, where the acoustic source moves in an infinity-shaped path trajectory, Figure 3e shows the EMEs of the ZNNQ-G and ZNNQ-D models for $\lambda = 100$. In these figures, all models start at $t = 0$ from a high error value and converge to a low error value in the interval $[10^{-6}, 10^{-3}]$ at $t = 0.1$. The ZNNQ-D model, however, has a lower overall error value than the ZNNQ-G model. The ML errors in Figure 3b and 3f follow the convergence tendency of their corresponding EMEs in Figure 3a and 3e. But unlike the comparable EMEs, the models' ML errors have a similar lower overall error value and converge to their minimum value at the same rate. The actual acoustic source and the estimated track produced by the models are presented in Figure 3c and 3g. In particular, we can see that the estimated track matches the actual acoustic source in Figure 3c, which moves in a circular path trajectory, and Figure 3d, which moves in an infinity-shaped path trajectory. The errors in Figure 3d further support this, where the error is below $5\times10^{-5}$ in both cases. It is important to note that the errors $\epsilon_X = x(t)-p_x(t)$ and $\epsilon_Y = y(t)-p_y(t)$, while the estimated tracks provided by the ZNNQ-G and ZNNQ-D models, respectively, are denoted by the superscripts $G$ and $D$ in these errors. In other words, the ZNNQ-G and ZNNQ-D models were successful in locating the acoustic source.

6.   Conclusions

Two models, ZNNQ-G and ZNNQ-D, have been presented in order to address the ML-TQ-LME problem for TQ input matrices of any dimension. The creation of such models has been backed by theoretical research and an examination of their computational complexity, in addition to simulation examples and practical acoustic source tracking applications. The gradient design, utilized by the ZNNQ-G model, has been suggested as being more efficient than the direct design, represented by the ZNNQ-D model, since the ML-TQ-LME problem has been successfully addressed.

The established results open the door for future interesting study efforts in light of this. Here are a few topics to contemplate about:

● The use of nonlinear ZNNs in TQ issues may be investigated.

● It is possible to examine the application of the finite-time ZNN theme to TQ problems.

● Another area of research is using carefully selected design parameters stated in fuzzy settings to quicken ZNN model convergence.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

This work was supported by a Mega Grant from the Government of the Russian Federation within the framework of federal project No. 075-15-2021-584.

Conflict of interest

The authors declare no conflict of interest.

Vasilios N. Katsikis is an editorial board member for AIMS Mathematics and was not involved in the editorial review or the decision to publish this article. All authors declare that there are no competing interests.