Search Results - "DICK, JOSEF"
-
1
Walsh Spaces Containing Smooth Functions and Quasi-Monte Carlo Rules of Arbitrary High Order
Published in SIAM journal on numerical analysis (01-01-2008)“…We define a Walsh space which contains all functions whose partial mixed derivatives up to order 6 ≥ 1 exist and have finite variation. In particular, for a…”
Get full text
Journal Article -
2
Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm
Published in Journal of computational and applied mathematics (15-01-2021)“…We study quasi-Monte Carlo (QMC) methods for numerical integration of multivariate functions defined over the high-dimensional unit cube. Lattice rules and…”
Get full text
Journal Article -
3
Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
Published in Journal of approximation theory (01-07-2014)“…We introduce quasi-Monte Carlo rules for the numerical integration of functions f defined on [0,1]s, s≥1, which satisfy the following properties: the Fourier,…”
Get full text
Journal Article -
4
Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
Published in SIAM journal on numerical analysis (01-01-2007)“…In this paper, we give explicit constructions of point sets in the s-dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate…”
Get full text
Journal Article -
5
Construction of Interlaced Scrambled Polynomial Lattice Rules of Arbitrary High Order
Published in Foundations of computational mathematics (01-10-2015)“…Higher order scrambled digital nets are randomized quasi-Monte Carlo rules which have recently been introduced by Dick (Ann Stat 39:1372–1398, 2011 ) and shown…”
Get full text
Journal Article -
6
Random weights, robust lattice rules and the geometry of the cbcrc algorithm
Published in Numerische Mathematik (01-11-2012)“…In this paper we study lattice rules which are cubature formulae to approximate integrands over the unit cube [0,1] s from a weighted reproducing kernel…”
Get full text
Journal Article -
7
Lattice rules for nonperiodic smooth integrands
Published in Numerische Mathematik (01-02-2014)“…The aim of this paper is to show that one can achieve convergence rates of N − α + δ for α > 1 / 2 (and for δ > 0 arbitrarily small) for nonperiodic α -smooth…”
Get full text
Journal Article -
8
The weighted star discrepancy of Korobov's p-sets
Published in Proceedings of the American Mathematical Society (01-12-2015)“…We prove bounds on the weighted star discrepancy of the p. This implies strong polynomial tractability for the weighted star discrepancy. We also show that a…”
Get full text
Journal Article -
9
A simple proof of Stolarsky's invariance principle
Published in Proceedings of the American Mathematical Society (01-06-2013)“…-discrepancy and vice versa. In this note we give a simple proof of the invariance principle using reproducing kernel Hilbert spaces.]]>…”
Get full text
Journal Article -
10
Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
Published in The Annals of statistics (01-06-2011)Get full text
Journal Article -
11
DISCREPANCY BOUNDS FOR UNIFORMLY ERGODIC MARKOV CHAIN QUASI-MONTE CARLO
Published in The Annals of applied probability (01-10-2016)“…Markov chains can be used to generate samples whose distribution approximates a given target distribution. The quality of the samples of such Markov chains can…”
Get full text
Journal Article -
12
Construction of interlaced polynomial lattice rules for infinitely differentiable functions
Published in Numerische Mathematik (01-10-2017)“…We study multivariate integration over the s -dimensional unit cube in a weighted space of infinitely differentiable functions. It is known from a recent…”
Get full text
Journal Article -
13
Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
Published in Proceedings of the American Mathematical Society (01-08-2017)“…We study high-dimensional numerical integration in the worst-case setting. The subject of tractability is concerned with the dependence of the worst-case…”
Get full text
Journal Article -
14
On a projection-corrected component-by-component construction
Published in Journal of Complexity (01-02-2016)“…The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several…”
Get full text
Journal Article -
15
Exponential convergence and tractability of multivariate integration for Korobov spaces
Published in Mathematics of computation (01-05-2011)“…In this paper we study multivariate integration for a weighted Korobov space for which the Fourier coefficients of the functions decay exponentially fast. This…”
Get full text
Journal Article -
16
The construction of extensible polynomial lattice rules with small weighted star discrepancy
Published in Mathematics of computation (01-10-2007)“…In this paper we introduce a construction algorithm for extensible polynomial lattice rules and we prove that the construction algorithm yields generating…”
Get full text
Journal Article -
17
Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
Published in Numerical algorithms (01-03-2012)“…We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate…”
Get full text
Journal Article -
18
Multilevel Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations
Published in SIAM journal on numerical analysis (01-01-2016)Get full text
Journal Article -
19
Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices
Published in Annali di matematica pura ed applicata (01-02-2018)“…We prove upper bounds on the order of convergence of lattice-based algorithms for numerical integration in function spaces of dominating mixed smoothness on…”
Get full text
Journal Article -
20
On the convergence rate of the component-by-component construction of good lattice rules
Published in Journal of Complexity (01-08-2004)“…We prove error bounds on the worst-case error for integration in certain Korobov and Sobolev spaces using rank-1 lattice rules with generating vectors…”
Get full text
Journal Article