Sciweavers

5 search results - page 1 / 1
» Component-by-component construction of good lattice rules
Sort
View
COMPUTING
2007
118views more  COMPUTING 2007»
13 years 4 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
MOC
2002
80views more  MOC 2002»
13 years 4 months ago
Component-by-component construction of good lattice rules
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theore...
Ian H. Sloan, Andrew V. Reztsov
JC
2006
86views more  JC 2006»
13 years 4 months ago
Randomly shifted lattice rules for unbounded integrands
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin ...
JC
2006
115views more  JC 2006»
13 years 4 months ago
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 9 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill