| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunction.java | 29 * Immutable representation of a real polynomial function with real coefficients.
44 * The coefficients of the polynomial, ordered by degree -- i.e.,
45 * coefficients[0] is the constant term and coefficients[n] is the
48 private final double coefficients[]; field in class:PolynomialFunction
51 * Construct a polynomial with the given coefficients. The first element
52 * of the coefficients array is the constant term. Higher degree
53 * coefficients follow in sequence. The degree of the resulting polynomial
58 * the coefficients property.</p>
60 * @param c polynomial coefficients
[all...] |
| PolynomialFunctionNewtonForm.java | 40 * The coefficients of the polynomial, ordered by degree -- i.e.
41 * coefficients[0] is the constant term and coefficients[n] is the
44 private double coefficients[]; field in class:PolynomialFunctionNewtonForm
52 * When all c[i] = 0, a[] becomes normal polynomial coefficients,
53 * i.e. a[i] = coefficients[i].
58 * Whether the polynomial coefficients are available.
69 * @param a the coefficients in Newton form formula
106 * Returns a copy of coefficients in Newton form formula.
110 * @return a fresh copy of coefficients in Newton form formul
[all...] |
| PolynomialsUtils.java | 32 /** Coefficients for Chebyshev polynomials. */
35 /** Coefficients for Hermite polynomials. */
38 /** Coefficients for Laguerre polynomials. */
41 /** Coefficients for Legendre polynomials. */
187 /** Get the coefficients array for a given degree.
189 * @param coefficients list where the computed coefficients are stored
190 * @param generator recurrence coefficients generator
191 * @return coefficients array
194 final ArrayList<BigFraction> coefficients,
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
| LinearObjectiveFunction.java | 36 * The c<sub>i</sub> and d are the coefficients of the equation,
47 /** Coefficients of the constraint (c<sub>i</sub>). */
48 private final transient RealVector coefficients; field in class:LinearObjectiveFunction
54 * @param coefficients The coefficients for the linear equation being optimized
57 public LinearObjectiveFunction(double[] coefficients, double constantTerm) {
58 this(new ArrayRealVector(coefficients), constantTerm);
62 * @param coefficients The coefficients for the linear equation being optimized
65 public LinearObjectiveFunction(RealVector coefficients, double constantTerm)
[all...] |
| LinearConstraint.java | 45 * The c<sub>i</sub>, l<sub>i</sub> or r<sub>i</sub> are the coefficients of the constraints, the x<sub>i</sub>
56 /** Coefficients of the constraint (left hand side). */
57 private final transient RealVector coefficients; field in class:LinearConstraint
75 * @param coefficients The coefficients of the constraint (left hand side)
79 public LinearConstraint(final double[] coefficients, final Relationship relationship,
81 this(new ArrayRealVector(coefficients), relationship, value);
94 * @param coefficients The coefficients of the constraint (left hand side)
98 public LinearConstraint(final RealVector coefficients, final Relationship relationship
[all...] |
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 7 void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n);
18 std::vector<T> coefficients; // list of non-zeros coefficients local
20 buildProblem(coefficients, b, n);
23 A.setFromTriplets(coefficients.begin(), coefficients.end());
|
| Tutorial_sparse_example_details.cpp | 19 void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n)
28 insertCoefficient(id, i-1,j, -1, coefficients, b, boundary);
29 insertCoefficient(id, i+1,j, -1, coefficients, b, boundary);
30 insertCoefficient(id, i,j-1, -1, coefficients, b, boundary);
31 insertCoefficient(id, i,j+1, -1, coefficients, b, boundary);
32 insertCoefficient(id, i,j, 4, coefficients, b, boundary);
|
| /external/webrtc/webrtc/common_audio/ |
| fir_filter.cc | 25 FIRFilterC(const float* coefficients,
37 FIRFilter* FIRFilter::Create(const float* coefficients,
40 if (!coefficients || coefficients_length <= 0 || max_input_length <= 0) {
50 new FIRFilterSSE2(coefficients, coefficients_length, max_input_length);
55 new FIRFilterSSE2(coefficients, coefficients_length, max_input_length);
57 filter = new FIRFilterC(coefficients, coefficients_length);
62 new FIRFilterNEON(coefficients, coefficients_length, max_input_length);
66 new FIRFilterNEON(coefficients, coefficients_length, max_input_length);
68 filter = new FIRFilterC(coefficients, coefficients_length);
71 filter = new FIRFilterC(coefficients, coefficients_length)
[all...] |
| fir_filter.h | 21 // Creates a filter with the given coefficients. All initial state values will
27 static FIRFilter* Create(const float* coefficients,
|
| fir_filter_neon.h | 22 FIRFilterNEON(const float* coefficients,
|
| fir_filter_sse.h | 22 FIRFilterSSE2(const float* coefficients,
|
| /external/webrtc/webrtc/common_audio/signal_processing/ |
| filter_ar_fast_q12.c | 18 const int16_t* __restrict coefficients,
32 sum += coefficients[j] * data_out[i - j];
35 output = coefficients[0] * data_in[i];
|
| filter_ar_fast_q12_armv7.S | 26 @ r2: &coefficients[0]
34 @ r10: coefficients[j]
36 @ r12: &coefficients[j]
51 sub r12, #4 @ &coefficients[coefficients_length - 2]
63 ldr r10, [r12], #-4 @ coefficients[j - 1], coefficients[j]
65 smlatt r8, r10, r5, r8 @ sum2 += coefficients[j] * data_out[i - j + 1];
66 smlatb r7, r10, r5, r7 @ sum1 += coefficients[j] * data_out[i - j];
67 smlabt r7, r10, r5, r7 @ coefficients[j - 1] * data_out[i - j + 1];
69 smlabb r8, r10, r5, r8 @ coefficients[j - 1] * data_out[i - j + 2]
[all...] |
| downsample_fast.c | 19 const int16_t* __restrict coefficients,
38 out_s32 += coefficients[j] * data_in[i - j]; // Q12.
|
| filter_ar_fast_q12_mips.c | 16 const int16_t* __restrict coefficients,
35 "lh %[coef0], 0(%[coefficients]) \n\t"
42 " addu %[coefptr], %[coefficients], %[offset] \n\t"
64 "addu %[coefptr], %[coefficients], %[offset] \n\t"
107 "addu %[coefptr], %[coefficients], %[offset] \n\t"
131 : [coefficients] "r" (coefficients), [data_length] "r" (data_length),
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| LinearInterpolator.java | 66 final double coefficients[] = new double[2]; local
68 coefficients[0] = y[i];
69 coefficients[1] = m[i];
70 polynomials[i] = new PolynomialFunction(coefficients);
|
| SplineInterpolator.java | 100 // cubic spline coefficients -- b is linear, c quadratic, d is cubic (original y's are constants)
115 double coefficients[] = new double[4]; local
117 coefficients[0] = y[i];
118 coefficients[1] = b[i];
119 coefficients[2] = c[i];
120 coefficients[3] = d[i];
121 polynomials[i] = new PolynomialFunction(coefficients);
|
| /external/pdfium/fxbarcode/common/reedsolomon/ |
| BC_ReedSolomon.cpp | 92 const auto& coefficients = remainder->GetCoefficients(); local
94 ecBytes > coefficients.size() ? ecBytes - coefficients.size() : 0;
97 for (size_t y = 0; y < coefficients.size(); y++)
98 (*toEncode)[dataBytes + numZeroCoefficients + y] = coefficients[y];
|
| BC_ReedSolomonGF256Poly.h | 19 CBC_ReedSolomonGF256Poly(CBC_ReedSolomonGF256* field, int32_t coefficients);
23 const std::vector<int32_t>* coefficients);
|
| BC_ReedSolomonGF256Poly.cpp | 33 int32_t coefficients) {
38 m_coefficients.push_back(coefficients);
46 const std::vector<int32_t>* coefficients) {
47 if (!coefficients || coefficients->empty())
51 size_t coefficientsLength = coefficients->size();
52 if (coefficientsLength > 1 && coefficients->front() == 0) {
55 (*coefficients)[firstNonZero] == 0) {
63 m_coefficients[j] = (*coefficients)[i];
66 m_coefficients = *coefficients;
[all...] |
| /external/libxcam/modules/ocl/ |
| cv_edgetaper.h | 42 void create_weights (const cv::Mat &image, const cv::Mat &psf, cv::Mat &coefficients);
|
| cv_edgetaper.cpp | 34 CVEdgetaper::create_weights (const cv::Mat &image, const cv::Mat &psf, cv::Mat &coefficients)
65 coefficients = weights.clone ();
76 cv::Mat coefficients; local
77 create_weights (img, psf, coefficients);
80 result = result.mul (coefficients) + blurred.mul (cv::Scalar (1.0f) - coefficients);
|
| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_node.h | 25 // the coefficients provided.
26 WPDNode(size_t length, const float* coefficients, size_t coefficients_length);
|
| wpd_node.cc | 24 const float* coefficients,
30 filter_(FIRFilter::Create(coefficients,
33 assert(length > 0 && coefficients && coefficients_length > 0);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| LaguerreSolver.java | 231 double coefficients[] = ((PolynomialFunction) f).getCoefficients(); local
232 Complex c[] = new Complex[coefficients.length];
233 for (int i = 0; i < coefficients.length; i++) {
234 c[i] = new Complex(coefficients[i], 0.0);
273 * Find all complex roots for the polynomial with the given coefficients,
276 * @param coefficients the polynomial coefficients array
286 public Complex[] solveAll(double coefficients[], double initial) throws
289 Complex c[] = new Complex[coefficients.length];
292 c[i] = new Complex(coefficients[i], 0.0)
[all...] |
