On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions

The finite element method usually requires regular or strongly regular families of partitions in order to get guaranteed a priori or a posteriori error estimates. In this paper we examine the recently invented longest-edge bisection algorithm that always produces only face-to-face simplicial partiti...

Full description

Bibliographic Details

Published in:	Science of computer programming Vol. 90; pp. 34 - 41
Main Authors:	Hannukainen, Antti, Korotov, Sergey, Křížek, Michal
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.09.2014
Subjects:	Bisection algorithm Conforming finite element method Nested tetrahedral partitions Regular family of partitions Simplicial elements Bisection algorithm Simplicial elements Conforming finite element method Nested tetrahedral partitions Regular family of partitions
ISSN:	0167-6423, 1872-7964
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!