An implementation of the Lanczos algorithm for the exact diagonalization of the two dimensional Hubbard model on a 4×4 square lattice on the Connection Machine CM‐2 system is described. The CM‐2 is a massively parallel machine with distributed memory. The program is written in C/PARIS. This implementation minimizes memory usage by generating the matrix elements as needed instead of storing them. The Lanczos vectors are stored across the local memory of the processors. Using translational symmetry only, the dimension of the Hilbert space at half filling is more than 10 million. A speed of about 2.4 min per iteration is achieved on a 64K CM‐2. This implementation is scalable. Running it on a bigger machine with more processors speeds up the process. The performance analysis of this implementation is shown and discuss its advantages and disadvantages are discussed.
Skip Nav Destination
Research Article| November 01 1992
Implementation of the Lanczos algorithm for the Hubbard model on the Connection Machine system
P. W. Leung;
P. W. Leung, Paul E. Oppenheimer; Implementation of the Lanczos algorithm for the Hubbard model on the Connection Machine system. Comput. Phys. 1 November 1992; 6 (6): 603–609. https://doi.org/10.1063/1.168440
Download citation file: