Timo (and Yi-Chung):
One of my students is working on the initial step to get towards being
able to handle very large distributed triangulations. The main
limitation will be (for now), that the partitioning is static and
needs to happen in an offline process (so you can't really do adaptive
refinement or change the number of processors effectively). This might
be enough for your problem, though.
Are you willing to share that code, Timo?
I suspect that if implemented right, it should not be terribly difficult to do
refinement of the mesh, but because you can't repartition the coarse mesh, it
will quickly become unbalanced if processors refine differently (i.e., in
practice, if processors do not all refine globally).
Do you implement this by building another class on top of
dealii::Triangulation so that the base class only stored the coarse mesh plus
one layer of ghosts, and the derived class is responsible for the
communication? And then derive another class from DoFHandlerPolicy to deal
with this triangulation?
Best
W.
--
------------------------------------------------------------------------
Wolfgang Bangerth email: bange...@colostate.edu
www: http://www.math.colostate.edu/~bangerth/
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
https://groups.google.com/d/forum/dealii?hl=en
---
You received this message because you are subscribed to the Google Groups "deal.II User Group" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to dealii+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
