Pages that link to "Item:Q664602"
From MaRDI portal
The following pages link to Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602):
Displayed 11 items.
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence (Q486680) (← links)
- Construction algorithms for higher order polynomial lattice rules (Q544121) (← links)
- Weighted compound integration rules with higher order convergence for all \(N\) (Q663491) (← links)
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order (Q887154) (← links)
- Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights (Q2251914) (← links)
- Constructing good higher order polynomial lattice rules with modulus of reduced degree (Q2254684) (← links)
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces (Q2345667) (← links)
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces (Q2351489) (← links)
- Discrepancy Theory and Quasi-Monte Carlo Integration (Q5264199) (← links)
- A computable figure of merit for quasi-Monte Carlo point sets (Q5401700) (← links)
- Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration (Q5963451) (← links)