On global and local mesh refinements by a generalized conforming bisection algorithm

0346707 - MÚ 2011 RIV NL eng J - Článek v odborném periodiku
Hannukainen, A. - Korotov, S. - Křížek, Michal
On global and local mesh refinements by a generalized conforming bisection algorithm.
Journal of Computational and Applied Mathematics. Roč. 235, č. 2 (2010), s. 419-436. ISSN 0377-0427. E-ISSN 1879-1778
Grant CEP: GA AV ČR(CZ) IAA100190803
Výzkumný záměr: CEZ:AV0Z10190503
Klíčová slova: Zlámal's minimum angle condition * finite element method * nested triangulations * conforming longest-edge bisection algorithm * high aspect ratio elements
Kód oboru RIV: BA - Obecná matematika
Impakt faktor: 1.029, rok: 2010
http://www.sciencedirect.com/science/article/pii/S0377042710003365

We examine a generalized conforming bisection GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity properties of generated sequences of refined triangulations are proved. Several numerical tests demonstrate the efficiency of the proposed bisection algorithm. It is also shown how to modify the GCB-algorithm in order to generate anisotropic meshes with high aspect rations.
Trvalý link: http://hdl.handle.net/11104/0187658