Cargando…

A Partition Function Approximation Using Elementary Symmetric Functions

In statistical mechanics, the canonical partition function [Image: see text] can be used to compute equilibrium properties of a physical system. Calculating [Image: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [...

Descripción completa

Detalles Bibliográficos
Autor principal: Anandakrishnan, Ramu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2012
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3520856/
https://www.ncbi.nlm.nih.gov/pubmed/23251504
http://dx.doi.org/10.1371/journal.pone.0051352
Descripción
Sumario:In statistical mechanics, the canonical partition function [Image: see text] can be used to compute equilibrium properties of a physical system. Calculating [Image: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [Image: see text] in the system. A commonly used method for approximating equilibrium properties, is the Monte Carlo (MC) method. For some problems the MC method converges slowly, requiring a very large number of MC steps. For such problems the computational cost of the Monte Carlo method can be prohibitive. Presented here is a deterministic algorithm – the direct interaction algorithm (DIA) – for approximating the canonical partition function [Image: see text] in [Image: see text] operations. The DIA approximates the partition function as a combinatorial sum of products known as elementary symmetric functions (ESFs), which can be computed in [Image: see text] operations. The DIA was used to compute equilibrium properties for the isotropic 2D Ising model, and the accuracy of the DIA was compared to that of the basic Metropolis Monte Carlo method. Our results show that the DIA may be a practical alternative for some problems where the Monte Carlo method converge slowly, and computational speed is a critical constraint, such as for very large systems or web-based applications.