4.6 Article

Recurrent neural network for computation of generalized eigenvalue problem with real diagonalizable matrix pair and its applications

期刊

NEUROCOMPUTING
卷 216, 期 -, 页码 230-241

出版社

ELSEVIER
DOI: 10.1016/j.neucom.2016.07.042

关键词

Neural network; Generalized eigenvalue; Right and left eigenvectors; Invariant subspaces; Diagonalizable matrix pair; Generalized singular value; Right and left singular vectors

资金

  1. National Natural Science Foundation of China [11271084]

向作者/读者索取更多资源

We present neural networks to compute the left and right eigenvectors of the real diagonalizable matrix pair with real generalized eigenvalues, corresponding to the largest or the smallest generalized eigenvalue. We establish an explicit representation for the solutions of the neural network and analyze the convergence property. We consider how to use the above neural networks for computation of the singular value problem and the generalized singular value problem. In detail, we use our neural networks to compute the left and right singular vectors of a real matrix, corresponding to the largest or the smallest singular value. The right generalized singular vector of matrix pairs, corresponding to the largest or the smallest generalized singular value, can be computed by the neural networks. Numerical examples are given to illustrate our result is reasonable. (C) 2016 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据