15 citations · 40 across the 6 of their papers we have counts for
6 papers
Successive Coordinate Search and Component-by-Component Construction of Rank-1 Lattice Rules
Adrian Ebert, Hernan Leövey, Dirk Nuyens
The (fast) component-by-component (CBC) algorithm is an efficient tool for the construction of generating vectors for quasi-Monte Carlo rank-1 lattice rules in weighted reproducing…
Applying recursive numerical integration techniques for solving high dimensional integrals
Andreas Ammon, Alan Genz, Tobias Hartung +3
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with samples behaves like . This scaling makes it often very time intensive to reduce the error of…
Overcoming the sign problem in 1-dimensional QCD by new integration rules with polynomial exactness
A. Ammon, T. Hartung, K. Jansen +2
In this paper we describe a new integration method for the groups and , for which we verified numerically that it is polynomially exact for . The method is ap…
On the efficient numerical solution of lattice systems with low-order couplings
A. Ammon, A. Genz, T. Hartung +3
We apply the Quasi Monte Carlo (QMC) and recursive numerical integration methods to evaluate the Euclidean, discretized time path-integral for the quantum mechanical anharmonic osc…
Applicability of Quasi-Monte Carlo for lattice systems
Andreas Ammon, Tobias Hartung, Karl Jansen +3
This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theor…
Quasi-Monte Carlo methods for lattice systems: a first look
K. Jansen, H. Leovey, A. Ammon +2
We investigate the applicability of Quasi-Monte Carlo methods to Euclidean lattice systems for quantum mechanics in order to improve the asymptotic error behavior of observables fo…