Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition

Details Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition

2011-04-29

arxiv.org/abs/1105.0007v2

Phys. Rev. E 84, 056701 (2011)

Physics

Condensed Matter

Strongly Correlated Electrons

7 pages, 8 figures

Scientific paper

10.1103/PhysRevE.84.056701

We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of $n_{{\rm svd}}$ smaller subcluster vectors using singular value decomposition. For low entanglement entropy $S_{ee}$, (satisfied by short range Hamiltonians), the truncation error is expected to vanish as $\exp(-n_{{\rm svd}}^{1/S_{ee}})$. Convergence is tested for the Heisenberg model on Kagom\'e clusters of 24, 30 and 36 sites, with no lattice symmetries exploited, using less than 15GB of dynamical memory. Generalization of the Lanczos-SVD algorithm to multiple partitioning is discussed, and comparisons to other techniques are given.

Affiliated with

Also associated with

No associations

Rating

Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65439