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...

Celý popis

Podrobná bibliografia

Vydané v:	Science of computer programming Ročník 90; s. 34 - 41
Hlavní autori:	Hannukainen, Antti, Korotov, Sergey, Křížek, Michal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.09.2014
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!