search

fdrmrc / Polydeal

C++ implementation of Polygonal Discontinuous Galerkin method within the deal.II Finite Element library.
https://fdrmrc.github.io/Polydeal/
Other
0 stars 0 forks source link

Improve extraction of levels #118

Closed fdrmrc closed 6 months ago

fdrmrc commented 6 months ago

Depends on #108. Only f030c914bda8df3cddf1e08566dc50fd7aedd832 is relevant.

This PR allows the extraction of all levels, not just the intermediate ones (i.e. the ones between the root and the last level made by leaves). A test has been added.

fdrmrc commented 6 months ago

I've updated the piston example, verifying that all levels can be employed to generate agglomerates.

The following hierarchy can be obtained, by asking to visit all levels. Notice that the number of processors in this case was $12$, so the first level consists of $1$ polytope for each process.

Total number of fine cells: 45714

Total number of agglomerates: 12 (level 1, root)
Total number of agglomerates: 96 (level 2)
Total number of agglomerates: 720 (level 3)
Total number of agglomerates: 5719 (level 4)