\(f(x) e^{-x^2}\)
Recurrence relation and weights computation follow Abramowitz and Stegun, 1964.
The coefficients of the standard Hermite polynomials grow very rapidly. In order to avoid overflows, each Hermite polynomial is normalized with respect to the underlying scalar product. The initial interval for the application of the bisection method is based on the roots of the previous Hermite polynomial (interlacing). Upper and lower bounds of these roots are provided by
I. Krasikov, Nonnegative quadratic forms and bounds on orthogonal polynomials, Journal of Approximation theory 111, 31-49
| Modifier and Type | Field and Description |
|---|---|
| private static final double | H0
π-1/4 |
| private static final double | H1
π-1/4 √2 |
| private static final double | SQRT_PI
π1/2 |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| protected Pair | computeRule(int
Order of the rule to be computed. numberOfPoints)Implements abstract org. Computes the rule for the given order. |
| H0 | back to summary |
|---|---|
| private static final double H0 π-1/4 | |
| H1 | back to summary |
|---|---|
| private static final double H1 π-1/4 √2 | |
| SQRT_PI | back to summary |
|---|---|
| private static final double SQRT_PI π1/2 | |
| HermiteRuleFactory | back to summary |
|---|---|
| public HermiteRuleFactory() | |
| computeRule | back to summary |
|---|---|
| protected Pair Implements abstract org. Doc from org. Computes the rule for the given order.
| |