Computes the col counts needed for the symbolic factorization (after etree and postorder).
The routine in this file computes the column counts of the factor assuming the etree and postordering have been performed prior to this. An alternative (with worse asymptotic complexity) that computes the etree and column counts in one go, is ladel_etree_and_col_counts in ladel_etree.c.
Definition in file ladel_col_counts.h.
#include "ladel_types.h"
Go to the source code of this file.
Functions | |
ladel_int | ladel_col_counts (ladel_sparse_matrix *M, ladel_symbolics *sym, ladel_work *work) |
Computes the column counts of the factor. More... | |
ladel_int ladel_col_counts | ( | ladel_sparse_matrix * | M, |
ladel_symbolics * | sym, | ||
ladel_work * | work | ||
) |
Computes the column counts of the factor.
This routine should only be called after the etree and postorder routines.
M | Sparse matrix to be analyzed |
sym | Struct holding symbolic information |
work | LADEL workspace |
Definition at line 48 of file ladel_col_counts.c.