Journal
PHYSICAL REVIEW LETTERS
Volume 84, Issue 26, Pages 5924-5927Publisher
AMERICAN PHYSICAL SOC
DOI: 10.1103/PhysRevLett.84.5924
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available