On global and local mesh refinements by a generalized conforming bisection algorithm
type: Item
instance of: scholarly article
title: On global and local mesh refinements by a generalized conforming bisection algorithm
zbMATH Open document ID: 1207.65145
author: Antti Hannukainen
author: Sergey Korotov
author: Michal Křížek
published in: Journal of Computational and Applied Mathematics
publication date: 2010-10-07T00:00:00Z
review text: The authors examine a generalized conforming bisection algorithm used for solving nonlinear equations and apply it to the finite element method for mesh refinement/adaptation purposes. The general idea in this work is to modify the standard longest-edge bisection algorithms as follows: for bisection they choose not the longest-edge in a given triangulation, but the edge which has a maximal value of its length multiplied by the value of the mesh density function (defined a priori) at the middle of the edge. Finally, some numerical results obtained with the method are presented.
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65N30
zbMATH DE Number: 5796769
zbMATH Keywords: conforming bisection algorithm
zbMATH Keywords: convergence
zbMATH Keywords: finite element method
zbMATH Keywords: mesh density function
zbMATH Keywords: nested triangulations
zbMATH Keywords: mesh refinement
zbMATH Keywords: numerical results
reviewed by: Ariadna Lucia Pletea
MaRDI profile type: Publication
full work available at URL: j.cam.2010.05.046
OpenAlex ID: W2150727680
cites work: A bisection method for systems of nonlinear equations
cites work: A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
cites work: Q3868686
cites work: A Proof of Convergence and an Error Bound for the Method of Bisection in R n
cites work: A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
cites work: On Faster Convergence of the Bisection Method for Certain Triangles
cites work: On Faster Convergence of the Bisection Method for all Triangles
cites work: Q3672608
cites work: Optimal Dissection of Simplices
cites work: Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
cites work: Selective refinement/derefinement algorithms for sequences of nested triangulations
cites work: The 4-triangles longest-side partition of triangles and linear refinement algorithms
cites work: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
cites work: On the Bisection Method for Triangles
cites work: Locally Adapted Tetrahedral Meshes Using Bisection
cites work: Local mesh refinement in 2 and 3 dimensions
cites work: On generalized bisection of 𝑛-simplices
cites work: On the Shape of Tetrahedra from Bisection
cites work: Quality Local Refinement of Tetrahedral Meshes Based on Bisection
cites work: Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
cites work: Local refinement of simplicial grids based on the skeleton
cites work: The completion of locally refined simplicial partitions created by bisection
cites work: AN ADAPTIVE FINITE ELEMENT METHOD WITH EFFICIENT MAXIMUM NORM ERROR CONTROL FOR ELLIPTIC PROBLEMS
cites work: Lepp-bisection algorithms, applications and mathematical properties
cites work: On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
cites work: On the finite element method
cites work: Q4266502
DOI: 10.1016/J.CAM.2010.05.046
description: scientific article; zbMATH DE number 5796769