Related papers: Transition Matrix Cluster Algorithms
First-order transitions of system where both lattice site occupancy and lattice spacing fluctuate, such as cluster crystals, cannot be efficiently studied by traditional simulation methods. These methods necessarily fix one of these two…
The essential role of synthetic spin-orbit coupling in discovering new topological matter phases with cold atoms is widely acknowledged. However, the engineering of spin-orbit coupling remains unclear for arbitrary-spin models due to the…
The growing share of renewable energy makes the optimization of power flows in power system models computationally more complicated, due to the widely distributed weather-dependent electricity generation. This article evaluates two methods…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest $w$ elements should be used for analysis. The goal is to design algorithms that update the solution efficiently with each…
The growth of big data in domains such as Earth Sciences, Social Networks, Physical Sciences, etc. has lead to an immense need for efficient and scalable linear algebra operations, e.g. Matrix inversion. Existing methods for efficient and…
We present a method for quantum state tomography that enables the efficient estimation, with fixed precision, of any of the matrix elements of the density matrix of a state, provided that the states from the basis in which the matrix is…
In this paper we present a method for matrix inversion based on Cholesky decomposition with reduced number of operations by avoiding computation of intermediate results; further, we use fixed point simulations to compare the numerical…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
Mean shift is a simple interactive procedure that gradually shifts data points towards the mode which denotes the highest density of data points in the region. Mean shift algorithms have been effectively used for data denoising, mode…
For recursive circular filtering based on circular statistics, we introduce a general framework for estimation of a circular state based on different circular distributions, specifically the wrapped normal distribution and the von Mises…
We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific…
Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
The aim of this work is to present a formulation to solve the one-dimensional Ising model using the elementary technique of mathematical induction. This formulation is physically clear and leads to the same partition function form as the…
Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap…
In recent years, the fervent demand for computational power across various domains has prompted hardware manufacturers to introduce specialized computing hardware aimed at enhancing computational capabilities. Particularly, the utilization…
Sharp-momentum transition matrix elements for scattering from a short-range Gaussian potential are computed using a real-time path integral. The computation is based on a numerical implementation of a new interpretation of the path integral…
We describe new methods for deciding the stability of switching systems. The methods build on two ideas previously appeared in the literature: the polytope norm iterative construction, and the lifting procedure. Moreover, the combination of…
In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by…