The cost of deterministic, adaptive, automatic algorithms: cones, not balls (Q2252143): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NAG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032800442 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.2412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3095368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive quadrature -- Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Conservative Fixed Width Confidence Intervals via Monte Carlo Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liberating the dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Not to Use an Automatic Quadrature Routine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Simulation of Stochastic Integrals when the Cost of Function Evaluation Is Dimension Dependent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of adaption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaption allows efficient integration of functions with unknown singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of infinite-dimensional integration in the worst case and randomized settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of adaption for approximating functions with singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case tractability of approximating ∞-variate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liberating the dimension for function approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liberating the dimension for function approximation: standard information / rank
 
Normal rank

Latest revision as of 18:59, 8 July 2024

scientific article
Language Label Description Also known as
English
The cost of deterministic, adaptive, automatic algorithms: cones, not balls
scientific article

    Statements

    The cost of deterministic, adaptive, automatic algorithms: cones, not balls (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 July 2014
    0 references
    function recovery
    0 references
    guarantee
    0 references
    integration
    0 references
    quadrature
    0 references
    automatic numerical algorithm
    0 references
    complexity
    0 references
    splines
    0 references
    cones
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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