A partition function approximation using elementary symmetric functions.
In statistical mechanics, the canonical partition function [Formula: see text] can be used to compute equilibrium properties of a physical system. Calculating [Formula: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particl...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2012-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC3520856?pdf=render |
| _version_ | 1819126412496338944 |
|---|---|
| author | Ramu Anandakrishnan |
| author_facet | Ramu Anandakrishnan |
| author_sort | Ramu Anandakrishnan |
| collection | DOAJ |
| description | In statistical mechanics, the canonical partition function [Formula: see text] can be used to compute equilibrium properties of a physical system. Calculating [Formula: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [Formula: 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 [Formula: see text] in [Formula: 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 [Formula: 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. |
| first_indexed | 2024-12-22T07:55:37Z |
| format | Article |
| id | doaj.art-50a34591176a45d7b2b2949cd5db0eda |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-22T07:55:37Z |
| publishDate | 2012-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-50a34591176a45d7b2b2949cd5db0eda2022-12-21T18:33:23ZengPublic Library of Science (PLoS)PLoS ONE1932-62032012-01-01712e5135210.1371/journal.pone.0051352A partition function approximation using elementary symmetric functions.Ramu AnandakrishnanIn statistical mechanics, the canonical partition function [Formula: see text] can be used to compute equilibrium properties of a physical system. Calculating [Formula: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [Formula: 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 [Formula: see text] in [Formula: 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 [Formula: 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.http://europepmc.org/articles/PMC3520856?pdf=render |
| spellingShingle | Ramu Anandakrishnan A partition function approximation using elementary symmetric functions. PLoS ONE |
| title | A partition function approximation using elementary symmetric functions. |
| title_full | A partition function approximation using elementary symmetric functions. |
| title_fullStr | A partition function approximation using elementary symmetric functions. |
| title_full_unstemmed | A partition function approximation using elementary symmetric functions. |
| title_short | A partition function approximation using elementary symmetric functions. |
| title_sort | partition function approximation using elementary symmetric functions |
| url | http://europepmc.org/articles/PMC3520856?pdf=render |
| work_keys_str_mv | AT ramuanandakrishnan apartitionfunctionapproximationusingelementarysymmetricfunctions AT ramuanandakrishnan partitionfunctionapproximationusingelementarysymmetricfunctions |