OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:polynomials
(Results
1 - 23
of
23
) sorted by null
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
PolynomialSplineFunction.java
17
package org.apache.commons.math.analysis.
polynomials
;
31
* <i>interpolating
polynomials
</i> and an ascending array of domain
33
* is defined by the constituent
polynomials
. The
polynomials
are assumed to
37
* the
polynomials
and knot points passed to the constructor.</p>
39
* N.B.: The
polynomials
in the <code>
polynomials
</code> property must be
57
* <code>
polynomials
[j](x - knot[j])</code></li></ol></p>
74
private final PolynomialFunction
polynomials
[];
field in class:PolynomialSplineFunction
77
* Number of spline segments = number of
polynomials
[
all
...]
PolynomialFunctionNewtonForm.java
17
package org.apache.commons.math.analysis.
polynomials
;
PolynomialsUtils.java
17
package org.apache.commons.math.analysis.
polynomials
;
25
* A collection of static methods that operate on or return
polynomials
.
32
/** Coefficients for Chebyshev
polynomials
. */
35
/** Coefficients for Hermite
polynomials
. */
38
/** Coefficients for Laguerre
polynomials
. */
41
/** Coefficients for Legendre
polynomials
. */
46
// initialize recurrence for Chebyshev
polynomials
53
// initialize recurrence for Hermite
polynomials
60
// initialize recurrence for Laguerre
polynomials
67
// initialize recurrence for Legendre
polynomials
[
all
...]
PolynomialFunction.java
17
package org.apache.commons.math.analysis.
polynomials
;
PolynomialFunctionLagrangeForm.java
17
package org.apache.commons.math.analysis.
polynomials
;
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
LinearInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
23
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
65
PolynomialFunction
polynomials
[] = new PolynomialFunction[n];
local
70
polynomials
[i] = new PolynomialFunction(coefficients);
73
return new PolynomialSplineFunction(x,
polynomials
);
NevilleInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunctionLagrangeForm;
SplineInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
23
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
30
* consisting of n cubic
polynomials
, defined over the subintervals determined by the x values,
39
* The interpolating
polynomials
satisfy: <ol>
42
* <li>Adjacent
polynomials
are equal through two derivatives at the knot points (i.e., adjacent
polynomials
114
PolynomialFunction
polynomials
[] = new PolynomialFunction[n];
local
121
polynomials
[i] = new PolynomialFunction(coefficients);
124
return new PolynomialSplineFunction(x,
polynomials
);
DividedDifferenceInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunctionLagrangeForm;
23
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunctionNewtonForm;
SmoothingPolynomialBicubicSplineInterpolator.java
25
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
45
* Default constructor. The degree of the fitting
polynomials
is set to 3.
BicubicSplineInterpolator.java
22
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
SmoothingBicubicSplineInterpolator.java
26
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
LoessInterpolator.java
23
import org.apache.commons.math.analysis.
polynomials
.PolynomialSplineFunction;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
PolynomialFitter.java
21
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
25
/** This class implements a curve fitting specialized for
polynomials
.
42
* <p>The polynomial fitter built this way are complete
polynomials
,
/prebuilts/go/darwin-x86/src/hash/crc64/
crc64.go
15
// Predefined
polynomials
.
/prebuilts/go/linux-x86/src/hash/crc64/
crc64.go
15
// Predefined
polynomials
.
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
LaguerreSolver.java
24
import org.apache.commons.math.analysis.
polynomials
.PolynomialFunction;
31
* Laguerre's Method</a> for root finding of real coefficient
polynomials
.
/prebuilts/go/darwin-x86/src/hash/crc32/
crc32.go
9
//
Polynomials
are represented in LSB-first form also known as reversed representation.
23
// Predefined
polynomials
.
/prebuilts/go/linux-x86/src/hash/crc32/
crc32.go
9
//
Polynomials
are represented in LSB-first form also known as reversed representation.
23
// Predefined
polynomials
.
/prebuilts/go/darwin-x86/src/crypto/aes/
aes_test.go
28
// Multiply b and c as GF(2)
polynomials
modulo poly
const.go
20
// AES is based on the mathematical behavior of binary
polynomials
21
// (
polynomials
over GF(2)) modulo the irreducible polynomial x? + x? + x³ + x + 1.
22
// Addition of these binary
polynomials
corresponds to binary xor.
/prebuilts/go/linux-x86/src/crypto/aes/
aes_test.go
28
// Multiply b and c as GF(2)
polynomials
modulo poly
const.go
20
// AES is based on the mathematical behavior of binary
polynomials
21
// (
polynomials
over GF(2)) modulo the irreducible polynomial x? + x? + x³ + x + 1.
22
// Addition of these binary
polynomials
corresponds to binary xor.
Completed in 925 milliseconds