ML_Aggregate_Struct Struct Reference
definition of the aggregate structure
#include <ml_aggregate.h>
Collaboration diagram for ML_Aggregate_Struct:
Public Attributes | |
| int | ML_id |
| double | print_flag |
| int | max_coarse_size |
| maximum size of coarsest grid | |
| int | ordering |
| natural, random, graph | |
| int | min_nodes_per_aggregate |
| aggregate size control | |
| int | max_neigh_already_selected |
| complexity control | |
| double | threshold |
| for pruning matrix | |
| double | curr_threshold |
| adjusted for levels | |
| double | drop_tol_for_smoothing |
| self-explanatory | |
| int | attach_scheme |
| aggregate shape control | |
| double | smoothP_damping_factor |
| for prolongator smoother | |
| int * | smoothP_damping_sweeps |
| prolongator smoother sweeps | |
| int | smoothP_type |
| point, block | |
| int | coarsen_scheme |
| Uncoupled, Coupled, MIS. | |
| int * | coarsen_scheme_level |
| int | num_PDE_eqns |
| block size | |
| int | nullspace_dim |
| self-explanatory | |
| double * | nullspace_vect |
| for null space vectors | |
| int | nullspace_corrupted |
| indicates whether fine grid | |
| int * | aggr_count |
| no. | |
| int | keep_agg_information |
| 1: keep aggr_info | |
| int ** | aggr_info |
| node to aggregate map | |
| int | max_levels |
| maximum number of levels | |
| int | begin_level |
| finest grid level | |
| int | cur_level |
| temporary variable | |
| double | operator_complexity |
| sum of nnz for all A's | |
| double | fine_complexity |
| nnz of the finest A | |
| int | nvblocks |
| for variable blocks (finest) | |
| int * | vblock_info |
| for variable blocks (finest) | |
| int | keep_P_tentative |
| keeping tentative prolongator | |
| struct ML_Operator_Struct ** | P_tentative |
| so it can be reused later. | |
| int | smooth_existing_P_tentative |
| already have P tent, don't create it | |
| int | use_transpose |
| Used to build restriction by doing. | |
| int | Restriction_smoothagg_transpose |
| smoothed aggregation on A^T | |
| void * | aggr_options |
| option about METIS and ParMETIS | |
| void * | aggr_viz_and_stats |
| information about the aggregates | |
| void * | field_of_values |
| int | block_scaled_SA |
| = 1 indicates that the prolongator smoother should use block diagonal scaling (blocksize = num_PDE_eqns) | |
| double | phase3_agg_creation |
| Steers how the MIS and Uncoupled handle phase 3 of aggregation. | |
| double ** | nodal_coord |
| Coordinates of fine-grid nodes and aggregates. | |
| int | N_dimensions |
| void * | vblock_data |
| holds data structure aggr_vblock | |
| int | minimizing_energy |
| int | cheap_minimizing_energy |
| double | minimizing_energy_droptol |
| double * | old_RowOmegas |
Member Data Documentation
aggregates at each level
only if the user explicitely < requires them
otherwise: free it
| double** ML_Aggregate_Struct::nodal_coord |
nullspace has been overwritten
struct ML_Operator_Struct** ML_Aggregate_Struct::P_tentative [read] |
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
The documentation for this struct was generated from the following file: