Greedy bisection generates optimally adapted triangulations
From MaRDI portal
anisotropic triangulationerror estimatefinite element approximationgreedy bisection algorithmnon-conforming triangulation
Computer-aided design (modeling of curves and surfaces) (65D17) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Abstract: We study the properties of a simple greedy algorithm for the generation of data-adapted anisotropic triangulations. Given a function f, the algorithm produces nested triangulations and corresponding piecewise polynomial approximations of f. The refinement procedure picks the triangle which maximizes the local Lp approximation error, and bisect it in a direction which is chosen so to minimize this error at the next step. We study the approximation error in the Lp norm when the algorithm is applied to C2 functions with piecewise linear approximations. We prove that as the algorithm progresses, the triangles tend to adopt an optimal aspect ratio which is dictated by the local hessian of f. For convex functions, we also prove that the adaptive triangulations satisfy a convergence bound which is known to be asymptotically optimal among all possible triangulations.
Recommendations
- Adaptive finite element methods with convergence rates
- A fully optimal anisotropic mesh adaptation method based on a hierarchical error estimator
- Adaptive multiresolution analysis based on anisotropic triangulations
- scientific article; zbMATH DE number 4126634
- A Posteriori Error Estimates Based on Hierarchical Bases
- Convergence analysis of an adaptive nonconforming finite element method
- A WAVE EQUATION MODEL TO SOLVE THE MULTIDIMENSIONAL TRANSPORT EQUATION
- Convergence and quasi-optimality of an adaptive finite element method for controlling \(L_{2}\) errors
- On adaptivity for diffusion problems using triangular elements
- Adaptive refinement criterion for elliptic problems discretized by FEM
Cites work
- Adaptive multiresolution analysis based on anisotropic triangulations
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 2016957 (Why is no real title available?)
- New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
- On minimizing the linear interpolation error of convex quadratic functions and the optimal simplex
- On the Error of Linear Interpolation and the Orientation, Aspect Ratio, and Internal Angles of a Triangle
- Optimal anisotropic meshes for minimizing interpolation errors in L^p-norm
Cited in
(12)- Adaptive anisotropic Petrov-Galerkin methods for first order transport equations
- Adaptive finite element methods with convergence rates
- Constructive approximation on graded meshes for the integral fractional Laplacian
- Anisotropic Triangulation Methods in Adaptive Image Approximation
- scientific article; zbMATH DE number 6719480 (Why is no real title available?)
- scientific article; zbMATH DE number 1189327 (Why is no real title available?)
- Red-green refinement of simplicial meshes in \(d\) dimensions
- An adaptive triangulation method for bivariate spline solutions of PDEs
- Optimal \(N\)-term approximation by linear splines over anisotropic Delaunay triangulations
- Efficient resolution of anisotropic structures
- Adaptive multiresolution analysis based on anisotropic triangulations
- Introduction to vector quantization and its applications for numerics
This page was built for publication: Greedy bisection generates optimally adapted triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389434)
