> I believe that it would not be impossible to develop this, but it will > probably not be a small exercise. You would have to develop a fair share of > code, and gain an understanding of parts of the library you don't usually get > to see if you use deal.II. > > If you're willing to do this, we can guide you along the process, but it's > going to be a bit of work for sure.
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. I can go into more detail if you want. -- Timo Heister http://www.math.clemson.edu/~heister/ -- 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.
