Quadrature rule
Summary
A quadrature rule approximates a definite integral by a weighted sum of values of at fixed nodes. It is the basic object of numerical integration in one dimension. Rules are compared by the polynomials they integrate exactly and by their error for smooth functions. Newton–Cotes rules use equally spaced nodes, and Gaussian rules use optimally placed nodes.
Where this leads
14 pages build on this one.
Further reading
About this page
| Tag | ADSVMCY77A |
|---|---|
| URI | m2://ADSVMCY77A |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65D32, 41A55 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Simpson's rule
- Sparse grid
- Peano kernel theorem
- Trapezoidal rule
- Adaptive quadrature
- Lebedev quadrature
- Gauss–Kronrod quadrature formula
- Gaussian quadrature
- Curse of dimensionality
- Nyström method
- Newton–Cotes formulas
- Quasi-Monte Carlo method
- Degree of exactness of a quadrature rule
- Clenshaw–Curtis quadrature