High performance computing for eigenvalue solver in density-matrix renormalization group method: Parallelization of the hamiltonian matrix-vector multiplication

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Density Matrix Renormalization Group (DMRG) method is widely used by computational physicists as a high accuracy tool to obtain the ground state of large quantum lattice models. Since the DMRG method has been originally developed for 1-D models, many extended method to a 2-D model have been proposed. However, some of them have issues in term of their accuracy. It is expected that the accuracy of the DMRG method extended directly to 2-D models is excellent. The direct extension DMRG method demands an enormous memory space. Therefore, we parallelize the matrix-vector multiplication in iterative methods for solving the eigenvalue problem, which is the most time- and memory-consuming operation. We find that the parallel efficiency of the direct extension DMRG method shows a good one as the number of states kept increases. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yamada, S., Okumura, M., & Machida, M. (2008). High performance computing for eigenvalue solver in density-matrix renormalization group method: Parallelization of the hamiltonian matrix-vector multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 39–45). https://doi.org/10.1007/978-3-540-92859-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free