Showing 1–20 of 21 results
/ Date/ Name
Jun 11, 2018Improved Efficiency of a Multi-Index FEM for Computational Uncertainty QuantificationJan 27, 2016Optimal $L_p$-discrepancy bounds for second order digital sequencesSep 29, 2014Higher Order Quasi Monte-Carlo Integration in Uncertainty QuantificationJun 18, 2013Higher order Sobol' indicesApr 1, 2013The decay of the Walsh coefficients of smooth functionsApr 1, 2013Explicit constructions of quasi-Monte Carlo rules for the numerical integration of high dimensional periodic functionsApr 1, 2013Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high orderMar 11, 2013Discrepancy bounds for uniformly ergodic Markov chain quasi-Monte CarloJan 28, 2013Construction of interlaced scrambled polynomial lattice rules of arbitrary high orderNov 16, 2012Lattice rules for nonperiodic smooth integrandsOct 2, 2012On the fast computation of the weight enumerator polynomial and the $t$ value of digital nets over finite abelian groupsAug 7, 2012Discrepancy bounds for infinite-dimensional order two digital sequences over $\mathbb{F}_2$Jul 23, 2012A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rulesJul 21, 2012Optimal $\mathcal{L}_2$ discrepancy bounds for higher order digital sequences over the finite field $\mathbb{F}_2$Mar 20, 2012A higher order Blokh-Zyablov propagation rule for higher order netsSep 23, 2011Random weights, robust lattice rules and the geometry of the cbc$r$c algorithmSep 15, 2011Point sets on the sphere $\mathbb{S}^2$ with small spherical cap discrepancyJan 28, 2011Quasi-Monte Carlo rules for numerical integration over the unit sphere $\mathbb{S}^2$Jan 24, 2011A simple Proof of Stolarsky's Invariance PrincipleJul 6, 2010Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands