pith. sign in

arxiv: 1506.01610 · v1 · pith:RENBEBGTnew · submitted 2015-06-03 · 🧮 math.NA · physics.comp-ph

Localized density matrix minimization and linear scaling algorithms

classification 🧮 math.NA physics.comp-ph
keywords densitysystemlocalizedalgorithmsmatricestemperaturefinitematrix
0
0 comments X
read the original abstract

We propose a convex variational approach to compute localized density matrices for both zero temperature and finite temperature cases, by adding an entry-wise $\ell_1$ regularization to the free energy of the quantum system. Based on the fact that the density matrix decays exponential away from the diagonal for insulating system or system at finite temperature, the proposed $\ell_1$ regularized variational method provides a nice 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 $\ell_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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.