MueLu: StructuredAggregation, improve prolongator graph
Created by: lucbv
@trilinos/muelu
Expectations
The prolongator graph computed by the structured aggregation factory should be directly usable to construct the prolongator. For this to work we need to take into account how many dofs per node the problem has.
Current Behavior
The structured aggregation factory can compute the graph of the prolongator however it does it correctly only for the scalar PDE case. The prolongator factory then has to recreate a graph taking into account multiple dofs per node.
Motivation and Context
This will cut redundant work happening in aggregation and prolongator computation, thus improving performance. Also directly computing the prolongator graph means that if one wants to reset the MueLu preconditioner using reuse, aggregation will be skipped completely.
Definition of Done
- declare
dofsPerNode
an input parameter in StructuredAggregationFactory - modify the prolongatorGraph computation such that it can be used by the prolongator constructor