Searched refs:m_lu (Results 1 – 5 of 5) sorted by relevance
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| D | SkylineInplaceLU.h | 37 : /*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/ |
| D | FullPivLU.h | 107 return m_lu; in matrixLU()
286 : NumTraits<Scalar>::epsilon() * m_lu.diagonalSize(); in threshold()
302 result += (abs(m_lu.coeff(i,i)) > premultiplied_threshold); in rank()
353 return isInjective() && (m_lu.rows() == m_lu.cols()); in isInvertible()
366 … eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!"); in inverse()
368 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols())); in inverse()
373 inline Index rows() const { return m_lu.rows(); } in rows()
374 inline Index cols() const { return m_lu.cols(); } in cols()
383 MatrixType m_lu; variable
401 : m_lu(rows, cols), in FullPivLU()
[all …]
|
| D | PartialPivLU.h | 103 return m_lu; in matrixLU()
150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols())); in inverse()
170 inline Index rows() const { return m_lu.rows(); } in rows()
171 inline Index cols() const { return m_lu.cols(); } in cols()
180 MatrixType m_lu; variable
189 : m_lu(), in PartialPivLU()
199 : m_lu(size, size), in PartialPivLU()
209 : m_lu(matrix.rows(), matrix.rows()), in PartialPivLU()
400 m_lu = matrix; in compute()
408 internal::partial_lu_inplace(m_lu, m_rowsTranspositions, nb_transpositions); in compute()
[all …]
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); } in rows()
35 Index cols() const { return m_lu.cols(); } in cols()
40 m_lu = mat; in compute()
45 typename FactorType::InnerIterator k_it(m_lu,i); in compute()
52 typename FactorType::InnerIterator kj_it(m_lu, k); in compute()
76 x = m_lu.template triangularView<UnitLower>().solve(b); in _solve()
77 x = m_lu.template triangularView<Upper>().solve(x); in _solve()
90 FactorType m_lu;
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | IncompleteLUT.h | 122 Index rows() const { return m_lu.rows(); } in rows()
124 Index cols() const { return m_lu.cols(); } in cols()
163 x = m_lu.template triangularView<UnitLower>().solve(x); in _solve()
164 x = m_lu.template triangularView<Upper>().solve(x); in _solve()
189 FactorType m_lu;
251 m_lu.resize(n,n); in factorize()
274 m_lu.reserve(n * (nnzL + nnzU + 1)); in factorize()
347 typename FactorType::InnerIterator ki_it(m_lu, minrow); in factorize()
409 m_lu.startVec(ii); in factorize()
411 m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k); in factorize()
[all …]
|