.png){kind=icon}
.png){kind=icon}
Return
Localized density matrix minimization and linear-scaling algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2016.02.076.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a convex variational approach to compute localized density matrices for both zero temperature and finite temperature cases, by adding an entry-wise l(1) regularization to the free energy of the quantum system. Based on the fact that the density matrix decays exponentially away from the diagonal for insulating systems or systems at finite temperature, the proposed l(1) regularized variational method provides an effective way to approximate the original quantum system. We provide theoretical analysis of the approximation behavior and also design convergence guaranteed numerical algorithms based on Bregman iteration. More importantly, the l(1) regularized system naturally leads to localized density matrices with banded structure, which enables us to develop approximating algorithms to find the localized density matrices with computation cost linearly dependent on the problem size. (C) 2016 Elsevier Inc. All rights reserved.
Keywords:
Localized density matrix
l(1) norm
Hamiltonian
Finite temperature
Linear-scaling algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W