Lines Matching defs:compute
49 * // Compute the ordering permutation vector from the structural pattern of A
51 * // Compute the numerical factorization
108 compute(matrix);
121 * Compute the symbolic and numeric factorization of the input sparse matrix.
124 void compute (const MatrixType& matrix)
188 * \sa compute()
401 * Compute the column permutation to minimize the fill-in
405 * - Compute the column elimination tree on the permuted matrix
414 //TODO It is possible as in SuperLU to compute row and columns scaling vectors to equilibrate the matrix mat.
419 // Compute fill-in ordering
434 // Apply the permutation and compute the nnz per column.
442 // Compute the column elimination tree of the permuted matrix
567 // Compute the inverse of perm_c
