Related papers: Convergent series for lattice models with polynomi…
Using detailed exact results on pair-correlation functions of Z-invariant Ising models, we can write and run algorithms of polynomial complexity to obtain wavevector-dependent susceptibilities for a variety of Ising systems. Reviewing…
Lattice regularizations are pivotal in the non-perturbative quantization of gauge field theories. Wilson's proposal to employ group-valued link fields simplifies the regularization of gauge fields in principal fiber bundles, preserving…
A class of scalar models with non-polynomial interaction, which naturally admits an analytical resummation of the series of tadpole diagrams is studied in perturbation theory. In particular, we focus on a model containing only one…
Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…
This work is a follow-up to our previous work "A numerical approach related to defect-type theories for some weakly random problems in homogenization" (preprint available on this archive). It extends and complements, both theoretically and…
Entangled polymers are an important class of materials for their toughness, processability, and functionalizability. However, physically detailed modeling of highly entangled polymers can prove challenging, especially as one considers…
The theory of summability of divergent series is a major branch of mathematical analysis that has found important applications in engineering and science. It addresses methods of assigning natural values to divergent sums, whose…
We develop and implement new probabilistic strategy for proving exponential ergodicity for interacting diffusion processes on unbounded lattice. The concept of the solution used is rather weak as we construct the process in infinite…
Three techniques for performing gauge-invariant, noncompact lattice simulations of nonabelian gauge theories are discussed. In the first method, the action is not itself gauge invariant, but a kind of lattice gauge invariance is restored by…
To avoid instabilities in the continuum semi-classical limit of loop quantum cosmology models, refinement of the underlying lattice is necessary. The lattice refinement leads to new dynamical difference equations which, in general, do not…
Belief propagation (BP) is a message-passing method for solving probabilistic graphical models. It is very successful in treating disordered models (such as spin glasses) on random graphs. On the other hand, finite-dimensional lattice…
Perturbation theory of a large class of scalar field theories in $d<4$ can be shown to be Borel resummable using arguments based on Lefschetz thimbles. As an example we study in detail the $\lambda \phi^4$ theory in two dimensions in the…
In contrast with the well-known methods of matching asymptotics and multiscale (or compound) asymptotics, the " functional analytic approach " of Lanza de Cristoforis (Analysis 28, 2008) allows to prove convergence of expansions around…
The COntractor REnormalization group (CORE) approximation, a new method for solving Hamiltonian lattice systems, is introduced. The approach combines variational and contraction techniques with the real-space renormalization group approach…
A method of numerically evaluating slowly convergent monotone series is described. First, we apply a condensation transformation due to Van Wijngaarden to the original series. This transforms the original monotone series into an alternating…
We use the scalar model with quartic interaction to illustrate how a nonperturbative variational technique combined with renormalization group (RG) properties efficiently resums perturbative expansions in thermal field theories. The…
A modification of perturbation theory, known as delta-expansion (variationally improved perturbation), gave rigorously convergent series in some D=1 models (oscillator energy levels) with factorially divergent ordinary perturbative…
We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
We derive and discuss a technique for manipulating power series which is complementary to standard procedures. We begin with the translation operator, but we express the operator as an infinite product instead of expanding it as a series…