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

DOI10.1007/978-3-319-10705-9_33MaRDI QIDQ5264857zbMATH OpenOpenAlexFDO

Authors Sergey Dolgov, D. V. Savostyanov

Publication date 28 July 2015

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

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

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

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.

Recommendations

• Computation of extreme eigenvalues in higher dimensions using block tensor train format
• Alternating minimal energy methods for linear systems in higher dimensions
• Comparative study of two algorithms for the calculation of the extreme eigenvalues of large matrices
• The density-matrix renormalization group in the age of matrix product states
• DMRG approach to fast linear algebra in the TT-format

Cites work

• Alternating minimal energy methods for linear systems in higher dimensions
• Finitely correlated states on quantum spin chains
• On local convergence of alternating schemes for optimization of convex problems in the tensor train format
• Tensor-train decomposition
• The density-matrix renormalization group in the age of matrix product states

Cited in

(11)

• Quasioptimality of maximum-volume cross interpolation of tensors
• Tensor product approach to modelling epidemics on networks
• Alternating minimal energy methods for linear systems in higher dimensions
• Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
• Gauging tensor networks with belief propagation
• Computation of extreme eigenvalues in higher dimensions using block tensor train format
• Computing eigenspaces with low rank constraints
• Faster tensor train decomposition for sparse data
• Jacobi-Davidson method on low-rank matrix manifolds
• Parallel cross interpolation for high-precision calculation of high-dimensional integrals
• Hand-waving and interpretive dance: an introductory course on tensor networks

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)