Please use this identifier to cite or link to this item: https://zone.biblio.laurentian.ca/handle/10219/2189
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Jieyu-
dc.date.accessioned2014-05-13T15:48:28Z-
dc.date.available2014-05-13T15:48:28Z-
dc.date.issued2014-05-13-
dc.identifier.urihttps://zone.biblio.laurentian.ca/dspace/handle/10219/2189-
dc.description.abstractQuantum spin models play an important role in theoretical condensed matter physics and quantum information theory. One numerical technique that is frequently used in studies of quantum spin systems is exact diagonalization. In this approach, numerical methods are used to find the lowest eigenvalues and associated eigenvectors of the Hamilton matrix of the quantum system. The computational problem is thus to determine the lowest eigenpairs of an extremely large, sparse matrix. Although many sophisticated iterative techniques for the determination of a small number of lowest eigenpairs can be found in the literature, most exact diagonalization studies of quantum spin systems have employed the Lanczos algorithm. In contrast to this, other methods have been applied very successfully to the similar problem of electronic structure calculations. The well known VASP code for example uses a Block Davidson method as well as the residual-minimization - direct inversion of the iterative subspace algorithm (RMM-DIIS). The Davidson algorithm is closely related to the Lanczos method but usually needs less iterations. The RMM-DIIS method was originally proposed by Pulay and later modified by Wood and Zunger. The RMM-DIIS method is particularly interesting if more than one eigenpair is sought since it does not require orthogonalization of the trial vectors at each step. In this work I study the efficiency of the Lanczos, Block Davidson and RMM-DIIS method when applied to basic quantum spin models like the spin-1/2 Heisenberg chain, ladder and dimerized ladder. I have implemented all three methods and are currently applying the methods to the different models. In our presentation I will compare the three algorithms based on the number of iterations to achieve convergence, the required computational time. An Intel's Many-Integrated Core architecture with Intel Xeon Phi coprocessor 5110P integrates 60 cores with 4 hardware threads per core was used for RMM-DIIS method, the achieved parallel speedups were compared with those obtained on a conventional multi-core system.en_CA
dc.language.isoenen_CA
dc.publisherLaurentian University of Sudburyen_CA
dc.subjectquantum spin systemsen_CA
dc.subjectmatrix storageen_CA
dc.subjectDavidson and block Davidson methoden_CA
dc.subjectLanczos methoden_CA
dc.subjectRMM-DIIS methoden_CA
dc.subjectdiagonalizationen_CA
dc.titleApplication of advanced diagonalization methods to quantum spin systems.en_CA
dc.typeThesisen_CA
dc.description.degreeMaster's Thesesen_CA
dc.publisher.grantorLaurentian University of Sudburyen_CA
Appears in Collections:Master's theses
Master's Theses

Files in This Item:
File Description SizeFormat 
Wang_Jieyu_Master_Thesis.pdf9.94 MBAdobe PDFThumbnail
View/Open


Items in LU|ZONE|UL are protected by copyright, with all rights reserved, unless otherwise indicated.