Corrected One-Site Density Matrix Renormalization Group and Alternating Minimal Energy Algorithm
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT)/matrix product states (MPS) representation. Both methods empower the traditional alternating direction scheme with the auxiliary (e.g. gradient) information, which substantially improves the convergence in many difficult cases. Being conceptually close, these methods have different derivation, implementation, theoretical and practical properties. We emphasize the differences, and reproduce the numerical example to compare the performance of two algorithms.
Unable to display preview. Download preview PDF.
- 4.H. Munthe-Kaas, The convergence rate of inexact preconditioned steepest descent algorithm for solving linear systems, Numerical Analysis Report NA-87-04, Stanford University, 1987Google Scholar
- 9.___ , Density matrix renormalization group algorithms with a single center site. Phys. Rev. B 72(18), 180403 (2005)Google Scholar