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

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA14-02067S" target="_blank" >GA14-02067S: Pokročilé metody pro analýzu proudových polí</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Science of Computer Programming

ISSN

0167-6423

e-ISSN

—

Svazek periodika

90

Číslo periodika v rámci svazku

Part A

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

34-41

Kód UT WoS článku

000338387700004

EID výsledku v databázi Scopus

—