Abstract

In this paper, we extend the neural network based approaches, which can asymptotically compute the largest or smallest eigenvalues and the corresponding eigenvectors of real symmetric matrix, to the real antisymmetric matrix case. Given any n-by-n real antisymmetric matrix, unlike the previous neural network based methods that were summarized by some ordinary differential equations (ODEs) with 2n dimension, our proposed method can be represented by some n dimensional ODEs, which can much reduce the scale of networks and achieve higher computing performance. Simulations verify the computational capability of our proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.