On Mon, Feb 13, 2017 at 6:03 PM, Salazar De Troya, Miguel < [email protected]> wrote:
> > I’ve read in several papers that in AMR the most common marking strategy > is Dorfler marking, which is mathematically grounded. There is some theory that, under some other regularity assumptions (that can be proven for quite a few problems), Dorfler marking provides optimality for the adaptive refinement process. I admit I'm not deeply familiar with the theory. Carsetensen's paper ( https://arxiv.org/pdf/1312.1171.pdf) and Nochetto's review paper ( http://www-users.math.umd.edu/~rhn/lectures/adaptivity.pdf) are probably good starting points (both have been on my "to read" list for awhile now). > However, I have not seen this implemented in libMesh. It looks as though it's not. Patches welcome! (I would envision this would be dropped in MeshRefinement as flag_elements_by_dorfler() or some such.) > I believe that this marking strategy does not consider the coarsening > portion of the refinement. I believe there might be some extensions through brief Googling, but I haven't read anything in detail. Nevertheless, it is noted that coarsening is really only important for unsteady problems as, theoretically, optimal adaptive refinement for steady problems does not require coarsening. > On which theories are the current marking strategies libMesh implements > based? > Maximum strategies, i.e. refine some fraction of the max (which goes back to Babuska). Best, Paul ------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, SlashDot.org! http://sdm.link/slashdot _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
