نتایج جستجو برای: wilson algorithm

تعداد نتایج: 770670  

2005
Martin Hasenbusch

We give some new performance results for the Hybrid Monte Carlo (HMC) simulation of dynamical clover-improved Wilson fermions using an improved pseudo-fermion action. The generalisation of even-odd preconditioning for the standard Wilson fermion matrix to the clover-improved case is not unique. In the literature the so called symmetric and asymmetric versions are discussed. Most of the previous...

2007
Morten Nielsen

We consider the problem of recovering a structured sparse representation of a signal in an overcomplete time-frequency dictionary with a particular structure. For infinite dictionaries that are the union of a nice wavelet basis and a Wilson basis, sufficient conditions are given for the Basis Pursuit and (Orthogonal) Matching Pursuit algorithms to recover a structured representation of an admis...

Journal: :Synthese 2009
Lawrence Shapiro

The discovery of mirror neurons has been hailed as one of the most 1 exciting developments in neuroscience in the past few decades. These neurons dis2 charge in response to the observation of others’ actions. But how are we to understand 3 the function of these neurons? In this paper I defend the idea that mirror neurons are 4 best conceived as components of a sensory system that has the functi...

2001
B. K. Agrawal Tapas Sil S. K. Samaddar J. N. De

2001
Bong H. Lian Kefeng Liu Shing-Tung Yau

This is a continuation of Mirror Principle III [14].

2008
Bong H. Lian Kefeng Liu Shing-Tung Yau

This is a continuation of Mirror Principle III [14].

2008
João Faria Martins Roger Picken

We define the fundamental strict categorical group P2(M, ∗) of a based smooth manifold (M, ∗) and construct categorical holonomies, being smooth morphisms P2(M, ∗) → C(G), where C(G) is a Lie categorical group, by using a notion of categorical connections, which we define. As a result, we are able to define Wilson spheres in this context.

1998
M. Hasenbusch

We propose various improvements of finite step-size updating for full QCD on the lattice that might turn finite step-size updating into a viable alternative to the hybrid Monte Carlo algorithm. These improvements are noise reduction of the noisy estimator of the fermion determinant, unbiased inclusion of the hopping parameter expansion and a multi-level Metropolis scheme. First numerical tests ...

2007
Martin Hasenbusch

We study a variant of the Schwarz-preconditioned HMC algorithm. In contrast to the original proposal of Lüscher, we apply the domain decomposition in one lattice direction only. This is sufficient to reduce the condition number of the fermion matrix restricted to the domains compared with the full fermion matrix. For the same linear extension of the domain, less links reside on the boundaries o...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید