Eigenvalue-flipping Algorithm for Matrix Monte Carlo
arXiv:2203.05422 · doi:10.1007/JHEP04(2022)149
Abstract
Many physical systems can be described in terms of matrix models that we often cannot solve analytically. Fortunately, they can be studied numerically in a straightforward way. Many commonly used algorithms follow the Monte Carlo method, which is efficient for small matrix sizes but cannot guarantee ergodicity when working with large ones. In this paper, we propose an improvement of the algorithm that, for a large class of matrix models, allows to tunnel between various vacua in a proficient way, where sign change of eigenvalues is proposed externally. We test the method on two models: the pure potential matrix model and the scalar field theory on the fuzzy sphere.
arXiv commentv2: minor corrections, references added
References in corpus (15)
- M Theory As A Matrix Model: A Conjecture
- Random Matrix Theories in Quantum Physics: Common Concepts
- Quantum Field Theory on Noncommutative Spaces
- The Non-Commutative Geometry of the Quantum Hall Effect
- Holographic description of quantum black hole on a computer
- Phase structure of non-commutative scalar field theories
- Numerical simulations of a non-commutative theory: the scalar model on the fuzzy sphere
- Simulation of a scalar field on a fuzzy sphere
- Noncommutative Field Theory: Numerical Analysis with the Fuzzy Disc
- Monte Carlo simulations of random non-commutative geometries
- New Algorithm and Phase Diagram of Noncommutative Phi**4 on the Fuzzy Sphere
- Second moment fuzzy-field-theory-like matrix models
- Asymmetric hermitian matrix models and fuzzy field theory
- Triple Point of a Scalar Field Theory on a Fuzzy Sphere
- Light Hadron Masses from a Matrix Model for QCD