public class HermiteRuleFactory extends BaseRuleFactory<Double>
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
|Constructor and Description|
|Modifier and Type||Method and Description|
Computes the rule for the given order.
addRule, getRule, getRuleInternal
protected Pair<Double,Double> computeRule(int numberOfPoints) throws MathIllegalArgumentException
Copyright © 2016–2020 Hipparchus.org. All rights reserved.