Roy, This question is probably for you. I'm curious if we've gained or could potentially gain a method for looping over all "coupled" elements (if this is the right terminology). Let me try to clarify what I mean since we've used the wrong terminology for so long and I'm probably still using it incorrectly here.
I want to loop over all elements that are part of what I would call the normal ghosted set of elements where both geometric and algebraic information is available due to domain decomposition. Looking at your Ghosted Functor base class, this might be your C(K) elements? Actually, I'm a little hazy on the difference between C(K) and G(K) so maybe you can clarify. John was suggesting that constraints might be the difference between these two sets? In MOOSE we previously (but incorrectly) called this set, the "semi-local elements". If this predicate or iterator doesn't exist, should we create it, or should we build that up in MOOSE? I'd like to eventually deprecate and drop our incorrect use of the semi-local terminology since that's rarely what we actually need. Thanks, Cody ------------------------------------------------------------------------------ _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
