A recurrent neural network computing the largest imaginary or real part of eigenvalues of real matrices (Q2469912): Difference between revisions

The authors introduce a recurrent neutral net work (RNN) to extract some eigenpair. The RNN whose connection weights are dependent upon the matrix, can be transformed into a complex differential system whose variable \(z(t)\) is a compex vector. By the analytic expression of \(| z(t)| ^2\), the convergence properties of the RNN are analysed in detail. With a general nonzero initial complex vector, the RNN obtains the largest imaginary part of all eigenvalues. A practice of a \(7\times 7\) matrix indicates the validity of this method.