Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.29077 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918528808910848 |
|---|---|
| author | Kováčik, Samuel Hrmo, Matej |
| author_facet | Kováčik, Samuel Hrmo, Matej |
| contents | Various physical models can be expressed in terms of matrices. A valuable tool for analysing matrix models is numerical simulations, often the Metropolis algorithm with various improvements. The downside of this approach is that the simulation may become stuck in a vacuous state, and probing the relevant parts of the configuration space might be difficult. Here, we propose an algorithm that moves around a cluster of eigenvalues and show that it converges to the true vacuum state. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29077 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Eigenvalue-cluster Algorithm for Matrix Monte Carlo Kováčik, Samuel Hrmo, Matej High Energy Physics - Lattice Various physical models can be expressed in terms of matrices. A valuable tool for analysing matrix models is numerical simulations, often the Metropolis algorithm with various improvements. The downside of this approach is that the simulation may become stuck in a vacuous state, and probing the relevant parts of the configuration space might be difficult. Here, we propose an algorithm that moves around a cluster of eigenvalues and show that it converges to the true vacuum state. |
| title | Eigenvalue-cluster Algorithm for Matrix Monte Carlo |
| topic | High Energy Physics - Lattice |
| url | https://arxiv.org/abs/2605.29077 |