Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical review. B, Condensed matter

Wave-function initialization in an infinite-chain density-matrix renormalization-group algorithm

Liqun Sun, Jun Zhang, Shaojin Qin, Yian Lei

Published Mar 20, 2002• 3 citations
Publisher

Abstract

An improved trial-wave-function initialization approach is suggested in an infinite-chain density-matrix renormalization-group (DMRG) method. When we remove the sign freedom of the retained basis in a DMRG algorithm, an optimal trial wave function for a chain can be obtained from previous wave functions for chains with shorter lengths in DMRG. Such an optimal trial wave function will reduce the iteration number of Lanczos-style approaches in calculating the eigen-wave-functions. The possibilities of converging to other eigenenergy levels are also eliminated. A one-dimensional Heisenberg chain is used in this paper to illustrate our practice.

DOI
10.1103/physrevb.65.132412

Related papers

Dynamical correlation functions using the density matrix renormalization group

Till D. Kühner, Steven R. White

The density matrix renormalization group (DMRG) method allows for very precise calculations of ground state properties in low-dimensional strongly correlated systems. We investigate two methods to expand the DMRG to calculations of dynamical properties. In the Lanczos vector method the DMRG basis is optimized to represent Lanczos vectors, which are then used to calculate the spectra. This method is fast and relatively easy to implement, but the accuracy at higher frequencies is limited. Alternatively, one can optimize the basis to represent a correction vector for a particular frequency. The correction vectors can be used to calculate the dynamical correlation functions at these frequencies with high accuracy. By separately calculating correction vectors at different frequencies, the dynamical correlation functions can be interpolated and pieced together from these results. For systems with open boundaries we discuss how to construct operators for specific wave vectors using filter functions.

arXiv:cond-mat/9812372•Physical review. B, Condensed matter•Jul 1, 1999•298 citations

Memory,Time and Technique Aspects of Density Matrix Renormalization Group Method

Qin Shao-Jin, Lou Ji-Zhong

We present the memory size,computational time,and technique aspects of density matrix renormalization group (DMRG) algorithm.We show how to estimate the memory size and computational time before starting a large scale DMRG calculation.We propose an implementation of the Hamiltonian wavefunction multiplication and a wavefunction initialization in DMRG with block matrix data structure.One-dimensional Heisenberg model is used to illustrate our study.

Communications in Theoretical Physics•Nov 15, 2001•2 citations

Obtaining the two-body density matrix in the density matrix renormalization group method

Dominika Zgid, Marcel Nooijen

We present an approach that allows to produce the two-body density matrix during the density matrix renormalization group (DMRG) run without an additional increase in the current disk and memory requirements. The computational cost of producing the two-body density matrix is proportional to O(M3k2+M2k4). The method is based on the assumption that different elements of the two-body density matrix can be calculated during different steps of a sweep. Hence, it is desirable that the wave function at the convergence does not change during a sweep. We discuss the theoretical structure of the wave function ansatz used in DMRG, concluding that during the one-site DMRG procedure, the energy and the wave function are converging monotonically at every step of the sweep. Thus, the one-site algorithm provides an opportunity to obtain the two-body density matrix free from the N-representability problem. We explain the problem of local minima that may be encountered in the DMRG calculations. We discuss theoretically why and when the one- and two-site DMRG procedures may get stuck in a metastable solution, and we list practical solutions helping the minimization to avoid the local minima.

The Journal of Chemical Physics•Apr 11, 2008•90 citations

Two-dimensional algorithm of the density-matrix renormalization group

Tao Xiang, Jizhong Lou, Zhao-Bin Su

We propose an approach to implement the density-matrix renormalization group (DMRG) in two dimensions. With this approach the initial blocks of a $L\ifmmode\times\else\texttimes\fi{}L$ lattice are built up directly from the matrix elements of a $(L\ensuremath{-}1)\ifmmode\times\else\texttimes\fi{}(L\ensuremath{-}1)$ lattice and the topological characteristics of two-dimensional lattices are preserved in the iteration of DMRG. By applying it to the spin-1/2 Heisenberg model on both square and triangular lattices, we find that this approach is significantly more efficient and accurate than other two-dimensional DMRG methods currently in use.

arXiv:cond-mat/0102200•Physical review. B, Condensed matter•Aug 21, 2001•79 citations

An Improved Initialization Procedure for the Density-Matrix Renormalization Group

Masaki Tezuka

We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each step, has been used to reach the target system size. We then need to obtain the ground state for a different system size for every site addition, so 1) it is difficult to supply a good initial vector for the numerical diagonalization for the ground state, and 2) when the system reduced to a 1D system consists of an array of nonequivalent sites as in ladders or Hubbard-Holstein model, special care has to be taken. Our procedure, which we call the {\it recursive sweep method}, provides a solution to these problems and in fact provides a faster algorithm for the Hubbard model as well as more complicated ones such as the Hubbard-Holstein model.

arXiv:cond-mat/0702242•Journal of the Physical Society of Japan•Apr 25, 2007•2 citations

Lanczos algorithm with matrix product states for dynamical correlation functions

Piet E. Dargel, Anton Wöllert, A. Honecker +3 more

