Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules (Q2465281): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Theory of Reproducing Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of generalized Walsh functions / 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: Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order / 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: Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Walsh Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur angenäherten Berechnung mehrfacher Integrale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Integration of Walsh Series by Number-Theoretic Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668806 / 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: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Digital Nets, Hyperplane Nets, and Multivariate Integration in Sobolev Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower estimate for the error of quadrature formulae for certain classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? / rank
 
Normal rank

Revision as of 13:57, 27 June 2024

scientific article
Language Label Description Also known as
English
Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
scientific article

    Statements

    Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules (English)
    0 references
    0 references
    9 January 2008
    0 references
    The authors compute the \(s\)-dimensional integral of a function \(f\) over \([0,\,1)^s\) by a quasi-Monte Carlo (QMC) rule, where \(f\) lies in a certain Sobolev space. With other words, they calculate the average of the values \(f(x_n)\) for a point set \(\{x_0,\, \dots,\,x_{N-1}\}\subset [0,\,1)^s\) which is chosen deterministically. In this paper, special QMC's, so-called polynomial lattice rules, are considered. The convergence rate is shown to be best possible up to a given degree of smoothness of \(f\). The authors show the existence of polynomial lattice rules which automatically adjust themselves to the smoothness of \(f\). Further they show strong tractability for special polynomial lattice rules, i.e., the worst-case error does not depend on the dimension \(s\).
    0 references
    multivariate numerical integration
    0 references
    quasi-Monte Carlo algorithm
    0 references
    polynomial lattice rule
    0 references
    worst-case error
    0 references
    strong tractability
    0 references
    convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references