We propose an improved real-space parallel strategy for the density matrix renormalization group (DMRG) method, where boundaries of separate regions are adaptively distributed during DMRG sweeps. Our scheme greatly improves the parallel efficiency with shorter waiting time between two adjacent tasks, compared with the original real-space parallel DMRG with fixed boundaries. We implement our new strategy based on the message passing interface (MPI), and dynamically control the number of kept states according to the truncation error in each DMRG step. We study the performance of the new parallel strategy by calculating the ground state of a spin-cluster chain and a quantum chemical Hamiltonian of the water molecule. The maximum parallel efficiencies for these two models are 91% and 76% in 4 nodes, which are much higher than the real-space parallel DMRG with fixed boundaries.
We propose an improved real-space parallel strategy for the density matrix renormalization group (DMRG) method, where boundaries of separate regions are adaptively distributed during DMRG sweeps. Our scheme greatly improves the parallel efficiency with shorter waiting time between two adjacent tasks, compared with the original real-space parallel DMRG with fixed boundaries. We implement our new strategy based on the message passing interface (MPI), and dynamically control the number of kept states according to the truncation error in each DMRG step. We study the performance of the new parallel strategy by calculating the ground state of a spin-cluster chain and a quantum chemical Hamiltonian of the water molecule. The maximum parallel efficiencies for these two models are 91% and 76% in 4 nodes, which are much higher than the real-space parallel DMRG with fixed boundaries.
We propose a new heterogeneous parallel strategy for the density matrix renormalization group (DMRG) method in the hybrid architecture with both central processing unit (CPU) and graphics processing unit (GPU). Focusing on the two most time-consuming sections in the finite DMRG sweeps, i.e., the diagonalization of superblock and the truncation of subblock, we optimize our previous hybrid algorithm to achieve better performance. For the former, we adopt OpenMP application programming interface on CPU and use our own subroutines with higher bandwidth on GPU. For the later, we use GPU to accelerate matrix and vector operations involving the reduced density matrix. Applying the parallel scheme to the Hubbard model with next-nearest hopping on the 4-leg ladder, we compute the ground state of the system and obtain the charge stripe pattern which is usually observed in high temperature superconductors. Based on simulations with different numbers of DMRG kept states, we show significant performance improvement and computational time reduction with the optimized parallel algorithm. Our hybrid parallel strategy with superiority in solving the ground state of quasi-two dimensional lattices is also expected to be useful for other DMRG applications with large numbers of kept states, e.g., the time dependent DMRG algorithms.
Density matrix renormalization group (DMRG), as a numerical method of solving the ground state of one-dimensional strongly-correlated lattice model with very high accuracy, requires expensive computational and memory cost when applied to two- and quasi-two-dimensional problems. The number of DMRG kept states is generally very large to achieve a reliable accuracy for these applications, which results in numerous matrix and vector operations and unbearably consuming time in the absence of the proper parallelization. However, due to its sequential nature, the parallelization of DMRG algorithm is usually not straightforward. In this work, we propose a new hybrid parallelization strategy for the DMRG method. It takes advantage of the computing capability of both central processing unit (CPU) and graphics processing unit (GPU) of the computer. In order to achieve as many as DMRG kept states within a limited GPU memory, we adopt the four-block formulation of the Hamiltonian rather than the two-block formulation. The later consumes much more memories, which has been used in another pioneer work on the hybrid parallelization of the DMRG algorithm, and only a small number of DMRG kept states are available. Our parallel strategy focuses on the diagonalization of the Hamiltonian, which is the most time-consuming part of the whole DMRG procedure. A hybrid parallelization strategy of diagonalization method is implemented, in which the required data for diagonalization are distributed on both the host and GPU memory, and the data exchange between them is negligible in our data partitioning scheme. The matrix operations are also shared on both CPU and GPU when the Hamiltonian acts on a wave function, while the distribution of these operations is determined by a load balancing strategy. Taking fermionic Hubbard model for example, we examine the running performance of the hybrid parallelization strategy with different DMRG kept states and provide corresponding performance benchmark. On a 4-leg ladder, we employ the conserved quantities with U(1) symmetry of the model and a good-quantum number based task scheduling to further reduce the GPU memory cost. We manage to obtain a moderate speedup of the hybrid parallelization for a wide range of DMRG kept states. In our example, the ground state energy with high accuracy is obtained by the extrapolation of the results, with different numbers of states kept, and we show charge stripes which are usually experimentally observed in high-temperature superconductors. In this case, we keep 104 DMRG states and the GPU memory cost is less than 12 Gigabytes.
There has been recent interest in the deployment of ab initio density matrix renormalization group (DMRG) computations on high performance computing platforms. Here, we introduce a reformulation of the conventional distributed memory ab initio DMRG algorithm that connects it to the conceptually simpler and advantageous sum of the sub-Hamiltonian approach. Starting from this framework, we further explore a hierarchy of parallelism strategies that includes (i) parallelism over the sum of sub-Hamiltonians, (ii) parallelism over sites, (iii) parallelism over normal and complementary operators, (iv) parallelism over symmetry sectors, and (v) parallelism within dense matrix multiplications. We describe how to reduce processor load imbalance and the communication cost of the algorithm to achieve higher efficiencies. We illustrate the performance of our new open-source implementation on a recent benchmark ground-state calculation of benzene in an orbital space of 108 orbitals and 30 electrons, with a bond dimension of up to 6000, and a model of the FeMo cofactor with 76 orbitals and 113 electrons. The observed parallel scaling from 448 to 2800 central processing unit cores is nearly ideal.
We present, to the best of our knowledge, the first attempt to exploit the super-computer platform for quantum chemical density matrix renormalization group (QC-DMRG) calculations. We have developed the parallel scheme based on the in-house MPI global memory library, which combines operator and symmetry sector parallelisms, and tested its performance on three different molecules, all typical candidates for QC-DMRG calculations. In case of the largest calculation, which is the nitrogenase FeMo cofactor cluster with the active space comprising 113 electrons in 76 orbitals and bond dimension equal to 6000, our parallel approach scales up to approximately 2000 CPU cores.
This article presents an efficient and parallelized implementation of the density matrix renormalization group (DMRG) algorithm for quantum chemistry calculations. The DMRG method as a large-scale multireference electronic structure model is by nature particularly efficient for one-dimensionally correlated systems, while the present development is oriented toward applications for polynuclear transition metal compounds, in which the macroscopic one-dimensional structure of electron correlation is absent. A straightforward extension of the DMRG algorithm is proposed with further improvements and aggressive optimizations to allow its application with large multireference active space, which is often demanded for metal compound calculations. Special efficiency is achieved by making better use of sparsity and symmetry in the operator and wave function representations. By accomplishing computationally intensive DMRG calculations, the authors have found that a large number of renormalized basis states are required to represent high entanglement of the electron correlation for metal compound applications, and it is crucial to adopt auxiliary perturbative correction to the projected density matrix during the DMRG sweep optimization in order to attain proper convergence to the solution. Potential energy curve calculations for the Cr(2) molecule near the known equilibrium precisely predicted the full configuration interaction energies with a correlation space of 24 electrons in 30 orbitals [denoted by (24e,30o)]. The energies are demonstrated to be accurate to 0.6mE(h) (the error from the extrapolated best value) when as many as 10,000 renormalized basis states are employed for the left and right DMRG block representations. The relative energy curves for [Cu(2)O(2)](2+) along the isomerization coordinate were obtained from DMRG and other correlated calculations, for which a fairly large orbital space (32e,62o) is modeled as a full correlation space. The DMRG prediction nearly overlaps with the energy curve from the coupled cluster with singles, doubles, and perturbative triple [CCSD(T)] calculations, while the multireference complete active space self-consistent field (CASSCF) calculations with the small reference configuration (8e,8o) are found to overestimate the biradical character of the electronic state of [Cu(2)O(2)](2+) according to the one-electron density matrix analysis.
We demonstrate how to parallelize the density matrix renormalization group (DMRG) algorithm in real space through a straightforward modification of serial DMRG. This makes it possible to apply at least an order of magnitude more computational power to challenging simulations, greatly accelerating investigations of two-dimensional systems and large parameter spaces. We discuss details of the algorithm and present benchmark results including a study of valence-bond-solid order within the square-lattice Q2 model and N\'eel order within the triangular lattice Heisenberg model. The parallel DMRG algorithm also motivates an alternative canonical form for matrix product states.