The density-matrix renormalization group (DMRG) algorithm can be adapted to the calculation of dynamical correlation functions in various ways which all represent compromises between computational efficiency and physical accuracy. In this paper we reconsider the oldest approach based on a suitable Lanczos-generated approximate basis and implement it using matrix product states (MPS) for the representation of the basis states. The direct use of matrix product states combined with an ex post reorthogonalization method allows us to avoid several shortcomings of the original approach, namely the multitargeting and the approximate representation of the Hamiltonian inherent in earlier Lanczos-method implementations in the DMRG framework, and to deal with the ghost problem of Lanczos methods, leading to a much better convergence of the spectral weights and poles. We present results for the dynamic spin structure factor of the spin-1/2 antiferromagnetic Heisenberg chain. A comparison to Bethe ansatz results in the thermodynamic limit reveals that the MPS-based Lanczos approach is much more accurate than earlier approaches at minor additional numerical cost.

arXiv:1203.2523•Physical Review B•May 11, 2012•83 citations
An improved trial-wave-function initialization approach is suggested in an infinite-chain density-matrix renormalization-group (DMRG) method. When we remove the sign freedom of the retained basis in a DMRG algorithm, an optimal trial wave function for a chain can be obtained from previous wave functions for chains with shorter lengths in DMRG. Such an optimal trial wave function will reduce the iteration number of Lanczos-style approaches in calculating the eigen-wave-functions. The possibilities of converging to other eigenenergy levels are also eliminated. A one-dimensional Heisenberg chain is used in this paper to illustrate our practice.
The density matrix renormalization group (DMRG) method allows for very precise calculations of ground state properties in low-dimensional strongly correlated systems. We investigate two methods to expand the DMRG to calculations of dynamical properties. In the Lanczos vector method the DMRG basis is optimized to represent Lanczos vectors, which are then used to calculate the spectra. This method is fast and relatively easy to implement, but the accuracy at higher frequencies is limited. Alternatively, one can optimize the basis to represent a correction vector for a particular frequency. The correction vectors can be used to calculate the dynamical correlation functions at these frequencies with high accuracy. By separately calculating correction vectors at different frequencies, the dynamical correlation functions can be interpolated and pieced together from these results. For systems with open boundaries we discuss how to construct operators for specific wave vectors using filter functions.
We present an approach that allows to produce the two-body density matrix during the density matrix renormalization group (DMRG) run without an additional increase in the current disk and memory requirements. The computational cost of producing the two-body density matrix is proportional to O(M3k2+M2k4). The method is based on the assumption that different elements of the two-body density matrix can be calculated during different steps of a sweep. Hence, it is desirable that the wave function at the convergence does not change during a sweep. We discuss the theoretical structure of the wave function ansatz used in DMRG, concluding that during the one-site DMRG procedure, the energy and the wave function are converging monotonically at every step of the sweep. Thus, the one-site algorithm provides an opportunity to obtain the two-body density matrix free from the N-representability problem. We explain the problem of local minima that may be encountered in the DMRG calculations. We discuss theoretically why and when the one- and two-site DMRG procedures may get stuck in a metastable solution, and we list practical solutions helping the minimization to avoid the local minima.
We propose an approach to implement the density-matrix renormalization group (DMRG) in two dimensions. With this approach the initial blocks of a $L\ifmmode\times\else\texttimes\fi{}L$ lattice are built up directly from the matrix elements of a $(L\ensuremath{-}1)\ifmmode\times\else\texttimes\fi{}(L\ensuremath{-}1)$ lattice and the topological characteristics of two-dimensional lattices are preserved in the iteration of DMRG. By applying it to the spin-1/2 Heisenberg model on both square and triangular lattices, we find that this approach is significantly more efficient and accurate than other two-dimensional DMRG methods currently in use.
We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each step, has been used to reach the target system size. We then need to obtain the ground state for a different system size for every site addition, so 1) it is difficult to supply a good initial vector for the numerical diagonalization for the ground state, and 2) when the system reduced to a 1D system consists of an array of nonequivalent sites as in ladders or Hubbard-Holstein model, special care has to be taken. Our procedure, which we call the {\it recursive sweep method}, provides a solution to these problems and in fact provides a faster algorithm for the Hubbard model as well as more complicated ones such as the Hubbard-Holstein model.
The density-matrix renormalization group (DMRG) algorithm can be adapted to the calculation of dynamical correlation functions in various ways which all represent compromises between computational efficiency and physical accuracy. In this paper we reconsider the oldest approach based on a suitable Lanczos-generated approximate basis and implement it using matrix product states (MPS) for the representation of the basis states. The direct use of matrix product states combined with an ex post reorthogonalization method allows us to avoid several shortcomings of the original approach, namely the multitargeting and the approximate representation of the Hamiltonian inherent in earlier Lanczos-method implementations in the DMRG framework, and to deal with the ghost problem of Lanczos methods, leading to a much better convergence of the spectral weights and poles. We present results for the dynamic spin structure factor of the spin-1/2 antiferromagnetic Heisenberg chain. A comparison to Bethe ansatz results in the thermodynamic limit reveals that the MPS-based Lanczos approach is much more accurate than earlier approaches at minor additional numerical cost.