Related papers: Comparison of two quantum-cluster approximations
We reply to the comment by K. Aryanpour, Th. Maier and M. Jarrell (cond-mat/0301460) on our paper (Phys. Rev. B {\bf 65} 155112 (2002)). We demonstrate using general arguments and explicit examples that whenever the correlation length is…
We develop, clarify and test various aspects of cluster methods dynamical mean field methods using a soluble toy model as a benchmark. We find that the Cellular Dynamical Mean Field Theory (C-DMFT) converges very rapidly and compare its…
The geometrical mapping of algebraic nuclear cluster models is investigated within the coherent state formalism. Two models are considered: the Semimicroscopic Algebraic Cluster Model (SACM) and the Phenomenological Algebraic Cluster Model…
We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach…
In fully-dynamic consistent clustering, we are given a finite metric space $(M,d)$, and a set $F\subseteq M$ of possible locations for opening centers. Data points arrive and depart, and the goal is to maintain an approximately optimal…
We extend the single-site coherent potential approximation (CPA) to include the effects of non-local disorder correlations (alloy short-range order) on the electronic structure of random alloy systems. This is achieved by mapping the…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
This paper introduces a novel methodology of adapting the representation of videos based on the dynamics of their scene content variation. In particular, we demonstrate how the clustering of dynamic mode decomposition eigenvalues can be…
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalable, meaning that the local memory in each machine may be…
We study the continuous-time structure of the difference-of-convex algorithm (DCA) for smooth DC decompositions with a strongly convex component. In dual coordinates, classical DCA is exactly the full-step explicit Euler discretization of a…
We simulate 50 off-lattice DLA clusters, one million particles each. The probability distribution of the angle of attachment of arriving particles with respect to the local radial direction is obtained numerically. For increasing cluster…
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Loschmidt echo, FD) in a classically chaotic system. It was thought that such evaluation would be intractable, but instead we show that a…
D-theory provides an alternative lattice regularization of the (1+1)-d CP(N-1) quantum field theory. In this formulation the continuous classical CP(N-1) fields emerge from the dimensional reduction of discrete SU(N) quantum spins. In…
The variational cluster approximation (VCA) proposed by M. Potthoff {\it et al.} [Phys. Rev. Lett. {\bf 91}, 206402 (2003)] is extended to electron or spin systems with nonlocal interactions. By introducing more than one source field in the…
Recently the nonlocal coherent-potential approximation (NLCPA) has been introduced by Jarrell and Krishnamurthy for describing the electronic structure of substitutionally disordered systems. The NLCPA provides systematic corrections to the…
The fundamental non-Hermitian nature of the forms of coupled-cluster (CC) theory widely used in quantum chemistry has usually been viewed as a negative, but the present letter shows how this can be used to advantage. Specifically, the…
Generalized gradient approximated (GGA) density functional theory (DFT) typically overestimates polarizability and bond-lengths, and underestimates force constants of covalent bonds. To overcome this problem we show that one can use…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
The formation and motion of lattice defects such as cracks, dislocations, or grain boundaries, occurs when the lattice configuration loses stability, that is, when an eigenvalue of the Hessian of the lattice energy functional becomes…
Motion Cueing Algorithms (MCAs) encode the movement of simulated vehicles into movement that can be reproduced with a motion simulator to provide a realistic driving experience within the capabilities of the machine. This paper introduces a…