Searched refs:coefficients (Results 1 - 25 of 32) sorted by relevance

12

/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
H A DPolynomialFunction.java29 * 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
124 evaluate(double[] coefficients, double argument) argument
233 differentiate(double[] coefficients) argument
[all...]
H A DPolynomialFunctionNewtonForm.java40 * 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 i
[all...]
H A DPolynomialsUtils.java187 /** 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,
197 final int maxDegree = (int) FastMath.floor(FastMath.sqrt(2 * coefficients.size())) - 1;
200 computeUpToDegree(degree, maxDegree, generator, coefficients);
205 // coefficients for polynomial 1 are l [1] ... l [2] (degrees 0 ... 1)
206 // coefficients fo
193 buildPolynomial(final int degree, final ArrayList<BigFraction> coefficients, final RecurrenceCoefficientsGenerator generator) argument
230 computeUpToDegree(final int degree, final int maxDegree, final RecurrenceCoefficientsGenerator generator, final ArrayList<BigFraction> coefficients) argument
[all...]
H A DPolynomialFunctionLagrangeForm.java41 * The coefficients of the polynomial, ordered by degree -- i.e.
42 * coefficients[0] is the constant term and coefficients[n] is the
45 private double coefficients[]; field in class:PolynomialFunctionLagrangeForm
58 * Whether the polynomial coefficients are available.
128 * Returns a copy of the coefficients array.
132 * Note that coefficients computation can be ill-conditioned. Use with caution
135 * @return a fresh copy of the coefficients array
141 double[] out = new double[coefficients.length];
142 System.arraycopy(coefficients,
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/
H A DLinearObjectiveFunction.java36 * The c<sub>i</sub> and d are the coefficients of the equation,
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) { argument
58 this(new ArrayRealVector(coefficients), constantTerm);
62 * @param coefficients The coefficients for the linear equation being optimized
65 public LinearObjectiveFunction(RealVector coefficients, double constantTerm) { argument
66 this.coefficients
[all...]
H A DLinearConstraint.java45 * 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>
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, argument
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, argument
100 this.coefficients
[all...]
H A DSimplexTableau.java185 // decision variable coefficients
268 * Get the -1 times the sum of all coefficients in the given array.
269 * @param coefficients coefficients to sum
270 * @return the -1 times the sum of all coefficients in the given array.
272 protected static double getInvertedCoeffiecientSum(final RealVector coefficients) { argument
274 for (double coefficient : coefficients.getData()) {
374 double[] coefficients = new double[getOriginalNumDecisionVariables()];
375 for (int i = 0; i < coefficients.length; i++) {
378 coefficients[
[all...]
/external/eigen/doc/special_examples/
H A DTutorial_sparse_example.cpp7 void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n);
16 std::vector<T> coefficients; // list of non-zeros coefficients local
18 buildProblem(coefficients, b, n);
21 A.setFromTriplets(coefficients.begin(), coefficients.end());
H A DTutorial_sparse_example_details.cpp19 void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n) argument
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/skia/src/gpu/effects/
H A DGrBicubicEffect.h26 const float* coefficients() const { return fCoefficients; } function in class:GrBicubicEffect
37 * Create a simple filter effect with custom bicubic coefficients and optional domain.
39 static GrFragmentProcessor* Create(GrTexture* tex, const SkScalar coefficients[16], argument
44 return Create(tex, coefficients, GrCoordTransform::MakeDivByTextureWHMatrix(tex),
47 return SkNEW_ARGS(GrBicubicEffect, (tex, coefficients,
62 * Create a filter effect with custom bicubic coefficients, the texture matrix, and the x/y
65 static GrFragmentProcessor* Create(GrTexture* tex, const SkScalar coefficients[16], argument
68 return SkNEW_ARGS(GrBicubicEffect, (tex, coefficients, matrix, tileModes));
90 GrBicubicEffect(GrTexture*, const SkScalar coefficients[16],
92 GrBicubicEffect(GrTexture*, const SkScalar coefficients[1
[all...]
H A DGrBicubicEffect.cpp75 GrGLShaderVar("coefficients", kMat44f_GrSLType),
89 "\tvec4 c = coefficients * ts;\n"
124 pdman.setMatrix4f(fCoefficientsUni, bicubicEffect.coefficients());
138 const SkScalar coefficients[16],
144 convert_row_major_scalar_coeffs_to_column_major_floats(fCoefficients, coefficients);
148 const SkScalar coefficients[16],
155 convert_row_major_scalar_coeffs_to_column_major_floats(fCoefficients, coefficients);
172 return !memcmp(fCoefficients, s.coefficients(), 16) &&
189 SkScalar coefficients[16]; local
191 coefficients[
137 GrBicubicEffect(GrTexture* texture, const SkScalar coefficients[16], const SkMatrix &matrix, const SkShader::TileMode tileModes[2]) argument
147 GrBicubicEffect(GrTexture* texture, const SkScalar coefficients[16], const SkMatrix &matrix, const SkRect& domain) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
H A DLinearInterpolator.java66 final double coefficients[] = new double[2];
68 coefficients[0] = y[i];
69 coefficients[1] = m[i];
70 polynomials[i] = new PolynomialFunction(coefficients);
H A DSplineInterpolator.java100 // cubic spline coefficients -- b is linear, c quadratic, d is cubic (original y's are constants)
115 double coefficients[] = new double[4];
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/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
H A DLaguerreSolver.java231 double coefficients[] = ((PolynomialFunction) f).getCoefficients();
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 argument
289 Complex c[] = new Complex[coefficients.length];
292 c[i] = new Complex(coefficients[
311 solveAll(Complex coefficients[], Complex initial) argument
361 solve(Complex coefficients[], Complex initial) argument
[all...]
/external/skia/src/gpu/gl/
H A DGrGLPathRendering.cpp237 GrGLfloat coefficients[3 * 3]; local
240 coefficients[0] = SkScalarToFloat(matrix[SkMatrix::kMScaleX]);
241 coefficients[1] = SkScalarToFloat(matrix[SkMatrix::kMSkewX]);
242 coefficients[2] = SkScalarToFloat(matrix[SkMatrix::kMTransX]);
245 coefficients[3] = SkScalarToFloat(matrix[SkMatrix::kMSkewY]);
246 coefficients[4] = SkScalarToFloat(matrix[SkMatrix::kMScaleY]);
247 coefficients[5] = SkScalarToFloat(matrix[SkMatrix::kMTransY]);
251 coefficients[6] = SkScalarToFloat(matrix[SkMatrix::kMPersp0]);
252 coefficients[7] = SkScalarToFloat(matrix[SkMatrix::kMPersp1]);
253 coefficients[
[all...]
/external/libvorbis/doc/
H A D06-floor0.tex60 3) [coefficients] is an empty, zero length vector
67 10) concatenate [temp_vector] onto the end of the [coefficients] vector
68 11) if (length of vector [coefficients] is less than [floor0_order], continue at step 6
89 \item The number of scalars read into the vector \varname{[coefficients]}
95 scalars in \varname{[coefficients]} is to to read a total of twelve
106 Given an \varname{[amplitude]} integer and \varname{[coefficients]}
157 p & = & (1 - \cos^2\omega)\prod_{j=0}^{\frac{\mathtt{floor0\_order}-3}{2}} 4 (\cos([\mathtt{coefficients}]_{2j+1}) - \cos \omega)^2 \\
158 q & = & \frac{1}{4} \prod_{j=0}^{\frac{\mathtt{floor0\_order}-1}{2}} 4 (\cos([\mathtt{coefficients}]_{2j}) - \cos \omega)^2
166 p & = & \frac{(1 - \cos^2\omega)}{2} \prod_{j=0}^{\frac{\mathtt{floor0\_order}-2}{2}} 4 (\cos([\mathtt{coefficients}]_{2j+1}) - \cos \omega)^2 \\
167 q & = & \frac{(1 + \cos^2\omega)}{2} \prod_{j=0}^{\frac{\mathtt{floor0\_order}-2}{2}} 4 (\cos([\mathtt{coefficients}]
[all...]
/external/libavc/common/arm/
H A Dih264_ihadamard_scaling_a9.s41 @ * @brief This function performs a 4x4 inverse hadamard transform on the 4x4 DC coefficients
46 @ * The DC coefficients pass through a 2-stage inverse hadamard transform.
50 @ * input 4x4 block of DC coefficients
168 @ * The DC coefficients pass through a 2-stage inverse hadamard transform.
H A Dih264_iquant_itrans_recon_dc_a9.s54 @ * Input 4x4 coefficients
184 @ * Input 4x4 coefficients
/external/libvpx/libvpx/vp8/common/arm/armv6/
H A Dsixtappredict8x4_v6.asm44 ldr r3, [r2] ; load up packed filter coefficients
135 ldr r3, [lr] ; load up packed filter coefficients
/external/sonivox/arm-hybrid-22k/lib_src/
H A DARM-E_filter_gnu.s74 @load coefficients from pWTFrame structure
H A DARM-E_interpolate_loop_gnu.s100 @ with certain coefficients and signal sources. In this case, either a
H A DARM-E_interpolate_noloop_gnu.s92 @ with certain coefficients and signal sources. In this case, either a
/external/sonivox/arm-wt-22k/lib_src/
H A DARM-E_filter_gnu.s74 @load coefficients from pWTFrame structure
H A DARM-E_interpolate_loop_gnu.s100 @ with certain coefficients and signal sources. In this case, either a
H A DARM-E_interpolate_noloop_gnu.s92 @ with certain coefficients and signal sources. In this case, either a

Completed in 1133 milliseconds

12