133     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()
429     m_lu.insertBackByOuterInnerUnordered(ii, ii) = u(ii);  in factorize()
451       m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k);  in factorize()
453   m_lu.finalize();  in factorize()
454   m_lu.makeCompressed();  in factorize()