At this moment, there is no support yet for Nedelec-type elements
in the matrix-free framework. However, I would expect these to get
ready within the next 2-3 months: We have recently added support
for Raviart-Thomas elements, which have similar demands in terms
of algorithms, therefore we have most of the necessary
preparations. If you would be interested in this development, we
could share what we have at this point and see how we would
proceed.
Regarding your second question, it is correct that both structured and unstructured meshes are support by the matrix-free framework. As you say, what differs is the level of compression in the metric terms: On affine mesh elements (including Cartesian ones), we only need a single dim x dim tensor per mesh cell, whereas the general (curved) case has different terms in every point. As a result, the memory access and the achievable performance differs, but both are supported.
The big topic, as you say, is the question of multigrid methods. There is some reference on a problem I believe might be related to yours, https://doi.org/10.1002/nla.2348 - that solver builds on auxiliary space methods. Unfortunately, we do not have support for these kinds of methods in deal.II at this point, but I believe that the investment to get them running would not be huge.
Best regards,
Martin
--
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+un...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/d42d7f5e-e035-469c-a4cf-ff2543046b3bn%40googlegroups.com.