Related papers: RG decimation-based approach to confinement and co…
We propose a new strategy to evaluate the partition function of lattice QCD with Wilson gauge action coupled to staggered fermions, based on a strong coupling expansion in the inverse bare gauge coupling $\beta= 2N/g^{2}$. Our method makes…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
Large language models (LLMs) have demonstrated impressive abilities in various domains while the inference cost is expensive. Many previous studies exploit quantization methods to reduce LLM inference cost by reducing latency and memory…
Solving structured systems of linear equations in a non-centralized fashion is an important step in many distributed optimization and control algorithms. Fast convergence is required in manifold applications. Known decentralized algorithms,…
Lattice QCD in the strong coupling regime can be formulated in dual variables which are integer-valued. It can be efficiently simulated for modest finite temperatures and finite densities via the worm algorithm, circumventing the finite…
This work develops a provably accurate fully-decentralized alternating projected gradient descent (GD) algorithm for recovering a low rank (LR) matrix from mutually independent projections of each of its columns, in a fast and…
Lagrangian Coherent Structures (LCS) are flow features which are defined to objectively characterize complex fluid behavior over a finite time regardless of the orientation of the observer. Fluidic applications of LCS include geophysical,…
A gauge independent method of obtaining the reduced space of constrained dynamical systems is discussed in a purely lagrangian formalism. Implications of gauge fixing are also considered.
Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify…
We derive an algorithm for compression of the currents and varifolds representations of shapes, using ridge leverage score (RLS) sampling, and the theory of Nystrom approximation in Reproducing Kernel Hilbert Spaces. Our method is faster…
The decay of the Standard Model Higgs boson in the intermediate-mass range into gluons is considered where special emphasis is put on the influence of the leading electroweak corrections proportional to G_F m_t^2. An effective Lagrangian…
Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.
We present a convergence rate analysis for biased stochastic gradient descent (SGD), where individual gradient updates are corrupted by computation errors. We develop stochastic quadratic constraints to formulate a small linear matrix…
We calculate numerically the renormalization group (RG) flow of lattice QCD in two-coupling space, $(\beta_{1\times 1},\beta_{1\times 2})$. This is the first explicit calculation of the RG flow of SU(3) gauge theory. From the RG flow,a…
We determine the graded decompositions of fusion products of finite-dimensional irreducible representations for simple Lie algebras of rank two. Moreover, we give generators and relations for these representations and obtain as a…
We study the detailed properties of Z_2 domain walls in the deconfined high temperature phase of the d=2+1 SU(2) gauge theory. These walls are studied both by computer simulations of the lattice theory and by one-loop perturbative…
In this paper, based on the limited memory techniques and subspace minimization conjugate gradient (SMCG) methods, a regularized limited memory subspace minimization conjugate gradient method is proposed, which contains two types of…
Lagrangian decomposition (LD) is a relaxation method that provides a dual bound for constrained optimization problems by decomposing them into more manageable sub-problems. This bound can be used in branch-and-bound algorithms to prune the…
In this dissertation, we investigate the approach of pure SU(2) lattice gauge theory to its continuum limit using the deconfinement temperature, six gradient scales, and six cooling scales. We find that cooling scales exhibit similarly good…
The partition function of the two-dimensional Ising model on a square lattice with nearest-neighbour interactions and periodic boundary conditions is investigated. Kaufman [Phys. Rev. 76, 1232--1243 (1949)] gave a solution for this function…