相关论文: A Construction of Polynomial Lattice Rules with Sm…
In this paper, we study an efficient algorithm for constructing node sets of high-quality quasi-Monte Carlo integration rules for weighted Korobov, Walsh, and Sobolev spaces. The algorithm presented is a reduced fast successive coordinate…
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-$1$ lattice rule to approximate an $s$-dimensional integral is fully specified by its \emph{generating vector}…
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 kernel Hilbert spaces. We consider product weights, which…
In the random case setting, scrambled polynomial lattice rules as discussed in \cite{BD10} enjoy more favourable strong tractablility properties than scrambled digital nets. This short note discusses the application of scrambled polynomial…
We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…
Randomized quasi-Monte Carlo, via certain scramblings of digital nets, produces unbiased estimates of $\int_{[0,1]^d}f(\boldsymbol{x})\,\mathrm{d}\boldsymbol{x}$ with a variance that is $o(1/n)$ for any $f\in L^2[0,1]^d$. It also satisfies…
We study a randomized quadrature algorithm to approximate the integral of periodic functions defined over the high-dimensional unit cube. Recent work by Kritzer, Kuo, Nuyens and Ullrich (2019) shows that rank-1 lattice rules with a randomly…
We propose a new sparse regression method called the component lasso, based on a simple idea. The method uses the connected-components structure of the sample covariance matrix to split the problem into smaller ones. It then solves the…
We study the multivariate integration problem for periodic functions from the weighted Korobov space in the randomized setting. We introduce a new randomized rank-1 lattice rule with a randomly chosen number of points, which avoids the need…
We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…
We consider the problem of evaluating $I(\varphi):=\int_{[0,1)^s}\varphi(x) dx$ for a function $\varphi \in L^2[0,1)^{s}$. In situations where $I(\varphi)$ can be approximated by an estimate of the form $N^{-1}\sum_{n=0}^{N-1}\varphi(x^n)$,…
We describe a class of growth algorithms for finding low energy states of heteropolymers. These polymers form toy models for proteins, and the hope is that similar methods will ultimately be useful for finding native states of real proteins…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
In this paper we investigate the integrability of two-dimensional partial difference equations using the newly developed techniques of study of the degree of the iterates. We show that while for generic, nonintegrable equations, the degree…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
Lattice-type structures can provide a combination of stiffness with light weight that is desirable in a variety of applications. Design optimization of these structures must rely on approximations of the governing physics to render solution…
Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The…
The component-by-component (CBC) algorithm is a method for constructing good generating vectors for lattice rules for the efficient computation of high-dimensional integrals in the "weighted" function space setting introduced by Sloan and…
In this note, we study a concatenation of quasi-Monte Carlo and plain Monte Carlo rules for high-dimensional numerical integration in weighted function spaces. In particular, we consider approximating the integral of periodic functions…
Higher order digital nets are special classes of point sets for quasi-Monte Carlo rules which achieve the optimal convergence rate for numerical integration of smooth functions. An explicit construction of higher order digital nets was…