On Tue, 12 Apr 2011, Boyce Griffith wrote: > On 4/12/11 1:12 PM, Roy Stogner wrote: >> >> On Tue, 12 Apr 2011, Boyce Griffith wrote: >> >>> Is there a simple mapping between the original coarse DOF indices and >>> the corresponding coarse DOF indices of the fine system? >> >> Hmmm... nothing that won't potentially be messed up by refinement or >> repartitioning. >> >> Unless you're doing ALE-type stuff your safest bet is probably to map >> via element node0 coordinates. > > Nope, no ALE type stuff. What are element node0 coordinates?
A mistake on my part - I thought you could get the best results with an unordered_map indexed by elem->point(0), but on unstructured (and a few block-structured) coarse grids that won't be unique. Maybe safest to do what we do in the ParallelMesh code and hash on elem->centroid() instead. > How are elements ordered in the element iterators in adaptively refined > meshes? Do you loop over level 0, then level 1, then level 2? Or does the > ordering of the elements get changed with AMR? The ordering of existing elements doesn't get changed, but the ordering is very path-dependent; new elements generally get tacked on to the end of the list, and renumbered downward when coarsening frees up lower element numbers. --- Roy ------------------------------------------------------------------------------ Forrester Wave Report - Recovery time is now measured in hours and minutes not days. Key insights are discussed in the 2010 Forrester Wave Report as part of an in-depth evaluation of disaster recovery service providers. Forrester found the best-in-class provider in terms of services and vision. Read this report now! http://p.sf.net/sfu/ibm-webcastpromo _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
