Search results
Results From The WOW.Com Content Network
The Gaussian quadrature chooses more suitable points instead, so even a linear function approximates the function better (the black dashed line). As the integrand is the third-degree polynomial y(x) = 7x 3 – 8x 2 – 3x + 3, the 2-point Gaussian quadrature rule even returns an exact result.
"Table of zeros and Gaussian Weights of certain Associated Laguerre Polynomials and the related Hermite Polynomials". Mathematics of Computation. 18 (88): 598– 616. doi: 10.1090/S0025-5718-1964-0166397-1. JSTOR 2002946. MR 0166397. Ehrich, S. (2002). "On stratified extensions of Gauss-Laguerre and Gauss-Hermite quadrature formulas".
Gauss–Legendre quadrature is optimal in a very narrow sense for computing integrals of a function f over [−1, 1], since no other quadrature rule integrates all degree 2n − 1 polynomials exactly when using n sample points. However, this measure of accuracy is not generally a very useful one---polynomials are very simple to integrate and ...
If we allow the intervals between interpolation points to vary, we find another group of quadrature formulas, such as the Gaussian quadrature formulas. A Gaussian quadrature rule is typically more accurate than a Newton–Cotes rule that uses the same number of function evaluations, if the integrand is smooth (i.e., if it is sufficiently ...
Gauss–Kronrod formulas are extensions of the Gauss quadrature formulas generated by adding + points to an -point rule in such a way that the resulting rule is exact for polynomials of degree less than or equal to + (Laurie (1997, p. 1133); the corresponding Gauss rule is of order ).
Gauss–Laguerre quadrature — extension of Gaussian quadrature for integrals with weight exp(−x) on [0, ∞] Gauss–Kronrod quadrature formula — nested rule based on Gaussian quadrature; Gauss–Kronrod rules; Tanh-sinh quadrature — variant of Gaussian quadrature which works well with singularities at the end points
The Gauss–Legendre methods use the points of Gauss–Legendre quadrature as collocation points. The Gauss–Legendre method based on s points has order 2s. [2] All Gauss–Legendre methods are A-stable. [3] In fact, one can show that the order of a collocation method corresponds to the order of the quadrature rule that one would get using the ...
Special examples are the Gaussian quadrature for polynomials and the Discrete Fourier Transform for plane waves. It should be stressed that the grid points and weights, x i , w i {\displaystyle x_{i},w_{i}} are a function of the basis and the number N {\displaystyle N} .