Gaussian quadrature
Summary
Gaussian quadrature is a quadrature rule with nodes in which both the nodes and the weights are free. They are chosen to make the rule exact for all polynomials of degree up to . This is the highest degree of exactness that an -point rule can reach. The nodes are the zeros of the degree orthogonal polynomial for the weight of the integral, and the weights are positive. For smooth integrands it converges very fast, and it is one of the standard tools of numerical integration.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | FP37BTP93K |
|---|---|
| URI | m2://FP37BTP93K |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65D32, 41A55, 33C45 |
| Specializes | Quadrature rule |
| Same as |
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
Used by
- Gauss–Legendre quadrature
- Gauss–Hermite quadrature
- Spectral element method
- Gauss–Jacobi quadrature
- Gauss–Laguerre quadrature