∫−∞∞e−x2f(x)dx≈i=1∑nwif(xi)wi=n2[Hn−1(xi)]22n−1n!π
Here, xis are the Hermite nodes that satisfy Hn(x)=0.
Explanation
The Gauss quadrature is excellent in itself, and it can perform calculations even when the integration range is infinitely given, by choosing nodes wisely.
For improper integrals, if f does not contain 1−x21, e−x, e−x2, you can use the trick of making g as follows.
∫0∞f(x)dx==∫0∞f(x)exe−xdx∫0∞g(x)e−xdx
Let’s look at the motive of the Gauss-Chebyshev quadrature. Chebyshev nodes are given as follows.
xi=cos(2n2i−1π)
Of course, these nodes are discrete, but if viewed continuously, it can be accepted as variable substitution as follows.
dx==−πsinπtdt−π1−x2dt
When performing such substitution integration,
∫−111−x21f(x)dx==≈−π∫101−x21f(x)1−x2dtπ∫01f(cos(πt))dtπn1i=1∑nf(cos(2n2i−1π))
Of course, this is not an accurate derivation, and it is not necessarily related to the Gauss quadrature either. The purpose of the above formula development is to verify that the idea of choosing special nodes can be similar to substitution.
Atkinson. (1989). An Introduction to Numerical Analysis(2nd Edition): p308. ↩︎