127     for (Index row = 0; row < rows; row++) {  in compute()  local
128         const double pivot = m_lu.coeffDiag(row);  in compute()
131         const Index& col = row;  in compute()
138         for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {  in compute()
139             typename MatrixType::InnerUpperIterator uItPivot(m_lu, row);  in compute()
143             uItPivot += (rrow - row - 1);  in compute()
157         for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {  in compute()
158             typename MatrixType::InnerUpperIterator uItPivot(m_lu, row);  in compute()
162             for (Index i = 0; i < rrow - row - 1; i++) {  in compute()
163                 m_lu.coeffRefLower(rrow, row + i + 1) -= uItPivot.value() * coef;  in compute()
170         for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {  in compute()
172             typename MatrixType::InnerUpperIterator uItPivot(m_lu, row);  in compute()
176             uItPivot += (rrow - row - 1);  in compute()
191     for (Index row = 0; row < rows; row++) {  in computeRowMajor()  local
192         typename MatrixType::InnerLowerIterator llIt(m_lu, row);  in computeRowMajor()
195         for (Index col = llIt.col(); col < row; col++) {  in computeRowMajor()
196             if (m_lu.coeffExistLower(row, col)) {  in computeRowMajor()
199                 typename MatrixType::InnerLowerIterator lIt(m_lu, row);  in computeRowMajor()
203                 const Index offset = lIt.col() - uIt.row();  in computeRowMajor()
206                 Index stop = offset > 0 ? col - lIt.col() : col - uIt.row();  in computeRowMajor()
214                 Scalar newCoeff = m_lu.coeffLower(row, col) - rowVal.dot(colVal);  in computeRowMajor()
220                 Scalar newCoeff = m_lu.coeffLower(row, col);  in computeRowMajor()
230                 m_lu.coeffRefLower(row, col) = newCoeff / diag;  in computeRowMajor()
235         const Index col = row;  in computeRowMajor()
237         for (Index rrow = uuIt.row(); rrow < col; rrow++) {  in computeRowMajor()
241             const Index offset = lIt.col() - uIt.row();  in computeRowMajor()
243             Index stop = offset > 0 ? rrow - lIt.col() : rrow - uIt.row();  in computeRowMajor()
269         typename MatrixType::InnerLowerIterator lIt(m_lu, row);  in computeRowMajor()
270         typename MatrixType::InnerUpperIterator uIt(m_lu, row);  in computeRowMajor()
272         const Index offset = lIt.col() - uIt.row();  in computeRowMajor()
279         Scalar newCoeff = m_lu.coeffDiag(row) - rowVal.dot(colVal);  in computeRowMajor()
285         Scalar newCoeff = m_lu.coeffDiag(row);  in computeRowMajor()
293         m_lu.coeffRefDiag(row) = newCoeff;  in computeRowMajor()
312     for (Index row = 0; row < rows; row++) {  in solve()  local
313         x->coeffRef(row) = b.coeff(row);  in solve()
314         Scalar newVal = x->coeff(row);  in solve()
315         typename MatrixType::InnerLowerIterator lIt(m_lu, row);  in solve()
318         while (lIt.col() < row) {  in solve()
324         x->coeffRef(row) = newVal;  in solve()
338             x->coeffRef(uIt.row()) -= x_col * uIt.value();  in solve()