Efficient computation of lattice Green functions for models with longer range hopping
From MaRDI portal
Recommendations
- Accurate calculation of Green functions on the d-dimensional hypercubic lattice
- Efficient lattice Green's function method for bounded domain problems
- Asymptotics of dynamic lattice Green's functions
- Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice
- Recursive evaluation of space-time lattice Green's functions
- Accurate calculation of off-diagonal Green functions on anisotropic hypercubic lattices
- A general method for calculating lattice green functions on the branch cut
- Efficient computation of the two-dimensional periodic Green's function
- DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION
- Rapid evaluation of the periodic Green function inddimensions
Cited in
(5)- On computing the square lattice Green's function without any integrations
- Two-particle lattice Green functions on a two-dimensional rectangular lattice with next-nearest neighbor hopping
- A general method for calculating lattice green functions on the branch cut
- Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice
- Memory efficient Fock-space recursion scheme for computing many-fermion resolvents
This page was built for publication: Efficient computation of lattice Green functions for models with longer range hopping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388922)
