Degree of exactness of a quadrature rule
Summary
The degree of exactness of a quadrature rule is the largest such that the rule is exact for all polynomials of degree . It is the standard first measure of the quality of a rule: for smooth integrands, a high degree of exactness usually means a small error. A rule with nodes has degree of exactness at most , and Gaussian quadrature reaches this bound.
Where this leads
10 pages build on this one.
Further reading
About this page
| Tag | ZYT1JNT1Y0 |
|---|---|
| URI | m2://ZYT1JNT1Y0 |
| 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
- Trapezoidal rule
- Gauss–Hermite quadrature
- Gauss–Kronrod quadrature
- Gauss–Kronrod quadrature formula
- Gauss–Jacobi quadrature
- Gaussian quadrature
- Boole's rule
- Newton–Cotes formulas
- Gauss–Laguerre quadrature