Computational complexity on numerical integrals (Q1177970)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational complexity on numerical integrals
scientific article

    Statements

    Computational complexity on numerical integrals (English)
    0 references
    0 references
    0 references
    26 June 1992
    0 references
    This paper analyzes the computational complexity of one-dimensional integration formulas. The authors generalize some earlier work by Smale in this area. Their main result is an explicit formula for the expected error from a degree \(k-1\) quadrature formula, with the average taken over functions in an appropriate Sobolev space. Exact error constants for the midpoint, trapezoidal and Simpson formulas are given.
    0 references
    midpoint formula
    0 references
    trapezoidal formula
    0 references
    computational complexity
    0 references
    one- dimensional integration
    0 references
    quadrature formula
    0 references
    Sobolev space
    0 references
    Simpson formulas
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references