Searched refs:m_L (Results 1 – 2 of 2) sorted by relevance
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
D | IncompleteCholesky.h | 49 Index rows() const { return m_L.rows(); } in rows() 51 Index cols() const { return m_L.cols(); } in cols() 100 x = m_L.template triangularView<UnitLower>().solve(x); in _solve() 101 x = m_L.adjoint().template triangularView<Upper>().solve(x); in _solve() 116 SparseMatrix<Scalar,ColMajor> m_L; // The lower part stored in CSC 142 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>().twistedBy(m_perm); in factorize() 144 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>(); in factorize() 146 Index n = m_L.cols(); in factorize() 147 Index nnz = m_L.nonZeros(); in factorize() 148 Map<ScalarType> vals(m_L.valuePtr(), nnz); //values in factorize() [all …]
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/ |
D | btDantzigLCP.cpp | 1197 btScalar *const m_L, *const m_d; // L*D*L' factorization of set C member 1238 m_L(l), m_d(_d), m_Dell(_Dell), m_ell(_ell), m_tmp(_tmp), in btLCP() 1307 btScalar *Lrow = m_L; in btLCP() 1311 btFactorLDLT (m_L,m_d,nub,m_nskip); in btLCP() 1313 btSolveLDLT (m_L,m_d,m_x,nub,m_nskip); in btLCP() 1358 btScalar *const Ltgt = m_L + nC*m_nskip, *ell = m_ell; in transfer_i_to_C() 1398 btSolveL1 (m_L,m_Dell,m_nC,m_nskip); in transfer_i_from_N_to_C() 1401 btScalar *const Ltgt = m_L + nC*m_nskip; in transfer_i_from_N_to_C() 1623 btLDLTRemove (m_A,C,m_L,m_d,m_n,nC,j,m_nskip,scratch); in transfer_i_from_C_to_N() 1726 btSolveL1 (m_L,m_Dell,m_nC,m_nskip); in solve1() [all …]
|