Gaussian quadrature
Builds on Quadrature ruleDegree of exactness of a quadrature ruleOrthogonal polynomials
Definition
Let be an interval, bounded or not, and let be a weight function on . This means that is integrable, almost everywhere, and every moment is finite. Let . Consider a quadrature rule with distinct nodes in and real weights . It is an -point Gaussian quadrature rule for if it is an equality for every polynomial of degree at most .
Remarks
For each and such a rule exists and is unique. Its nodes are the zeros of the degree orthogonal polynomial for the inner product , and its weights are positive. No -point rule is exact for all polynomials of degree : the polynomial has a positive integral but vanishes at every node. So is the largest possible degree of exactness.
Example: on and . The rule is exact for (both sides are ) and for (both sides are ), so it is the one-point Gaussian rule, the midpoint rule.
Non-example: the trapezoidal rule has two nodes but fails for , since the left side is and the right side is . So it is not exact up to degree and is not a Gaussian rule.
The rule for on is Gauss–Legendre quadrature.
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
- Orthogonal polynomials concept
- Quadrature rule concept
- Gaussian quadrature definition
Further reading
About this page
| Tag | SZ6XCSQA5H |
|---|---|
| URI | m2://SZ6XCSQA5H |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D32, 41A55, 33C45 |
| Defines | Gaussian quadrature |
| Uses | Quadrature rule, Degree of exactness of a quadrature rule, Orthogonal polynomials |
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.