|
ML Version of the Day
|
#include <ml_aggregate.h>

definition of the aggregate structure
no. aggregates at each level
node to aggregate map
option about METIS and ParMETIS
information about the aggregates only if the user explicitely < requires them
aggregate shape control
finest grid level
= 1 indicates that the prolongator smoother should use block diagonal scaling (blocksize = num_PDE_eqns)
Uncoupled, Coupled, MIS
temporary variable
adjusted for levels
self-explanatory
nnz of the finest A
1: keep aggr_info otherwise: free it
keeping tentative prolongator
maximum size of coarsest grid
maximum number of levels
complexity control
aggregate size control
| double** ML_Aggregate_Struct::nodal_coord |
Coordinates of fine-grid nodes and aggregates
indicates whether fine grid nullspace has been overwritten
self-explanatory
for null space vectors
block size
for variable blocks (finest)
sum of nnz for all A's
natural, random, graph
so it can be reused later.
Steers how the MIS and Uncoupled handle phase 3 of aggregation. Values near 0 create few additional aggregates.Large values create many additional aggregates. Convergence can be improve convergence by new aggregates but nonzero fill-in increases on coarse meshes. Default: .5
smoothed aggregation on A^T
already have P tent, don't create it
for prolongator smoother
#prolongator smoother sweeps
point, block
for pruning matrix
Used to build restriction by doing
holds data structure aggr_vblock
for variable blocks (finest)
1.7.4