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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F14%3A00428478" target="_blank" >RIV/67985840:_____/14:00428478 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.scico.2013.05.002" target="_blank" >http://dx.doi.org/10.1016/j.scico.2013.05.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.scico.2013.05.002" target="_blank" >10.1016/j.scico.2013.05.002</a>

Result language
angličtina
Original language name
On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions
Original language description
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 alwaysproduces only face-to-face simplicial partitions. First, we prove that the regularity of the family of partitions generated by this algorithm is equivalent to its strong regularity in any dimension. Second, we present a number of 3 d numerical tests, which demonstrate that the technique seems to produce regular (and therefore strongly regular) families of tetrahedral partitions. However, a mathematical proof of this statement is still an open problem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GA14-02067S" target="_blank" >GA14-02067S: Advanced methods for flow-field analysis</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)