Abstract
We present a new efficient method to find the Ising problem partition function for finite lattice graphs embeddable on an arbitrary orientable surface, with integral coupling constants bounded in the absolute value by a polynomial of the size of the lattice graph. The algorithm has been implemented for toroidal lattices using modular arithmetic and the generalized nested dissection method. The implementation has substantially better performance than any other as far as we know.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
