Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.03248 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912178539331584 |
|---|---|
| author | Ding, Yonglong |
| author_facet | Ding, Yonglong |
| contents | As the particle count escalates, the computational demands of diverse simulation algorithms surge, paralleled by a marked enhancement in accuracy. The question arises whether this heightened precision asymptotically dwindles towards zero or plateaus at a finite constant. To address this, this work introduces an approach that translates infinite systems into finite-node network architectures, providing a rigorous framework for assessing this question. Employing the Monte Carlo algorithm's application to the Ising model as a case study, this paper demonstrate that despite the simulation's extension to an infinite lattice size, a fundamental error bound persists. This work explicitly derive this lower bound on the error, offering a quantitative understanding of the algorithm's limitations in the limit of infinite scale. Furthermore, I extend this methodology to Molecular Dynamics simulations, exemplified through its application to battery systems. This conversion strategy not only underscores the generality of this approach but also highlights its practical significance in guiding the optimization of simulation algorithms. Moreover, it offers insights into estimating micro-level information from macro-level data. The crucial information of Molecular Simulation, namely the potential energy, has been quickly estimated. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_03248 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Precision Evaluation Criteria for Simulation Algorithms in Infinite Systems: A Network Model-Based Approach Ding, Yonglong Computational Physics Data Analysis, Statistics and Probability As the particle count escalates, the computational demands of diverse simulation algorithms surge, paralleled by a marked enhancement in accuracy. The question arises whether this heightened precision asymptotically dwindles towards zero or plateaus at a finite constant. To address this, this work introduces an approach that translates infinite systems into finite-node network architectures, providing a rigorous framework for assessing this question. Employing the Monte Carlo algorithm's application to the Ising model as a case study, this paper demonstrate that despite the simulation's extension to an infinite lattice size, a fundamental error bound persists. This work explicitly derive this lower bound on the error, offering a quantitative understanding of the algorithm's limitations in the limit of infinite scale. Furthermore, I extend this methodology to Molecular Dynamics simulations, exemplified through its application to battery systems. This conversion strategy not only underscores the generality of this approach but also highlights its practical significance in guiding the optimization of simulation algorithms. Moreover, it offers insights into estimating micro-level information from macro-level data. The crucial information of Molecular Simulation, namely the potential energy, has been quickly estimated. |
| title | Precision Evaluation Criteria for Simulation Algorithms in Infinite Systems: A Network Model-Based Approach |
| topic | Computational Physics Data Analysis, Statistics and Probability |
| url | https://arxiv.org/abs/2501.03248 |