arXiv:1808.04898
Recursive computation of Greens functions for interacting particles in disordered lattices and binary trees
Tirthaprasad Chattaraj
Abstract
In this article, the method of computing Greens functions recursively for interacting particles has been extended to square lattices and binary trees. The method allows for performing calculations for large lattices. Approximations, which make the method more efficient while maintaining accuracy are described for computations of dynamics and correlations of interacting particles in disordered systems. Direct informations related to spectral weights for different initial preparations of interacting particles in real space can be obtained using this method for larger system sizes with less finite size effects.