A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization

DOI10.1038/S41598-020-60103-5arXiv1901.10626WikidataQ89882283 ScholiaQ89882283MaRDI QIDQ6313271FDOQ6313271

Publication date: 29 January 2019

Abstract: The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling between the eigenvector and matrix elements exists. Namely, each element of the eigenvector of ground states linearly correlates with the sum of matrix elements in the corresponding row. Although the conclusion is obtained based on the random matrices, the linear relationship still keeps for regular matrices, in which off-diagonal elements are non-positive. The relationship implies a straightforward method to directly calculate the eigenvector of ground states for a kind of matrices. The test on both Hubbard and Ising models shows that, this new method works excellently.

This page was built for publication: A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6313271)