Near-best adaptive approximation on conforming meshes

12/31/2019
by   Peter Binev, et al.
0

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be subdivided are affected by that particular structure. As main result, we prove near best approximation with respect to conforming meshes, independent of constants like the completion constant for newest-vertex bisection. Numerical experiments complement the theoretical results and indicate better approximation properties than previous approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2021

The Scott-Vogelius Method for Stokes Problem on Anisotropic Meshes

This paper analyzes the Scott-Vogelius divergence-free element pair on a...
research
04/21/2023

A convection-diffusion problem with a large shift on Duran meshes

A convection-diffusion problem with a large shift in space is considered...
research
07/03/2019

BPX preconditioners for isogeometric analysis using analysis-suitable T-splines

We propose and analyze optimal additive multilevel solvers for isogeomet...
research
11/26/2019

Complexity bounds on supermesh construction for quasi-uniform meshes

Projecting fields between different meshes commonly arises in computatio...
research
02/06/2023

Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation

Our main result is designing an algorithm that returns a vertex cover of...
research
05/04/2000

Connectivity Compression for Irregular Quadrilateral Meshes

Applications that require Internet access to remote 3D datasets are ofte...
research
01/10/2023

Adaptive Quarklet Tree Approximation

This paper is concerned with near-optimal approximation of a given funct...

Please sign up or login with your details

Forgot password? Click here to reset