Pages that link to "Item:Q544121"
From MaRDI portal
The following pages link to Construction algorithms for higher order polynomial lattice rules (Q544121):
Displaying 19 items.
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence (Q486680) (← links)
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation (Q506617) (← links)
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602) (← links)
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order (Q887154) (← links)
- The existence of good extensible polynomial lattice rules (Q1408505) (← links)
- Constructing good higher order polynomial lattice rules with modulus of reduced degree (Q2254684) (← links)
- The \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital nets (Q2344300) (← 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)
- Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration (Q2404051) (← links)
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions (Q2408931) (← links)
- Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules (Q2465281) (← links)
- On the existence of higher order polynomial lattices based on a generalized figure of merit (Q2465289) (← links)
- Richardson Extrapolation of Polynomial Lattice Rules (Q4646439) (← links)
- Discrepancy Theory and Quasi-Monte Carlo Integration (Q5264199) (← links)
- A computable figure of merit for quasi-Monte Carlo point sets (Q5401700) (← links)
- Richardson extrapolation allows truncation of higher-order digital nets and sequences (Q5857339) (← links)
- A construction of higher-rank lattice rules (Q5938368) (← links)
- Modification of the Maximin and <i>ϕ</i><sub><i>p</i></sub> (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points (Q6636554) (← links)