Lines Matching full:matrix
22 * \returns the symmetric pattern A^T+A from the input matrix A.
46 * If the matrix is not structurally symmetric, an ordering of A^T+A is computed
47 * \tparam Index The type of indices of the matrix
56 /** Compute the permutation vector from a sparse matrix
57 * This routine is much faster if the input matrix is column-major
71 /** Compute the permutation with a selfadjoint matrix */
90 * \note Returns an empty permutation matrix
91 * \tparam Index The type of indices of the matrix
99 /** Compute the permutation vector from a column-major sparse matrix */
112 * The matrix should be in column-major and \b compressed format (see SparseMatrix::makeCompressed()).
119 typedef Matrix<Index, Dynamic, 1> IndexVector;
121 /** Compute the permutation vector \a perm form the sparse matrix \a mat
122 * \warning The input sparse matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()).
127 eigen_assert(mat.isCompressed() && "COLAMDOrdering requires a sparse matrix in compressed mode. Call .makeCompressed() before passing it to COLAMDOrdering");
