English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Adaptive meshing is a fundamental component of adaptive finite elementmethods. This includes refining and coarsening meshes locally. In this work, weare concerned with the red-green-blue refinement strategy in two dimensions andits counterpart - coarsening. In general, coarsening algorithms are mostlybased on an explicitly given refinement history. In this work, we present acoarsening algorithm on adaptive red-green-blue meshes in two dimensionswithout explicitly knowing the refinement history. To this end, we examine thelocal structure of these meshes, find an easy-to-verify criterion to adaptivelycoarsen red-green-blue meshes and prove that this criterion generates mesheswith the desired properties. We present a MATLAB implementation built on thered-green-blue refinement routine of the ameshref-package.

A Coarsening Algorithm on Adaptive Red-Green-Blue Refined Meshes