Construction algorithms for higher order polynomial lattice rules (Q544121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of generalized Walsh functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The construction of extensible polynomial lattice rules with small weighted star discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DECAY OF THE WALSH COEFFICIENTS OF SMOOTH FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of higher order polynomial lattices based on a generalized figure of merit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction algorithms for polynomial lattice rules for multivariate integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The construction of good extensible rank-1 lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point sets and sequences with small discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-discrepancy point sets obtained by digital constructions over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component-by-component construction of good lattice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? / rank
 
Normal rank

Latest revision as of 04:29, 4 July 2024

scientific article
Language Label Description Also known as
English
Construction algorithms for higher order polynomial lattice rules
scientific article

    Statements

    Construction algorithms for higher order polynomial lattice rules (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2011
    0 references
    numerical integration
    0 references
    quasi-Monte Carlo
    0 references
    polynomial lattice rules
    0 references
    higher order digital nets
    0 references
    convergence
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers