#include "ladel_types.h"#include "ladel_global.h"#include "ladel_constants.h"#include "ladel_debug_print.h"
Include dependency graph for ladel_etree.c:Go to the source code of this file.
Functions | |
| ladel_int | ladel_etree (ladel_sparse_matrix *M, ladel_symbolics *sym, ladel_work *work) |
| Computes the elimination tree of a matrix. More... | |
| ladel_int | ladel_etree_and_col_counts (ladel_sparse_matrix *M, ladel_symbolics *sym, ladel_work *work) |
| Computes the elimination tree and column counts of a matrix. More... | |
Function Documentation
◆ ladel_etree()
| ladel_int ladel_etree | ( | ladel_sparse_matrix * | M, |
| ladel_symbolics * | sym, | ||
| ladel_work * | work | ||
| ) |
Computes the elimination tree of a matrix.
This tree is stored in sym->etree.
- Parameters
-
M Matrix sym Symbolics struct for the factorization work LADEL workspace
- Returns
- Status
Definition at line 6 of file ladel_etree.c.
Here is the caller graph for this function:◆ ladel_etree_and_col_counts()
| ladel_int ladel_etree_and_col_counts | ( | ladel_sparse_matrix * | M, |
| ladel_symbolics * | sym, | ||
| ladel_work * | work | ||
| ) |
Computes the elimination tree and column counts of a matrix.
This function can be used to do the whole symbolic analysis at once, but has a worse asymptotic time complexity than using etree, postorder and col_counts sequentially.
- Parameters
-
M Matrix sym Symbolics struct for the factorization work LADEL workspace
- Returns
- Status
Definition at line 38 of file ladel_etree.c.
Here is the caller graph for this function: