.png){kind=icon}
Return
The density matrix renormalization group algorithm on kilo-processor architectures: Implementation and trade-offs
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2014.02.021.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the numerical analysis of strongly correlated quantum lattice models one of the leading algorithms developed to balance the size of the effective Hilbert space and the accuracy of the simulation is the density matrix renormalization group (DMRG) algorithm, in which the run-time is dominated by the iterative diagonalization of the Hamilton operator. As the most time-dominant step of the diagonalization can be expressed as a list of dense matrix operations, the DMRG is an appealing candidate to fully utilize the computing power residing in novel kilo-processor architectures. In the paper a smart hybrid CPU GPU implementation is presented, which exploits the power of both CPU and GPU and tolerates problems exceeding the GPU memory size. Furthermore, a new CUDA kernel has been designed for asymmetric matrix vector multiplication to accelerate the rest of the diagonalization. Besides the evaluation of the GPU implementation, the practical limits of an FPGA implementation are also discussed. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Strongly correlated systems
DMRG
GPU acceleration
FPGA acceleration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
Cited Papers
ShareSaveShareSaveMortality Salience and Metabolism: Glucose Drinks Reduce Worldview Defense Caused by Mortality Salience.png)
Psychology
OAAI
PsychologyIF0
OAAIShareSaveMatrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systemsADVANCES IN PHYSICSOAAI
ADVANCES IN PHYSICSIF13.8
OAAIShareSave
View more