Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Gauss-Hermite quadrature

Numerical Algorithm

Gauss-Hermite quadrature is a form of Gaussian quadrature for approximating integrals over the whole real line in which the function is multiplied by a weight of e to the power minus x squared. The integral is replaced by a weighted sum of the function's values at n sample points. The sample points are the roots of the physicists' version of the Hermite polynomial of degree n, and each point carries a weight given by a closed formula involving factorials, the square root of pi and the Hermite polynomial of the next lower degree. A common use is the expectation of a function of a normally distributed variable: after a change of variable that scales and shifts it, the expectation takes the form the rule handles. In the simplest non-trivial case, with two points, the rule reduces to the average of the function's values one standard deviation below and above the mean. Published tables list the abscissae and weights up to order 32.

Connections

In Field

Source Gauss-Hermite quadrature (Wikipedia)
Sources
Gauss-Hermite quadrature (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead
    Gauss-Hermite quadrature is a form of Gaussian quadrature for approximating the value of integrals of the following kind:
  • In Field: Computational Science, Lead, field
    Gauss-Hermite quadrature is a form of Gaussian quadrature for approximating the value of integrals of the following kind:
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.