On weak tractability of the Clenshaw-Curtis Smolyak algorithm (Q2451171)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On weak tractability of the Clenshaw-Curtis Smolyak algorithm
scientific article

    Statements

    On weak tractability of the Clenshaw-Curtis Smolyak algorithm (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2014
    0 references
    The authors consider the integration of \(d\)-variable (real) analytic functions \(f:[0,1]^d\to \mathbb{R}\) whose directional derivatives of all orders are bounded by one. They show that the Clenshaw-Curtis Smolyak algorithm is weakly traceable for this class of functions. The proof uses the polynomial exactness of the algorithm and an explicit bound on its operator norm.
    0 references
    numerical integration
    0 references
    quadrature rules
    0 references
    Clenshaw-Curtis Smolyak algorithm
    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