On 10/27/23 12:21, Daniel Arndt wrote:
If you can formulate your problem/approach in a way (iteratively?) that you
could solve separately on the three triangulations (using input from the
solution on the other triangulations), that might be easier.
That corresponds to an operator splitting scheme or, in the language of linear
solvers, an Uzawa iteration.
The alternative is to build a block system in which each block corresponds to
one triangulation (2 or 3 dimensional). You'd build each block in the same way
as you would with a single triangulation, including using the same indexing of
rows/columns that corresponds to the DoFHandlers on these triangulations. The
tricky part is assembling the off-diagonal blocks where you'd need to work a
bit harder. If you can assemble such a linear system, then the solution
becomes both relatively easy and efficient because you can use a coupled
solver scheme.
You might also want to look at some of the "non-matching" tutorial programs to
see inspirations for problems that use different triangulations at once.
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.
To view this discussion on the web visit
https://groups.google.com/d/msgid/dealii/5c882055-ad52-3410-1efe-963a7fb9e257%40colostate.edu.
