English
Related papers

Related papers: Solvable Matrix Models

200 papers

We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…

High Energy Physics - Theory · Physics 2009-10-30 C. - W. H. Lee , S. G. Rajeev

This paper investigates scalable frame in ${\mathbb R}^n$. We define the reduced diagram matrix of a frame and use it to classify scalability of the frame under some conditions. We give a new approach to the scaling problem by breaking the…

Functional Analysis · Mathematics 2022-11-22 Peter G. Casazza , Laura De Carli , Tin T. Tran

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…

Optimization and Control · Mathematics 2025-07-23 Elvira Moreno , Venkat Chandrasekaran

One approach to parametric and adaptive model reduction is via the interpolation of orthogonal bases, subspaces or positive definite system matrices. In all these cases, the sampled inputs stem from matrix sets that feature a geometric…

Numerical Analysis · Mathematics 2022-12-16 Ralf Zimmermann

In this paper we apply a scaling invariance analysis to reduce a class of parabolic moving boundary problems to free boundary problems governed by ordinary differential equations. As well known free boundary problems are always non-linear…

Numerical Analysis · Mathematics 2015-03-03 Riccardo Fazio

The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…

Numerical Analysis · Mathematics 2012-06-21 Andrew M. Bradley , Walter Murray

Matrices are said to behave as free non-commuting random variables if the action which governs their dynamics constrains only their eigenvalues, i.e. depends on traces of powers of individual matrices. The authors use recently developed…

High Energy Physics - Theory · Physics 2009-10-30 Michael Engelhardt , Shimon Levit

When using finite element and finite difference methods to approximate eigenvalues of $2m^{th}$-order elliptic problems, the number of reliable numerical eigenvalues can be estimated in terms of the total degrees of freedom $N$ in resulting…

Numerical Analysis · Mathematics 2013-12-25 Zhimin Zhang

The double scaling limit of a new class of the multi-matrix models proposed in \cite{MMM91}, which possess the $W$-symmetry at the discrete level, is investigated in details. These models are demonstrated to fall into the same universality…

High Energy Physics - Theory · Physics 2009-10-22 A. Mironov , S. Pakuliak

A modification of Newton's method for solving systems of $n$ nonlinear equations is presented. The new matrix-free method relies on a given decomposition of the invertible Jacobian of the residual into invertible sparse local Jacobians…

Numerical Analysis · Mathematics 2023-05-08 Uwe Naumann

We propose a new type of reduction for integrable systems of coupled matrix PDEs; this reduction equates one matrix variable with the transposition of another multiplied by an antisymmetric constant matrix. Via this reduction, we obtain a…

Exactly Solvable and Integrable Systems · Physics 2011-12-30 Takayuki Tsuchida

In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data analysis tools. We first explore the difficulties of the…

Artificial Intelligence · Computer Science 2009-04-22 Nikolaos Vasiloglou , Alexander G. Gray , David V. Anderson

I review some recent works on the Hermitean one-matrix and d-dimensional gauge-invariant matrix models. Special attention is paid to solving the models at large-N by the loop equations. For the one-matrix model the main result concerns…

High Energy Physics - Theory · Physics 2007-05-23 Yu. Makeenko

Following the procedures by which O(N)-invariant real vector models and their large-N behavior have previously been solved, we extend similar techniques to the study of real symmetric N x N-matrix models with O(N)-invariant interactions.…

High Energy Physics - Theory · Physics 2015-06-18 John R. Klauder

In this paper we consider different model reduction techniques for systems with moving loads. Due to the time-dependency of the input and output matrices, the application of time-varying projection matrices for the reduction offers new…

Dynamical Systems · Mathematics 2016-07-12 Maria Cruz Varona , Boris Lohmann

Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The…

High Energy Physics - Lattice · Physics 2023-06-19 Paul Lashomb , Ronald B. Morgan , Travis Whyte , Walter Wilcox

We compute the pseudo complexity of purification corresponding to the reduced transition matrices for free scalar field theories with an arbitrary dynamical exponent. We plot the behaviour of complexity with various parameters of the theory…

High Energy Physics - Theory · Physics 2022-10-18 Aranya Bhattacharya , Arpan Bhattacharyya , Sabyasachi Maulik

Several reductions of the bosonic BMN matrix model equations to ordinary point particle Hamiltonian dynamics in the plane (or R^3) are given - as well as a few explicit solutions (some of which, as N->infinity, correspond to membranes…

High Energy Physics - Theory · Physics 2007-05-23 Joakim Arnlind , Jens Hoppe

We present an algorithm of the reduction of the differential equations for master integrals the Fuchsian form with the right-hand side matrix linearly depending on dimensional regularization parameter $\epsilon$. We consider linear…

High Energy Physics - Phenomenology · Physics 2015-05-20 Roman N. Lee

In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…

Computational Complexity · Computer Science 2023-06-05 Dimitri Watel , Pierre-Louis Poirion