| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) {
39 m_lu.IsRowMajor ? computeRowMajor() : compute();
112 MatrixType& m_lu; member in class:Eigen::SkylineInplaceLU
121 const size_t rows = m_lu.rows();
122 const size_t cols = m_lu.cols();
125 eigen_assert(!m_lu.IsRowMajor && "LU decomposition does not work with rowMajor Storage");
128 const double pivot = m_lu.coeffDiag(row);
132 for (typename MatrixType::InnerLowerIterator lIt(m_lu, col); lIt; ++lIt) {
137 typename MatrixType::InnerLowerIterator lIt(m_lu, col);
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++)
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); }
35 Index cols() const { return m_lu.cols(); }
40 m_lu = mat;
45 typename FactorType::InnerIterator k_it(m_lu,i);
52 typename FactorType::InnerIterator kj_it(m_lu, k);
76 x = m_lu.template triangularView<UnitLower>().solve(b);
77 x = m_lu.template triangularView<Upper>().solve(x);
90 FactorType m_lu; member in class:Eigen::IncompleteLU
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 106 return m_lu;
285 : NumTraits<Scalar>::epsilon() * m_lu.diagonalSize();
300 result += (internal::abs(m_lu.coeff(i,i)) > premultiplied_threshold);
351 return isInjective() && (m_lu.rows() == m_lu.cols());
364 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
366 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
371 inline Index rows() const { return m_lu.rows();
375 MatrixType m_lu; member in class:Eigen::FullPivLU
[all...] |
| PartialPivLU.h | 103 return m_lu;
150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
170 inline Index rows() const { return m_lu.rows(); }
171 inline Index cols() const { return m_lu.cols(); }
174 MatrixType m_lu; member in class:Eigen::PartialPivLU
183 : m_lu(),
193 : m_lu(size, size),
203 : m_lu(matrix.rows(), matrix.rows()),
389 m_lu = matrix
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 70 Index rows() const { return m_lu.rows(); }
72 Index cols() const { return m_lu.cols(); }
113 x = m_lu.template triangularView<UnitLower>().solve(x);
114 x = m_lu.template triangularView<Upper>().solve(x);
143 FactorType m_lu; member in class:Eigen::IncompleteLUT
248 m_lu.resize(n,n);
271 m_lu.reserve(n * (nnzL + nnzU + 1));
344 typename FactorType::InnerIterator ki_it(m_lu, minrow);
396 // 4 - partially sort and insert the elements in the m_lu matrix
406 m_lu.startVec(ii)
[all...] |
