(Optional) Defines which parallel coarsening algorithm is used
(Optional) Defines which parallel coarsening algorithm is used. There are the following options for coarsen_type:
0 CLJP-coarsening (a parallel coarsening algorithm using independent sets. 1 classical Ruge-Stueben coarsening on each processor, no boundary treatment (not recommended!) 3 classical Ruge-Stueben coarsening on each processor, followed by a third pass, which adds coarse points on the boundaries 6 Falgout coarsening (uses 1 first, followed by CLJP using the interior coarse points generated by 1 as its first independent set) 7 CLJP-coarsening (using a fixed random vector, for debugging purposes only) 8 PMIS-coarsening (a parallel coarsening algorithm using independent sets, generating lower complexities than CLJP, might also lead to slower convergence) 9 PMIS-coarsening (using a fixed random vector, for debugging purposes only) 10 HMIS-coarsening (uses one pass Ruge-Stueben on each processor independently, followed by PMIS using the interior C-points generated as its first independent set) 11 one-pass Ruge-Stueben coarsening on each processor, no boundary treatment (not recommended!) 21 CGC coarsening by M. Griebel, B. Metsch and A. Schweitzer 22 CGC-E coarsening by M. Griebel, B. Metsch and A.Schweitzer The default is 6.
alphabetic index hierarchy of classes
generated by doc++