Paradeisos: a perfect hashing algorithm for many-body eigenvalue problems

DOI10.1016/J.CPC.2017.11.011zbMATH Open1511.65033arXiv1707.03974OpenAlexW2735751887MaRDI QIDQ6163597FDOQ6163597

Authors:

Publication date: 9 June 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: We describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the "checkerboard" decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

Full work available at URL: https://arxiv.org/abs/1707.03974

Recommendations

• A parallel full-CI algorithm
• A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
• Organization of the Hilbert space for exact diagonalization of Hubbard model
• Parallel hashing
• scientific article; zbMATH DE number 898085

zbMATH Keywords

Hubbard modelstrongly correlated systemexact diagonalizationmany-body physicsperfect hashingcheckerboard decomposition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites Work

• Title not available (Why is that?)
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• The \texttt{FermiFab} toolbox for fermionic many-particle quantum systems
• Computational many-particle physics. Papers presented at the summer school, Greifswald, Germany, September 2006.
• Exact diagonalization of quantum-spin models

Cited In (1)

• Efficient linear scaling mapping for permutation symmetric Fock spaces

This page was built for publication: Paradeisos: a perfect hashing algorithm for many-body eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163597)