Do you want to publish a course? Click here

On-the-fly exact diagonalization solver for quantum electronic models

109   0   0.0 ( 0 )
 Added by Ilya Kashin
 Publication date 2015
  fields Physics
and research's language is English




Ask ChatGPT about the research

We propose a distinct numerical approach to effectively solve the problem of partial diagonalization of the super-large-scale quantum electronic Hamiltonian matrices. The key ingredients of our scheme are the new method for arranging the basis vectors in the computers RAM and the algorithm allowing not to store a matrix in RAM, but to regenerate it on-the-fly during diagonalization procedure. This scheme was implemented in the program, solving the Anderson impurity model in the framework of dynamical mean-field theory (DMFT). The DMFT equations for electronic Hamiltonian with 18 effective orbitals that corresponds to the matrix with the dimension of 2.4 * 10^9 were solved on the distributed memory computational cluster.



rate research

Read More

We present an efficient exact diagonalization scheme for the extended dynamical mean-field theory and apply it to the extended Hubbard model on the square lattice with nonlocal charge-charge interactions. Our solver reproduces the phase diagram of this approximation with good accuracy. Details on the numerical treatment of the large Hilbert space of the auxiliary Holstein-Anderson impurity problem are provided. Benchmarks with a numerically exact strong-coupling continuous-time quantum-Monte Carlo solver show better convergence behavior of the exact diagonalization in the deep insulator. Special attention is given to possible effects due to the discretization of the bosonic bath. We discuss the quality of real axis spectra and address the question of screening in the Mott insulator within extended dynamical mean-field theory.
138 - C. Weber , A. Amaricci , M. Capone 2012
We present a new methodology to solve the Anderson impurity model, in the context of dynamical mean-field theory, based on the exact diagonalization method. We propose a strategy to effectively refine the exact diagonalization solver by combining a finite-temperature Lanczos algorithm with an adapted version of the cluster perturbation theory. We show that the augmented diagonalization yields an improved accuracy in the description of the spectral function of the single-band Hubbard model and is a reliable approach for a full d-orbital manifold calculation.
We present a very efficient solver for the general Anderson impurity problem. It is based on the perturbation around a solution obtained from exact diagonalization using a small number of bath sites. We formulate a perturbation theory which is valid for both weak and strong coupling and interpolates between these limits. Good agreement with numerically exact quantum Monte-Carlo results is found for a single bath site over a wide range of parameters. In particular, the Kondo resonance in the intermediate coupling regime is well reproduced for a single bath site and the lowest order correction. The method is particularly suited for low temperatures and alleviates analytical continuation of imaginary time data due to the absence of statistical noise compared to quantum Monte-Carlo impurity solvers.
We present an alternative scheme to the widely used method of representing the basis of one-band Hubbard model through the relation $I=I_{uparrow}+2^{M}I_{downarrow}$ given by H. Q. Lin and J. E. Gubernatis [Comput. Phys. 7, 400 (1993)], where $I_{uparrow}$, $I_{downarrow}$ and $I$ are the integer equivalents of binary representations of occupation patterns of spin up, spin down and both spin up and spin down electrons respectively, with $M$ being the number of sites. We compute and store only $I_{uparrow}$ or $I_{downarrow}$ at a time to generate the full Hamiltonian matrix. The non-diagonal part of the Hamiltonian matrix given as ${cal{I}}_{downarrow}otimes{bf{H}_{uparrow}} oplus {bf{H}_{downarrow}}otimes{cal{I}}_{uparrow}$ is generated using a bottom-up approach by computing the small matrices ${bf{H}_{uparrow}}$(spin up hopping Hamiltonian) and ${bf{H}_{downarrow}}$(spin down hopping Hamiltonian) and then forming the tensor product with respective identity matrices ${cal{I}}_{downarrow}$ and ${cal{I}}_{uparrow}$, thereby saving significant computation time and memory. We find that the total CPU time to generate the non-diagonal part of the Hamiltonian matrix using the new one spin configuration basis scheme is reduced by about an order of magnitude as compared to the two spin configuration basis scheme. The present scheme is shown to be inherently parallelizable. Its application to translationally invariant systems, computation of Greens functions and in impurity solver part of DMFT procedure is discussed and its extention to other models is also pointed out.
The tunable magnetism at graphene edges with lengths of up to 48 unit cells is analyzed by an exact diagonalization technique. For this we use a generalized interacting one-dimensional model which can be tuned continuously from a limit describing graphene zigzag edge states with a ferromagnetic phase, to a limit equivalent to a Hubbard chain, which does not allow ferromagnetism. This analysis sheds light onto the question why the edge states have a ferromagnetic ground state, while a usual one-dimensional metal does not. Essentially we find that there are two important features of edge states: (a) umklapp processes are completely forbidden for edge states; this allows a spin-polarized ground state. (b) the strong momentum dependence of the effective interaction vertex for edge states gives rise to a regime of partial spin-polarization and a second order phase transition between a standard paramagnetic Luttinger liquid and ferromagnetic Luttinger liquid.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا