Home
last modified time | relevance | path

Searched refs:m_lu (Results 1 – 5 of 5) sorted by relevance

/external/eigen/unsupported/Eigen/src/Skyline/
DSkylineInplaceLU.h37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) { in m_flags()
39 m_lu.IsRowMajor ? computeRowMajor() : compute(); in m_flags()
112 MatrixType& m_lu; variable
121 const size_t rows = m_lu.rows(); in compute()
122 const size_t cols = m_lu.cols(); in compute()
125 eigen_assert(!m_lu.IsRowMajor && "LU decomposition does not work with rowMajor Storage"); in compute()
128 const double pivot = m_lu.coeffDiag(row); in compute()
132 for (typename MatrixType::InnerLowerIterator lIt(m_lu, col); lIt; ++lIt) { in compute()
137 typename MatrixType::InnerLowerIterator lIt(m_lu, col); in compute()
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { in compute()
[all …]
/external/eigen/Eigen/src/LU/
DFullPivLU.h120 m_lu = matrix.derived();
134 return m_lu;
323 : NumTraits<Scalar>::epsilon() * m_lu.diagonalSize();
339 result += (abs(m_lu.coeff(i,i)) > premultiplied_threshold);
390 return isInjective() && (m_lu.rows() == m_lu.cols());
403 … eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
409 EIGEN_DEVICE_FUNC inline Index rows() const { return m_lu.rows(); }
410 EIGEN_DEVICE_FUNC inline Index cols() const { return m_lu.cols(); }
431 MatrixType m_lu;
451 : m_lu(rows, cols),
[all …]
DPartialPivLU.h130 m_lu = matrix.derived();
144 return m_lu;
220 inline Index rows() const { return m_lu.rows(); }
221 inline Index cols() const { return m_lu.cols(); }
234 eigen_assert(rhs.rows() == m_lu.rows());
240 m_lu.template triangularView<UnitLower>().solveInPlace(dst);
243 m_lu.template triangularView<Upper>().solveInPlace(dst);
256 eigen_assert(rhs.rows() == m_lu.cols());
260 dst = m_lu.template triangularView<Upper>().adjoint().solve(rhs);
262 m_lu.template triangularView<UnitLower>().adjoint().solveInPlace(dst);
[all …]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteLU.h38 Index rows() const { return m_lu.rows(); } in rows()
39 Index cols() const { return m_lu.cols(); } in cols()
44 m_lu = mat; in compute()
49 typename FactorType::InnerIterator k_it(m_lu,i); in compute()
56 typename FactorType::InnerIterator kj_it(m_lu, k); in compute()
80 x = m_lu.template triangularView<UnitLower>().solve(b); in _solve_impl()
81 x = m_lu.template triangularView<Upper>().solve(x); in _solve_impl()
85 FactorType m_lu;
/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteLUT.h133 Index rows() const { return m_lu.rows(); } in rows()
135 Index cols() const { return m_lu.cols(); } in cols()
174 x = m_lu.template triangularView<UnitLower>().solve(x); in _solve_impl()
175 x = m_lu.template triangularView<Upper>().solve(x); in _solve_impl()
191 FactorType m_lu;
262 m_lu.resize(n,n); in factorize()
285 m_lu.reserve(n * (nnzL + nnzU + 1)); in factorize()
359 typename FactorType::InnerIterator ki_it(m_lu, minrow); in factorize()
421 m_lu.startVec(ii); in factorize()
423 m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k); in factorize()
[all …]