Lines Matching full:matrix
90 // matrices stored in triplet form. The matrix A is not
108 // The matrix A is scaled using the matrix whose diagonal is the
118 // Create and return a matrix m = A * A'. Caller owns the
119 // result. The matrix A is not modified.
136 // matrix. This is done by using the AMD algorithm.
172 // on the matrix. See the documentation for CHOLMOD for more details.
179 // factorization for the matrix A or AA^T. Return true if
188 // Given a Cholesky factorization of a matrix A = LL^T, solve the
201 // compute the symbolic factorization of a matrix by either using
202 // AMD on the matrix or a user provided ordering of the rows.
207 // preserves the block structure of the permuted matrix, and exposes
208 // more of the super-nodal structure of the matrix to the numerical
211 // Find the block oriented AMD ordering of a matrix A, whose row and
213 // respectively. The matrix may or may not be symmetric. The entries
225 bool ApproximateMinimumDegreeOrdering(cholmod_sparse* matrix, int* ordering);
244 // column of the matrix an elimination group. i.e., all columns in
255 bool ConstrainedApproximateMinimumDegreeOrdering(cholmod_sparse* matrix,
