Corrected one-site density matrix renormalization group and alternating minimal energy algorithm

From MaRDI portal
Publication:5264857

DOI10.1007/978-3-319-10705-9_33zbMATH Open1328.65087arXiv1312.6542OpenAlexW3124300106MaRDI QIDQ5264857FDOQ5264857

Sergey Dolgov, D. V. Savostyanov

Publication date: 28 July 2015

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1312.6542





Cites Work


Cited In (9)


   Recommendations





This page was built for publication: Corrected one-site density matrix renormalization group and alternating minimal energy algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264857)