2008
DOI: 10.1007/978-3-540-85984-0_9
|View full text |Cite
|
Sign up to set email alerts
|

MATLAB Simulation and Comparison of Zhang Neural Network and Gradient Neural Network for Online Solution of Linear Time-Varying Matrix Equation AXB − C = 0

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…In conclusion, the Simulink implementation of Algorithm 3 computes the outer inverse = ( ) † which satisfies condition (29) from the definition of the ( , )-inverse, but not condition (28) from the same definition. In other words, satisfies neither R( ) = R( ) nor N( ) = N( ).…”
Section: Matlab Fcnmentioning
confidence: 99%
See 2 more Smart Citations
“…In conclusion, the Simulink implementation of Algorithm 3 computes the outer inverse = ( ) † which satisfies condition (29) from the definition of the ( , )-inverse, but not condition (28) from the same definition. In other words, satisfies neither R( ) = R( ) nor N( ) = N( ).…”
Section: Matlab Fcnmentioning
confidence: 99%
“…We refer to [28,29] for further details. In the case of constant coefficient matrices , , , it is necessary to use the linear GNN of the forṁ= The generalized nonlinearly activated GNN model (GGNN model) is applicable in both time-varying and time-invariant case and possesses the forṁ…”
Section: Algorithms and Implementation Detailsmentioning
confidence: 99%
See 1 more Smart Citation
“…For comparative purpose, we could also develop and exploit the following GNN model for solving online equation (1) (see Appendix C and/or [12][17] [18][20] for more details):…”
Section: A Neural-solvers Descriptionmentioning
confidence: 99%
“…When coefficient A is non-singular, x(t) has an unique theoretical solution x * = A −1 b; when coefficient A is singular, linear equations (1) can have no solution or multiple solutions. A number of related problems such as matrix inversion [1], [2], [3], [4], [5], quadratic programming/minimisation [6], [7], [8], Sylvester equations [9], Lyapunov matrix equation [10], [11] and linear matrix equations AX(t)B = C [12], [13] can be transformed into linear equations (1) via vectorisation and Kronecker product [4]. Such a problem is widely encountered in other fields of science and engineering such as ridge regression in machine learning [14], [15], [16], [17], signal processing [18], optical flow in computer vision [19], [20], and robotic inverse kinematics [21], [22].…”
Section: Introductionmentioning
confidence: 99%