Lines Matching full:matrix
87 // matrices stored in triplet form. The matrix A is not
105 // The matrix A is scaled using the matrix whose diagonal is the
115 // Create and return a matrix m = A * A'. Caller owns the
116 // result. The matrix A is not modified.
133 // matrix. This is done by using the AMD algorithm.
163 // on the matrix. See the documentation for CHOLMOD for more details.
167 // factorization for the matrix A or AA^T. Return true if
172 // Given a Cholesky factorization of a matrix A = LL^T, solve the
190 // compute the symbolic factorization of a matrix by either using
191 // AMD on the matrix or a user provided ordering of the rows.
196 // preserves the block structure of the permuted matrix, and exposes
197 // more of the super-nodal structure of the matrix to the numerical
200 // Find the block oriented AMD ordering of a matrix A, whose row and
202 // respectively. The matrix may or may not be symmetric. The entries
214 void ApproximateMinimumDegreeOrdering(cholmod_sparse* matrix, int* ordering);
233 // column of the matrix an elimination group. i.e., all columns in
244 void ConstrainedApproximateMinimumDegreeOrdering(cholmod_sparse* matrix,
