http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Cirrottola_Froehly_2021aCirrottola Froehly 2021a - Revision history2026-06-10T14:01:24ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Cirrottola_Froehly_2021a&diff=219112&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 600444449 to Cirrottola Froehly 2021a2021-03-11T16:00:39Z<p>Scipediacontent moved page <a href="/public/Draft_Content_600444449" class="mw-redirect" title="Draft Content 600444449">Draft Content 600444449</a> to <a href="/public/Cirrottola_Froehly_2021a" title="Cirrottola Froehly 2021a">Cirrottola Froehly 2021a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 16:00, 11 March 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Cirrottola_Froehly_2021a&diff=219111&oldid=prevScipediacontent: Created page with "== Abstract == We present a parallel unstructured mesh adaptation algorithm based on iterative remeshing and mesh repartitioning. The algorithm rests on a two-level paralleli..."2021-03-11T16:00:36Z<p>Created page with "== Abstract == We present a parallel unstructured mesh adaptation algorithm based on iterative remeshing and mesh repartitioning. The algorithm rests on a two-level paralleli..."</p>
<p><b>New page</b></p><div>== Abstract ==<br />
<br />
We present a parallel unstructured mesh adaptation algorithm based on iterative remeshing and mesh repartitioning. The algorithm rests on a two-level parallelization scheme allowing to tweak the mesh group size for remeshing, and on a mesh repartitioning scheme based on interface displacement by front advancement. The numerical procedure is implemented in the open source ParMmg software package. It enables the reuse of existing sequential remeshing libraries, a non-intrusive linkage with thirdparty solvers, and a tunable exploitation of distributed parallel environments. We show the efficiency of the approach by comparing interface displacement repartitioning with graph-based repartitioning, and by showing isotropic weak-scaling tests and preliminary anisotropic tests.<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Content_600444449p1957.pdf</pdf></div>Scipediacontent