Construction algorithms for higher order polynomial lattice rules
type: Item
instance of: scholarly article
title: Construction algorithms for higher order polynomial lattice rules
zbMATH Open document ID: 1218.65003
author: Jan Baldeaux
author: Josef Dick
author: Julia Greslehner
author: Friedrich Pillichshammer
published in: Journal of Complexity
publication date: 2011-06-14T00:00:00Z
Mathematics Subject Classification ID: 65D30
Mathematics Subject Classification ID: 11K45
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 5907643
zbMATH Keywords: numerical integration
zbMATH Keywords: quasi-Monte Carlo
zbMATH Keywords: polynomial lattice rules
zbMATH Keywords: higher order digital nets
zbMATH Keywords: convergence
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.jco.2010.06.002
OpenAlex ID: W1980498334
cites work: Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
cites work: A class of generalized Walsh functions
cites work: Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
cites work: The construction of extensible polynomial lattice rules with small weighted star discrepancy
cites work: Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
cites work: THE DECAY OF THE WALSH COEFFICIENTS OF SMOOTH FUNCTIONS
cites work: On the existence of higher order polynomial lattices based on a generalized figure of merit
cites work: Construction algorithms for polynomial lattice rules for multivariate integration
cites work: Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
cites work: Q3160669
cites work: Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
cites work: The construction of good extensible rank-1 lattices
cites work: Q3272128
cites work: Q4003879
cites work: Point sets and sequences with small discrepancy
cites work: Low-discrepancy point sets obtained by digital constructions over finite fields
cites work: Q4889887
cites work: Component-by-component construction of good lattice rules
cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
DOI: 10.1016/J.JCO.2010.06.002
description: scientific article; zbMATH DE number 5907643