Cargando…

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

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 relationship between the eigenvector and matrix elements exist...

Descripción completa

Detalles Bibliográficos
Autores principales: Pan, Wei, Wang, Jing, Sun, Deyan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7042245/
https://www.ncbi.nlm.nih.gov/pubmed/32098987
http://dx.doi.org/10.1038/s41598-020-60103-5
_version_ 1783501271127293952
author Pan, Wei
Wang, Jing
Sun, Deyan
author_facet Pan, Wei
Wang, Jing
Sun, Deyan
author_sort Pan, Wei
collection PubMed
description 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 relationship 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 random matrices, the linear relationship still keeps for non-random matrices, in which off-diagonal elements are non-positive. The relationship implies a straightforward method to directly calculate the eigenvector of ground states for one kind of matrices. The tests on both Hubbard and Ising models show that, this new method works excellently.
format Online
Article
Text
id pubmed-7042245
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher Nature Publishing Group UK
record_format MEDLINE/PubMed
spelling pubmed-70422452020-03-03 A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization Pan, Wei Wang, Jing Sun, Deyan Sci Rep Article 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 relationship 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 random matrices, the linear relationship still keeps for non-random matrices, in which off-diagonal elements are non-positive. The relationship implies a straightforward method to directly calculate the eigenvector of ground states for one kind of matrices. The tests on both Hubbard and Ising models show that, this new method works excellently. Nature Publishing Group UK 2020-02-25 /pmc/articles/PMC7042245/ /pubmed/32098987 http://dx.doi.org/10.1038/s41598-020-60103-5 Text en © The Author(s) 2020 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
spellingShingle Article
Pan, Wei
Wang, Jing
Sun, Deyan
A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title_full A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title_fullStr A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title_full_unstemmed A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title_short A new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
title_sort new strategy for directly calculating the minimum eigenvector of matrices without diagonalization
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7042245/
https://www.ncbi.nlm.nih.gov/pubmed/32098987
http://dx.doi.org/10.1038/s41598-020-60103-5
work_keys_str_mv AT panwei anewstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization
AT wangjing anewstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization
AT sundeyan anewstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization
AT panwei newstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization
AT wangjing newstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization
AT sundeyan newstrategyfordirectlycalculatingtheminimumeigenvectorofmatriceswithoutdiagonalization