HomeSort by relevance Sort by last modified time
    Searched defs:LU (Results 1 - 10 of 10) sorted by null

  /external/eigen/bench/btl/actions/
action_lu_solve.hh 65 typename Interface::gene_matrix LU;
70 Interface::matrix_from_stl(LU,A_stl);
87 // LU factorization
88 Interface::copy_matrix(A,LU,size);
89 Interface::LU_factor(LU,pivot,size);
91 // LU solve
93 Interface::LU_solve(LU,pivot,B,X,size);
  /external/opencv3/modules/hal/src/
matrix.cpp 48 * LU & Cholesky implementation for small matrices *
112 int LU(float* A, size_t astep, int m, float* b, size_t bstep, int n)
118 int LU(double* A, size_t astep, int m, double* b, size_t bstep, int n)
  /external/eigen/Eigen/src/Eigen2Support/
LU.h 16 class LU : public FullPivLU<MatrixType>
49 explicit LU(const T& t) : Base(t), m_originalMatrix(t) {}
89 * \return the partial-pivoting LU decomposition of \c *this.
94 inline const LU<typename MatrixBase<Derived>::PlainObject>
95 MatrixBase<Derived>::lu() const function in class:Eigen::MatrixBase
97 return LU<PlainObject>(eval());
106 * \return the partial-pivoting LU decomposition of \c *this.
111 inline const LU<typename MatrixBase<Derived>::PlainObject>
114 return LU<PlainObject>(eval());
  /external/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 310 auto LU = L->use_begin(), LE = L->use_end();
312 skipUnmappedUsers(LU, LE, LM);
315 while (LU != LE) {
320 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) {
324 if (LU->getOperandNo() != RU->getOperandNo()) {
328 skipUnmappedUsers(++LU, LE, LM);
  /external/opencv3/modules/core/src/
lapack.cpp 53 int LU(float* A, size_t astep, int m, float* b, size_t bstep, int n)
55 return hal::LU(A, astep, m, b, bstep, n);
58 int LU(double* A, size_t astep, int m, double* b, size_t bstep, int n)
60 return hal::LU(A, astep, m, b, bstep, n);
743 result = hal::LU(a.ptr<float>(), a.step, rows, 0, 0, 0);
767 result = hal::LU(a.ptr<double>(), a.step, rows, 0, 0, 0);
    [all...]
  /external/llvm/lib/IR/
LegacyPassManager.cpp 563 SmallPtrSet<Pass *, 8> &LU = DMI->second;
564 for (Pass *LUP : LU) {
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/
EnumSetTest.java 104 IN, SN, SB, TE, I, XE, CS, BA, LA, CE, PR, ND, PM, SM, EU, GD, TB, DY, HO, ER, TM, YB, LU,
  /external/llvm/lib/Analysis/
ScalarEvolution.cpp 480 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS);
485 const Value *LV = LU->getValue(), *RV = RU->getValue();
    [all...]
ValueTracking.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 845 /// folded in \p LU at isel time.
847 /// This function returns true if \p LU can accommodate what \p F
854 const LSRUse &LU, const Formula &F);
855 // Get the cost of the scaling factor used in F for LU.
857 const LSRUse &LU, const Formula &F);
904 const LSRUse &LU,
    [all...]

Completed in 373 milliseconds