Newton–Cotes formulas
Builds on Quadrature ruleLagrange basis polynomialsDegree of exactness of a quadrature rule
Definition
Let and let be an integer. The closed Newton–Cotes formula with nodes on is the quadrature rule where are the Lagrange basis polynomials for the nodes . For , the open Newton–Cotes formula with nodes uses instead the nodes , , with , and the weights for these nodes.
Remarks
So is the integral of the interpolating polynomial of at the nodes, and it is exact for polynomials of degree at most . The closed formula has degree of exactness for odd and for even , by symmetry of the nodes. Example: gives the trapezoidal rule , gives Simpson's rule , and gives Simpson's rule ; the open formula with is the midpoint rule. Non-example: the two-point Gauss–Legendre rule on has nodes and weights . It is interpolatory but not a Newton–Cotes formula. Its nodes are neither the endpoints , as a closed formula needs, nor , as the open formula with two nodes needs. For closed formulas with some weights are negative, and as the formulas need not converge even for analytic integrands, much as in Runge's phenomenon.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Degree of exactness of a quadrature rule concept
- Lagrange basis polynomials concept
- Quadrature rule concept
- Newton–Cotes formulas definition
Further reading
About this page
| Tag | W9ARPZGPM6 |
|---|---|
| URI | m2://W9ARPZGPM6 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D32, 41A55 |
| Defines | Newton–Cotes formulas |
| Uses | Quadrature rule, Lagrange basis polynomials, Degree of exactness of a quadrature rule |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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
No page links to this page yet.