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

arXiv:1204.3425 · Computer Physics Communications

Exact diagonalization of the Hubbard model on graphics processing units

Topi Siro, Ari Harju

Published Apr 25, 2012• 26 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2012.04.006

Related papers

Toward large-scale Hybrid Monte Carlo simulations of the Hubbard model on graphics processing units

Kyle Wendt, Joaquín E. Drut, Timo A. Lähde

arXiv:1007.3432•Computer Physics Communications•Apr 24, 2011•6 citations

Electronic structure of the Hubbard and extended Hubbard models: An exact diagonalization study

Y. Ohta, Kenji Tsutsui, Wataru Koshibae +1 more

Physica B Condensed Matter•Feb 1, 1994•1 citation

Parallelization of the exact diagonalization of the t−t′-Hubbard model

W Fettes, I Morgenstern, T Husslein

arXiv:cond-mat/9709336•Computer Physics Communications•Oct 1, 1997•11 citations

Parallelization of the exact diagonalization of the t−t′-Hubbard model

Fettes, Werner, Morgenstern, Ingo, Husslein, Thomas

•Oct 2, 1997•4 citations

Organization of the Hilbert space for exact diagonalization of Hubbard model

Medha Sharma, M. A. H. Ahsan

arXiv:1307.7542•Computer Physics Communications•Apr 16, 2015•11 citations

Improved hybrid parallel strategy for density matrix renormalization group method*

Fuzhou Chen, Chen Cheng, Hong‐Gang Luo

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.

Chinese Physics B•Apr 17, 2020•6 citations
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.