Recurrent Neural Networks for Computing Pseudoinverses of Rank-Deficient Matrices
SIAM Journal on Scientific Computing
Complex recurrent neural network for computing the inverse and pseudo-inverse of the complex matrix
Applied Mathematics and Computation
The reliability of travel time forecasting
IEEE Transactions on Intelligent Transportation Systems
Hi-index | 0.01 |
Quick extraction of the extremum eigenpairs of a real symmetric matrix is very important in engineering. Using neural networks to complete this operation is in a parallel manner and can achieve high performance. So, this paper proposes a very concise functional neural network (FNN) to compute the largest (or smallest) eigenvalue and one corresponding eigenvector. After transforming the FNN into a differential equation, and obtaining the analytic solution, the convergence properties are completely analyzed. By this FNN, the method that can compute the extremum eigenpairs whether the matrix is non-definite, positive definite or negative definite is designed. Finally, three examples show the validity. Comparing with the other ones used in the same field, the proposed FNN is very simple and concise, so it is very easy to realize.