#include <ladel_types.h>
Structure capturing symbolic information used for and during the factorization.
Definition at line 53 of file ladel_types.h.
Collaboration diagram for symbolic_cholesky_information:Data Fields | |
| ladel_int | ncol |
| number of columns in the analyzed matrix More... | |
| ladel_int * | etree |
| eliminations tree More... | |
| ladel_int * | postorder |
| postordiring of the elimination tree More... | |
| ladel_int * | col_counts |
| column counts, stored as column pointers More... | |
| ladel_int * | p |
| fill-reducing ordering (possibly AMD) More... | |
| ladel_int * | pinv |
| inverse permutation vector More... | |
| ladel_int * | pattern |
| stores the nonzero pattern of a row of L More... | |
| ladel_int * | nodes |
| keeps track of which nodes have been marked More... | |
| ladel_int* symbolic_cholesky_information::col_counts |
column counts, stored as column pointers
Definition at line 58 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::etree |
eliminations tree
Definition at line 56 of file ladel_types.h.
| ladel_int symbolic_cholesky_information::ncol |
number of columns in the analyzed matrix
Definition at line 55 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::nodes |
keeps track of which nodes have been marked
Definition at line 62 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::p |
fill-reducing ordering (possibly AMD)
Definition at line 59 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::pattern |
stores the nonzero pattern of a row of L
Definition at line 61 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::pinv |
inverse permutation vector
Definition at line 60 of file ladel_types.h.
| ladel_int* symbolic_cholesky_information::postorder |
postordiring of the elimination tree
Definition at line 57 of file ladel_types.h.