Constructions of general polynomial lattices for multivariate integration
DOI10.1017/S0004972700039496zbMATH Open1125.65006MaRDI QIDQ5756325FDOQ5756325
Authors: Peter Kritzer, Friedrich Pillichshammer 
Publication date: 4 September 2007
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Recommendations
- Construction algorithms for polynomial lattice rules for multivariate integration
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
reproducing kernel Hilbert spacesalgorithmgenerating vectorLaurent seriesWalsh functionscomponent-by-component constructionquasi-Monte Carlo methodpolynomial lattice rulesworst-case integration error
Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Title not available (Why is that?)
- A class of generalized Walsh functions
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Point sets and sequences with small discrepancy
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Construction algorithms for polynomial lattice rules for multivariate integration
- Fast component-by-component construction, a reprise for different kernels
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- The existence of good extensible polynomial lattice rules
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
Cited In (15)
- Construction algorithms for polynomial lattice rules for multivariate integration
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- A construction of polynomial lattice rules with small gain coefficients
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- Construction algorithms for good extensible lattice rules
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- On the component by component construction of polynomial lattice point sets for numerical integration in weighted Sobolev spaces
- Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
- Extensible hyperplane nets
- Multivariate integration in the Hilbert space \(H_{W(b), \alpha, \beta, \gamma}\)
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Title not available (Why is that?)
This page was built for publication: Constructions of general polynomial lattices for multivariate integration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756325)
