Please use this identifier to cite or link to this item:
Title: Convergence speed of generalized longest-edge-based refinement
Authors: Suárez, José P. 
Moreno, Tania
Abad, Pilar 
Plaza, Ángel 
UNESCO Clasification: 120603 Análisis de errores
Issue Date: 2013
Journal: Lecture Notes in Electrical Engineering 
Conference: 2012 World Congress on Engineering, WCE 2012 
Abstract: In the refinement of meshes, one wishes to iteratively subdivide a domain following geometrical partition rules. The aim is to obtain a new discretized domain with adapted regions. We prove that the Longest Edge n -section of triangles for n⩾4 produces a finite sequence of triangle meshes with guaranteed convergence of diameters and review previous result when n equals 2 and 3. We give upper and lower bounds for the convergence speed in terms of diameter reduction. Then we fill the gap in the analysis of the diameters convergence for generalized Longest Edge based refinement. In addition, we give a numerical study for the case of n=4 , the so-called LE quatersection, evidencing its utility in adaptive mesh refinement.
ISBN: 978-94-007-6189-6
ISSN: 1876-1100
DOI: 10.1007/978-94-007-6190-2-39
Source: Yang GC., Ao S., Gelman L. (eds) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol 229, p. 511-522. Springer, Dordrecht,
Appears in Collections:Actas de congresos
Show full item record

Page view(s)

checked on Feb 4, 2023

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.