LADEL main
Sparse LDL factorization package with rank 1 and rowadd/rowdel updates
Macros
ladel_constants.h File Reference

Detailed Description

Constants and macros used in LADEL.

Author
Ben Hermans

Definition in file ladel_constants.h.

+ This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define TRUE   1
 For booleans. More...
 
#define FALSE   0
 For booleans. More...
 
#define SUCCESS   1
 For status returns. More...
 
#define FAIL   -1
 For status returns. More...
 
#define NONE   -1
 Indicates a root (a node without parent), or an untouched node. More...
 
#define UNSYMMETRIC   0
 No symmetry is assumed in the matrix. More...
 
#define UPPER   1
 Use only upper part of matrix. More...
 
#define LOWER   -1
 Use only lower part of matrix. More...
 
#define AMD   1
 Ordering method during the symbolic part of the factorization. More...
 
#define NO_ORDERING   0
 No ordering is performed during the symbolic part of the factorization. More...
 
#define GIVEN_ORDERING   2
 The ordering was computed previously and is already stored in sym->p. More...
 
#define MARKED   1
 Indicate whether a node is marked. More...
 
#define UNMARKED   0
 Indicate whether a node is not marked. More...
 
#define SET_HAS_CHANGED   TRUE
 Possible return value of ladel_set_union indicating the set has changed. More...
 
#define SET_HAS_NOT_CHANGED   FALSE
 Possible return value of ladel_set_union indicating the set has not changed. More...
 
#define MAX_SET_SIZE_EXCEEDED   NONE
 Possible return value of ladel_set_union indicating the set has grown beyond the maximum size. More...
 
#define UPDATE   TRUE
 Flag in rank1_update to perform an update. More...
 
#define DOWNDATE   FALSE
 Flag in rank1_update to perform a downdate. More...
 
#define LADEL_MAX(a, b)   ((a) > (b) ? (a) : (b))
 Return the maximum of two numbers. More...
 
#define LADEL_MIN(a, b)   ((a) > (b) ? (b) : (a))
 Return the minimum of two numbers. More...
 
#define LADEL_ABS(a)   ((a) < 0 ? -(a) : (a))
 Return the absolute value a number. More...
 
#define LADEL_FOR(index, M, col)   for(index = (M)->p[(col)]; index < (((M)->nz) ? (M)->p[(col)] + (M)->nz[(col)] : (M)->p[(col)+1]); index++)
 Loop through a column of a sparse matrix. More...
 
#define IS_ROOT(col, etree)   ((etree)[(col)] == NONE)
 Check whether a node is a root (i.e. More...
 
#define MARK(nodes, k)   (nodes[(k)] = MARKED)
 Mark the k-th node. More...
 
#define UNMARK(nodes, k)   (nodes[(k)] = UNMARKED)
 Unmark the k-th node. More...
 
#define IS_MARKED(nodes, k)   (nodes[(k)] == MARKED)
 Check whether the k-th node is marked. More...