Anti-noise gradient direction neurokinetics algorithm based on parallel technology
A technology of gradient direction and neurodynamics, applied in the direction of neural learning methods, neural architecture, biological neural network models, etc., can solve the problems of increasing calculation time consumption, improve calculation efficiency, avoid calculation time consumption, and strong noise tolerance and the effect of computational accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0091] Embodiment 1: S301. When Sylverster equation (1) has the situation of analytical solution, the coefficient matrix that the present invention provides equation is respectively: P=[sin(3) cos(3);-cos(3) sin(3) ], Q=0 and L=-I; then, the analytical solution X of the equation is obtained by simple algebraic operations:
[0092]
[0093] Moreover, the corresponding residual ||E(t)|| F Defined as E(t)=PX(t)-X(t)Q+L, its corresponding vectorized residual is expressed as e(t), and this variable is used as the evaluation index of convergence; among them, the following mark F Represents the Frobenius norm of the matrix;
[0094] The computer simulation results are as figure 2 and image 3 ;Depend on figure 2 It can be seen that from the randomly generated initial state X 0 ∈ [-1, 1] 2×2 At the beginning, in the case of adding different types of noise (constant noise, linear noise and random noise), the anti-noise gradient direction neural dynamics (NTGON) algorithm pr...
Embodiment 2
[0097] Embodiment 2: Next, the present invention provides the example that a Sylvester equation does not have analytic solution, compares two kinds of algorithms aspect performance in numerical solution solving equation, detailed analysis is under the convergence performance under various noise conditions:
[0098] S302. When the Sylverster equation does not have an analytical solution, the coefficient matrix of the equation provided by the present invention is respectively: P=[sin(4) cos(4);-cos(4) sin(4)], Q=[2 0 ;0 3] and L=[sin(1) cos(1);-cos(1) sin(1)];
[0099] Figure 4-6 Presented the NTGON algorithm proposed by the present invention and the calculation performance comparison situation of the original GNN algorithm for solving the Sylvester equation; at the same time, in order to understand the influence of the convergence scaling factor of the algorithm on the calculation performance, the present invention combines three kinds of noise (constant noise ( Figure 4 ), ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


