A constructive approach to strong tractability using quasi-Monte Carlo algorithms (Q1872630): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q588370
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Radu Theodorescu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TOMS659 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086577316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrépance de suites associées à un système de numération (en dimension s) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized discrepancy and quadrature error bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration and approximation in arbitrary dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Random Sequences and Their Discrepancies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-discrepancy sequences and global function fields with many rational places / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability results for integration and discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact exponent of sparse grid quadratures in the weighted case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate integration for weighted Korobov classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted tensor product algorithms for linear multivariate problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case complexity of multivariate integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934368 / rank
 
Normal rank

Latest revision as of 15:24, 5 June 2024

scientific article
Language Label Description Also known as
English
A constructive approach to strong tractability using quasi-Monte Carlo algorithms
scientific article

    Statements

    A constructive approach to strong tractability using quasi-Monte Carlo algorithms (English)
    0 references
    0 references
    14 May 2003
    0 references
    Under appropriate conditions it is shown that in multivariate integration, quasi-Monte Carlo algorithms based on some low discrepancy sequences achieve the optimal convergence order \(O(n^{-1+\delta})\) for any \(\delta> 0\) in weighted Sobolev spaces independent of the dimension.
    0 references
    quasi-Monte Carlo methods
    0 references
    low-discrepancy sequences
    0 references
    tractability
    0 references
    multidimensional integration
    0 references
    information-based complexity
    0 references
    effective dimension
    0 references
    algorithms
    0 references
    optimal convergence
    0 references

    Identifiers