Adaptive Mesh Refinement for arbitrary initial Triangulations

06/05/2023
by   Lars Diening, et al.
0

We introduce a simple initialization of the Maubach bisection routine for adaptive mesh refinement. This initialization applies to any conforming initial triangulation. It preserves shape regularity, satisfies the closure estimate needed for optimal convergence of adaptive schemes, and allows for the intrinsic use of existing implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2021

Construction of 4D Simplex Space-Time Meshes for Local Bisection Schemes

Adaptive mesh refinement is a key component of efficient unstructured sp...
research
03/13/2023

Adaptive mesh refinement for the Landau-Lifshitz-Gilbert equation

We propose a new adaptive algorithm for the approximation of the Landau-...
research
08/15/2021

Smart Adaptive Mesh Refinement with NEMoSys

Adaptive mesh refinement (AMR) offers a practical solution to reduce the...
research
05/02/2023

The Constant in the Theorem of Binev-Dahmen-DeVore-Stevenson and a Generalisation of it

A triangulation of a polytope into simplices is refined recursively. In ...
research
04/03/2023

Swarm Reinforcement Learning For Adaptive Mesh Refinement

Adaptive Mesh Refinement (AMR) is crucial for mesh-based simulations, as...
research
08/27/2020

Inf-sup stability implies quasi-orthogonality

We prove new optimality results for adaptive mesh refinement algorithms ...
research
08/16/2019

Extending editing capabilities of subdivision schemes by refinement of point-normal pairs

In this paper we extend the 2D circle average of [11] to a 3D binary ave...

Please sign up or login with your details

Forgot password? Click here to reset