HomeSort by relevance Sort by last modified time
    Searched full:decomposition (Results 151 - 175 of 292) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/ceres-solver/internal/ceres/
coordinate_descent_minimizer.cc 257 // Find a recursive decomposition of the Hessian matrix as a set
sparse_normal_cholesky_solver.cc 137 "Eigen's SimplicialLDLT decomposition. "
  /external/chromium_org/third_party/icu/source/common/unicode/
caniter.h 192 * See if the decomposition of cp2 is at segment starting at segmentPos
  /external/chromium_org/v8/test/mjsunit/
array-bounds-check-removal.js 203 // A test for recursive decomposition
  /external/eigen/Eigen/src/IterativeLinearSolvers/
ConjugateGradient.h 196 /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A
BiCGSTAB.h 207 /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A
  /external/eigen/doc/
TopicLinearAlgebraDecompositions.dox 18 <th>Decomposition</th>
  /external/eigen/test/
nomalloc.cpp 176 // Check decomposition modules with dynamic matrices that have a known compile-time max size (ctms)
  /external/icu/icu4c/source/common/unicode/
caniter.h 192 * See if the decomposition of cp2 is at segment starting at segmentPos
  /frameworks/compile/mclinker/include/mcld/Support/
Path.h 79 // ----- decomposition ----- //
  /libcore/luni/src/main/java/java/text/
CollationElementIterator.java 168 * If the decomposition mode is on, and offset is in the middle of a
  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_linalg.cpp 100 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
143 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
156 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
  /external/chromium_org/ui/events/gesture_detection/
velocity_tracker.cc 448 * Then it calculates the QR decomposition of A yielding an m by m orthonormal
450 * triangular (lower part is all zeroes), we can simplify the decomposition into
492 // Apply the Gram-Schmidt process to A to obtain its QR decomposition.
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 143 /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A.
219 eigen_assert(m_isInitialized && "Decomposition is not initialized.");
223 /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A.
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_linalg.cpp 100 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
143 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
156 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_linalg.cpp 100 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
143 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
156 /*Backsubstitute L%transpose(L)*x=b for x given the Cholesky decomposition
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-ot-shape-complex-indic.cc     [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
tstnorm.cpp 248 // Make sure that the static decomposition methods work
249 logln("Canonical decomposition...");
251 logln("Compatibility decomposition...");
253 // Now the iterative decomposition methods...
254 logln("Iterative decomposition...");
    [all...]
canittst.cpp 123 expectEqual("Characters with 'a' at the start of their decomposition: ", "", CanonicalIterator.getStarts('a'),
  /external/harfbuzz_ng/src/
hb-ot-shape-complex-indic.cc     [all...]
  /external/icu/icu4c/source/test/intltest/
tstnorm.cpp 248 // Make sure that the static decomposition methods work
249 logln("Canonical decomposition...");
251 logln("Compatibility decomposition...");
253 // Now the iterative decomposition methods...
254 logln("Iterative decomposition...");
    [all...]
  /frameworks/native/libs/input/
VelocityTracker.cpp 426 * Then it calculates the QR decomposition of A yielding an m by m orthonormal matrix Q
428 * part is all zeroes), we can simplify the decomposition into an m by n matrix
460 // Apply the Gram-Schmidt process to A to obtain its QR decomposition.
    [all...]
  /external/chromium_org/third_party/icu/source/common/
uprops.h 195 * 4.. 0 Decomposition Type
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
MINRES.h 233 /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A
  /external/icu/icu4c/source/common/
uprops.h 195 * 4.. 0 Decomposition Type

Completed in 1456 milliseconds

1 2 3 4 5 67 8 91011>>