Lines Matching defs:degree
92 * @param degree degree of the polynomial
93 * @return Chebyshev polynomial of specified degree
95 public static PolynomialFunction createChebyshevPolynomial(final int degree) {
96 return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS,
117 * @param degree degree of the polynomial
118 * @return Hermite polynomial of specified degree
120 public static PolynomialFunction createHermitePolynomial(final int degree) {
121 return buildPolynomial(degree, HERMITE_COEFFICIENTS,
143 * @param degree degree of the polynomial
144 * @return Laguerre polynomial of specified degree
146 public static PolynomialFunction createLaguerrePolynomial(final int degree) {
147 return buildPolynomial(degree, LAGUERRE_COEFFICIENTS,
170 * @param degree degree of the polynomial
171 * @return Legendre polynomial of specified degree
173 public static PolynomialFunction createLegendrePolynomial(final int degree) {
174 return buildPolynomial(degree, LEGENDRE_COEFFICIENTS,
187 /** Get the coefficients array for a given degree.
188 * @param degree degree of the polynomial
193 private static PolynomialFunction buildPolynomial(final int degree,
199 if (degree > maxDegree) {
200 computeUpToDegree(degree, maxDegree, generator, coefficients);
212 final int start = degree * (degree + 1) / 2;
214 final double[] a = new double[degree + 1];
215 for (int i = 0; i <= degree; ++i) {
224 /** Compute polynomial coefficients up to a given degree.
225 * @param degree maximal degree
226 * @param maxDegree current maximal degree
230 private static void computeUpToDegree(final int degree, final int maxDegree,
235 for (int k = maxDegree; k < degree; ++k) {
247 // degree 0 coefficient
250 // degree 1 to degree k-1 coefficients
258 // degree k coefficient
263 // degree k+1 coefficient
274 * @param k highest degree of the polynomials used in the recurrence