Related papers: Algorithms for dynamical overlap fermions
The modern design of industrial structures leads to very complex simulations characterized by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization may be, such an analysis leads to the solution to a family…
First applications of the new algorithm simulating dynamical fermions are reported. The method reproduces previous results obtained with different techniques.
We extend our sum over topologies formula to fermions. We show that fermionic fields display an instability with respect to topology fluctuations. We present some phenomenological arguments for a modification of the action in the case of…
Recent results concerning the relation of topology and low-lying fermion modes are summarized.
The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their…
Dynamic graph algorithms have seen significant theoretical advancements, but practical evaluations often lag behind. This work bridges the gap between theory and practice by engineering and empirically evaluating recently developed…
After a brief introduction to the overlap two examples relating to topological properties of chiral fermion systems in interaction with gauge fields are presented: It is shown how the overlap preserves the continuum structure of exact…
This thesis is focused on the implementation and the application of a novel kind of algorithm which is expected to overcome the limitations of older schemes. This new algorithm is named Multiboson Method. It allows to simulate an arbitrary…
Recent lattice measurements of the topological susceptibility of SU(2) gauge theory using improved cooling and inverse-blocking are in disagreement. We use the overlap method, which probes the fermionic sector of the theory directly, to…
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical algorithms for balanced (hyper)graph partitioning together…
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
Efficient network design, construction and analysis are important topics, considering the highly dynamic environment in which data communication occurs nowadays. In this paper we address several problems concerning these topics from an…
Dynamic algorithm selection aims to exploit the complementarity of multiple optimization algorithms by switching between them during the search. While these kinds of dynamic algorithms have been shown to have potential to outperform their…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
We define a sparse hermitian lattice Dirac matrix, $H$, coupling $2n+1$ Dirac fermions. When $2n$ fermions are integrated out the induced action for the last fermion is a rational approximation to the hermitian overlap Dirac operator. We…
The dynamic load balancing algorithm based on the monitoring server load, self-similar characteristics of passing traffic have to provide a statistically uniform load distribution on servers, high performance, fault tolerance and capacity,…
I review how the phenomenology of localization applies to fermions in lattice gauge theory, present measurements of the localization length and other quantities, and discuss the consequences for things like the overlap kernel.
Algorithms which compute properties over graphs have always been of interest in computer science, with some of the fundamental algorithms, such as Dijkstra's algorithm, dating back to the 50s. Since the 70s there as been interest in…
We report on a calculation of $B_K$ with two-flavor dynamical overlap fermions on a $16^3 \times 32$ lattice at $a\sim 0.12$ fm. The results are compared with the PQChPT prediction of quark mass dependence. The systematic errors due to…