Pages that link to "Item:Q2254684"

The following pages link to Constructing good higher order polynomial lattice rules with modulus of reduced degree (Q2254684):

Displaying 9 items.

• Construction algorithms for higher order polynomial lattice rules (Q544121) (← links)
• Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602) (← links)
• The existence of good extensible polynomial lattice rules (Q1408505) (← links)
• The \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital nets (Q2344300) (← links)
• Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces (Q2351489) (← links)
• Reducing the construction cost of the component-by-component construction of good lattice rules (Q4813619) (← links)
• Richardson extrapolation allows truncation of higher-order digital nets and sequences (Q5857339) (← links)
• A construction of higher-rank lattice rules (Q5938368) (← links)
• Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration (Q5963451) (← links)