Large N Optimization for multi-matrix systems

Abstract

In this work we revisit the problem of solving multi-matrix systems through numerical large $N$ methods. The framework is a collective, loop space representation which provides a constrained optimization problem, addressed through master-field minimization. This scheme applies both to multi-matrix integrals ($c=0$ systems) and multi-matrix quantum mechanics ($c=1$). The complete fluctuation spectrum is also computable in the above scheme, and is of immediate physical relevance in the later case. The complexity (and the growth of degrees of freedom) at large $N$ have stymied earlier attempts and in the present work we present significant improvements in this regard. The (constrained) minimization and spectrum calculations are easily achieved with close to $10^4$ variables, giving solution to Migdal-Makeenko, and collective field equations. Considering the large number of dynamical (loop) variables and the extreme nonlinearity of the problem, high precision is obtained when confronted with solvable cases. Through numerical results presented, we prove that our scheme solves, by numerical loop space methods, the general two matrix model problem.

38 pages. v2: minor typos corrected and refs added. v3: Published version

References in corpus (6)

• Monte Carlo studies of supersymmetric matrix quantum mechanics with sixteen supercharges at finite temperature
• Analytic and Numerical Bootstrap for One-Matrix Model and "Unsolvable" Two-Matrix Model
• Anatomy of Deconfinement
• Emergent Cosmology from Matrix Theory
• D-instantons, String Field Theory and Two Dimensional String Theory
• Toward simulating Superstring/M-theory on a quantum computer

Cited by in corpus (2)

• Numerical Bootstrap in Quantum Mechanics
• Bootstrapping Calabi-Yau Quantum Mechanics