Computational complexity on numerical integrals (Q1177970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 22585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity on numerical integrals |
scientific article; zbMATH DE number 22585 |
Statements
Computational complexity on numerical integrals (English)
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.7982510328292847
0 references
0.7855318188667297
0 references
0.7748332023620605
0 references
