Constructions of general polynomial lattices for multivariate integration
From MaRDI portal
Publication:5756325
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
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- A class of generalized Walsh functions
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- Construction algorithms for polynomial lattice rules for multivariate integration
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Fast component-by-component construction, a reprise for different kernels
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
- Point sets and sequences with small discrepancy
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- The existence of good extensible polynomial lattice rules
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Cited in
(15)- Construction algorithms for polynomial lattice rules for multivariate integration
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- 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
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- Multivariate integration in the Hilbert space \(H_{W(b), \alpha, \beta, \gamma}\)
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
- On the component by component construction of polynomial lattice point sets for numerical integration in weighted Sobolev spaces
- scientific article; zbMATH DE number 2051209 (Why is no real title available?)
- Extensible hyperplane nets
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
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)
