Related papers: Computing Masses from Effective Transfer Matrices

We present a new Monte Carlo algorithm that allows the simultaneous determination of a few extremal eigenpairs of a very large matrix. It extends the power method and uses a new sampling method, the sewing method, that does a large state…

In this paper the exact solution and correlation functions for a double-chain Ising model with multi-spin interactions and symmetric Hamiltonian density are obtained. The study employs the transfer matrix method to derive fundamental…

The partition function of the symmetric (zero electric field) eight-vertex model on a square lattice can be formulated either in the original "electric" vertex format or in an equivalent "magnetic" Ising-spin format. In this paper, both…

We present powerful new analysis techniques to constrain effective field theories at the LHC. By leveraging the structure of particle physics processes, we extract extra information from Monte-Carlo simulations, which can be used to train…

By including elements of the density matrix formalism, the semiclassical ensemble Monte Carlo method for carrier transport is extended to incorporate incoherent tunneling, known to play an important role in quantum cascade lasers (QCLs). In…

Statistical emulators of computer simulators have proven to be useful in a variety of applications. The widely adopted model for emulator building, using a Gaussian process model with strictly positive correlation function, is…

Monte Carlo simulation using a combination of Wang Landau (WL) and Transition Matrix (TM) Monte Carlo algorithms to simulate two lattice spin models with continuous energy is described. One of the models, the one dimensional Lebwohl-Lasher…

We develop a transfer matrix method to compute exactly the spin-spin correlation functions of Bethe lattice spin models in the external magnetic field h and for any temperature T. We first compute the correlation function for the most…

We study a class of statistical systems which simulate 3D gonihedric system on euclidean lattice. We have found the exact partition function of the 3D-model and the corresponding critical indices analysing the transfer matrix…

We introduce a method for calculating individual elements of matrix functions. Our technique makes use of a novel series expansion for the action of matrix functions on basis vectors that is memory efficient even for very large matrices. We…

In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…

Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on…

We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…

Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…

How to construct a suitable measurement matrix is still an open question in compressed sensing. A significant part of the recent work is that the measurement matrices are not completely random on the entries but exhibit considerable…

We consider a three-dimensional effective theory of Polyakov lines derived previously from lattice Yang-Mills theory and QCD by means of a resummed strong coupling expansion. The effective theory is useful for investigations of the phase…

We report single-cluster Monte Carlo simulations of the Ising model on three-dimensional Poissonian random lattices with up to 128,000 approx. 503 sites which are linked together according to the Voronoi/Delaunay prescription. For each…

We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…

An efficient algorithm is constructed for contracting two-dimensional tensor networks under periodic boundary conditions. The central ingredient is a novel renormalization step that scales linearly with system size, i.e. from $L \to L+1$.…

We start from a low-energy effective field theory for interacting fermions on the lattice and expand in the hopping parameter to derive the nearest-neighbor interactions for a lattice gas model. In this model the renormalization of…