Part of a parallel direct block solver. This is the incomplete block symbolic factorization routine.
This code is based on the one of symbol_faxi.c . In fact, this code is exactly the one of version 1.1 of fax.
This file can be included by faxi_graph.c.
|Version 3.0||from 07 dec 2004 to 15 dec 2004|
|symbol_faxi_nomerge.c||Part of a parallel direct block solver.|
|The defines and macros.|
|SYMBOL_FAXI_ITERATOR||Loop for all adjacent edges, used in symbolFaxi.|
|SYMBOL_FAXI_VERTEX_DEGREE||Computes the number of adjacent edges to a vertex.|
|symbolFaxi||Incomplete symbolic factorization routine with limitation of level-of-fill value.|
Loop for all adjacent edges, used in symbolFaxi. Must be defined in including file if SYMBOL_FAXI_INCLUDED is defined.
Incomplete symbolic factorization routine with limitation of level-of-fill value.
This routine computes the block symbolic factorization of the given matrix graph according to the given vertex ordering.
The algorithm is similar to the one of complete symbolic factorization, except that a level of fill value is recorded for each block, which serves to compute the level of fill for each filled block.
|symbptr||Symbolic block matrix [based]|
|vertnbr||Number of vertices|
|edgenbr||Number of edges|
|ngbdptr||Neighbor bookkeeping area|
|ngbfrst||First neighbor function|
|ngbnext||Next neighbor function|
|ngbdegr||Vertex degree function (upper bound)|
|levfmax||Inclusive maximum level of fill for blocks|