Related papers: Exact diagonalization of the Hubbard model on grap…
We consider Monte Carlo simulations of classical spin models of statistical mechanics using the massively parallel architecture provided by graphics processing units (GPUs). We discuss simulations of models with discrete and continuous…
We implement exact triangle counting in graphs on the GPU using three different methodologies: subgraph matching to a triangle pattern; programmable graph analytics, with a set-intersection approach; and a matrix formulation based on sparse…
The exponential growth of floating point power in graphics processing units (GPUs), together with their low cost, has given rise to an attractive platform upon which to deploy lattice QCD calculations. GPUs are essentially many (O(100))…
In the case of a two-leg Hubbard ladder we present a procedure which allows the exact deduction of the ground state for the four particle problem in arbitrary large lattice system, in a tractable manner, which involves only a reduced…
In this paper we propose a lightning fast graph embedding method called one-hot graph encoder embedding. It has a linear computational complexity and the capacity to process billions of edges within minutes on standard PC -- making it an…
A modern graphics processing unit (GPU) is able to perform massively parallel scientific computations at low cost. We extend our implementation of the checkerboard algorithm for the two dimensional Ising model [T. Preis et al., J. Comp.…
Genetic Programming (GP) is a computationally intensive technique which also has a high degree of natural parallelism. Parallel computing architectures have become commonplace especially with regards Graphics Processing Units (GPU). Hence,…
We present exact explicit analytical results describing the exact ground state of four electrons in a two dimensional square Hubbard cluster containing 16 sites taken with periodic boundary conditions. The presented procedure, which works…
We study the possibility of controlling the finite size corrections in exact diagonalization studies quantitatively. We consider the one- and two dimensional Hubbard model. We show that the finite-size corrections can be be reduced…
We report numerical results on solving constrained linear-quadratic model predictive control (MPC) problems by exploiting graphics processing units (GPUs). The presented method reduces the MPC problem by eliminating the state variables and…
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…
[Abridged] We present the results of a highly parallel Kepler equation solver using the Graphics Processing Unit (GPU) on a commercial nVidia GeForce 280GTX and the "Compute Unified Device Architecture" programming environment. We apply…
We investigate ground state properties of a quasi-one-dimensional electron-lattice coupled model for quarter-filled molecular conductors. The effective one-dimensional extended Hubbard model coupled to adiabatic lattice degree of freedom is…
In the paper the thermodynamics of a cubic cluster with 8 sites at quarter filling is characterized by means of exact diagonalization technique. Particular emphasis is put on the behaviour of such response functions as specific heat and…
Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under certain probabilistic models such as Markov random fields. However, for many computer vision problems, the MAP solution under the model is…
Parallel computing can offer an enormous advantage regarding the performance for very large applications in almost any field: scientific computing, computer vision, databases, data mining, and economics. GPUs are high performance many-core…
Ground state energies and on-site density-density correlations are calculated for the 1-D Hubbard model using a linear combination of the Hubbard projection operators. The mean-field coefficients in the resulting linearized Equations of…
In this work, we consider the solution of boundary integral equations by means of a scalable hierarchical matrix approach on clusters equipped with graphics hardware, i.e. graphics processing units (GPUs). To this end, we extend our…
We present a massively parallel Lagrange decomposition method for solving 0--1 integer linear programs occurring in structured prediction. We propose a new iterative update scheme for solving the Lagrangean dual and a perturbation technique…
We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption…