| /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 | 38 Index rows() const { return m_lu.rows(); }
39 Index cols() const { return m_lu.cols(); }
44 m_lu = mat;
49 typename FactorType::InnerIterator k_it(m_lu,i);
56 typename FactorType::InnerIterator kj_it(m_lu, k);
80 x = m_lu.template triangularView<UnitLower>().solve(b);
81 x = m_lu.template triangularView<Upper>().solve(x);
85 FactorType m_lu; member in class:Eigen::IncompleteLU
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 120 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; member in class:Eigen::FullPivLU
[all...] |
| PartialPivLU.h | 130 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)
283 MatrixType m_lu; member in class:Eigen::PartialPivLU
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 133 Index rows() const { return m_lu.rows(); }
135 Index cols() const { return m_lu.cols(); }
174 x = m_lu.template triangularView<UnitLower>().solve(x);
175 x = m_lu.template triangularView<Upper>().solve(x);
191 FactorType m_lu; member in class:Eigen::IncompleteLUT
262 m_lu.resize(n,n);
285 m_lu.reserve(n * (nnzL + nnzU + 1));
359 typename FactorType::InnerIterator ki_it(m_lu, minrow);
411 // 4 - partially sort and insert the elements in the m_lu matrix
421 m_lu.startVec(ii)
[all...] |
