| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| QRDecomposition.java | 18 package org.apache.commons.math.linear;
|
| SingularMatrixException.java | 18 package org.apache.commons.math.linear;
|
| FieldMatrixChangingVisitor.java | 18 package org.apache.commons.math.linear;
21 import org.apache.commons.math.linear.MatrixVisitorException;
|
| FieldMatrixPreservingVisitor.java | 18 package org.apache.commons.math.linear;
21 import org.apache.commons.math.linear.MatrixVisitorException;
|
| DefaultFieldMatrixChangingVisitor.java | 18 package org.apache.commons.math.linear;
21 import org.apache.commons.math.linear.MatrixVisitorException;
|
| DefaultFieldMatrixPreservingVisitor.java | 18 package org.apache.commons.math.linear;
21 import org.apache.commons.math.linear.MatrixVisitorException;
|
| DecompositionSolver.java | 18 package org.apache.commons.math.linear;
28 * square matrices and when the solution is an exact linear solution, i.e. when
30 * with non-square matrix A and with non-null minimal norm. If an exact linear
38 /** Solve the linear equation A × X = B for matrices A.
49 /** Solve the linear equation A × X = B for matrices A.
60 /** Solve the linear equation A × X = B for matrices A.
|
| EigenDecomposition.java | 18 package org.apache.commons.math.linear;
132 * Get a solver for finding the A × X = B solution in exact linear sense.
|
| FieldLUDecomposition.java | 18 package org.apache.commons.math.linear;
89 * Get a solver for finding the A × X = B solution in exact linear sense.
|
| NonSquareMatrixException.java | 18 package org.apache.commons.math.linear;
|
| NotPositiveDefiniteMatrixException.java | 18 package org.apache.commons.math.linear;
|
| NotSymmetricMatrixException.java | 18 package org.apache.commons.math.linear;
|
| SingularValueDecomposition.java | 18 package org.apache.commons.math.linear;
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| params.cc | 30 val = depth * param.linear().slope() + param.linear().y_intercept();
31 return std::min(std::max(val, param.linear().min_val()),
32 param.linear().max_val());
|
| params_test.cc | 34 auto* linear = param.mutable_linear(); local
35 linear->set_y_intercept(100.0);
36 linear->set_slope(-10.0);
37 linear->set_min_val(23.0);
38 linear->set_max_val(90.0);
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| TweenPaths.java | 4 import aurelienribon.tweenengine.paths.Linear;
12 public static final Linear linear = new Linear(); field in interface:TweenPaths
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/g711/ |
| g711.h | 165 * A 64K byte table for linear to x-law and a 512 byte table for x-law to
166 * linear sound like peanuts these days, and shouldn't an array lookup be
176 * Biased Linear Input Code Compressed Code
187 * Each biased linear code has a leading 1 which identifies the segment
200 #define ULAW_BIAS 0x84 /* Bias for linear code. */
202 /*! \brief Encode a linear sample to u-law
203 \param linear The sample to encode.
206 static __inline uint8_t linear_to_ulaw(int linear) {
212 if (linear < 0) {
214 linear = ULAW_BIAS - linear - 1
[all...] |
| /external/clang/test/OpenMP/ |
| declare_simd_messages.cpp | 147 // expected-error@+1 {{expected '(' after 'linear'}}
148 #pragma omp declare simd linear
152 #pragma omp declare simd linear(
154 #pragma omp declare simd linear()
158 #pragma omp declare simd linear(a:
160 #pragma omp declare simd linear(a:)
162 // expected-error@+1 {{expected '(' after 'linear'}}
163 #pragma omp declare simd linear :)
167 #pragma omp declare simd linear(this
171 #pragma omp declare simd linear(this,
[all...] |
| declare_simd_ast_print.c | 11 #pragma omp declare simd inbranch, uniform(d) linear(val(s1, s2) : 32)
12 #pragma omp declare simd notinbranch simdlen(2), uniform(s1, s2) linear(d: s1)
15 // CHECK: #pragma omp declare simd notinbranch simdlen(2) uniform(s1, s2) linear(val(d): s1)
16 // CHECK-NEXT: #pragma omp declare simd inbranch uniform(d) linear(val(s1): 32) linear(val(s2): 32)
|
| parallel_for_linear_codegen.cpp | 34 #pragma omp parallel for linear(pvar, lvar)
49 #pragma omp parallel for linear(g:5)
96 #pragma omp parallel for linear(g:5)
141 #pragma omp parallel for linear(pvar, lvar : 3)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
| LinearObjectiveFunction.java | 18 package org.apache.commons.math.optimization.linear;
25 import org.apache.commons.math.linear.MatrixUtils;
26 import org.apache.commons.math.linear.RealVector;
27 import org.apache.commons.math.linear.ArrayRealVector;
30 * An objective function for a linear optimization problem.
32 * A linear objective function has one the form:
50 /** Constant term of the linear equation. */
54 * @param coefficients The coefficients for the linear equation being optimized
55 * @param constantTerm The constant term of the linear equation
62 * @param coefficients The coefficients for the linear equation being optimize
[all...] |
| NoFeasibleSolutionException.java | 18 package org.apache.commons.math.optimization.linear;
|
| Relationship.java | 18 package org.apache.commons.math.optimization.linear;
|
| UnboundedSolutionException.java | 18 package org.apache.commons.math.optimization.linear;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| StatisticalMultivariateSummary.java | 19 import org.apache.commons.math.linear.RealMatrix;
|
