Lines Matching defs:Index
27 template <typename VectorV, typename VectorI, typename Index>
28 Index QuickSplit(VectorV &row, VectorI &ind, Index ncut)
33 Index mid;
34 Index n = row.size(); /* length of the vector */
35 Index first, last ;
45 for (Index j = first + 1; j <= last; j++) {
103 typedef typename FactorType::Index Index;
122 Index rows() const { return m_lu.rows(); }
124 Index cols() const { return m_lu.cols(); }
182 inline bool operator() (const Index& row, const Index& col, const Scalar&) const
197 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation
198 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // Inverse permutation
226 SparseMatrix<Scalar,ColMajor, Index> mat1 = amat;
227 SparseMatrix<Scalar,ColMajor, Index> mat2 = amat.transpose();
231 SparseMatrix<Scalar,ColMajor, Index> AtA = mat2 + mat1;
233 internal::minimum_degree_ordering<Scalar, Index>(AtA, m_P); // Then compute the AMD ordering...
249 Index n = amat.cols(); // Size of the matrix
258 SparseMatrix<Scalar,RowMajor, Index> mat;
267 Index fill_in = static_cast<Index> (amat.nonZeros()*m_fillfactor)/n+1;
271 Index nnzL = fill_in/2;
272 Index nnzU = nnzL;
276 for (Index ii = 0; ii < n; ii++)
280 Index sizeu = 1; // number of nonzero elements in the upper part of the current row
281 Index sizel = 0; // number of nonzero elements in the lower part of the current row
290 Index k = j_it.index();
306 Index jpos = ii + sizeu;
325 Index jj = 0;
326 Index len = 0;
331 Index k;
332 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
337 Index j = ju(jj);
363 Index j = ki_it.index();
364 Index jpos = jr(j);
367 Index newpos;
396 for(Index k = 0; k <sizeu; k++) jr(ju(ii+k)) = -1;
409 for(Index k = 0; k < len; k++)
421 for(Index k = 1; k < sizeu; k++)
437 for(Index k = ii + 1; k < ii + len; k++)