Selection strategy for fixing nodes in FETI-DP method

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F10%3A00169180" target="_blank" >RIV/68407700:21110/10:00169180 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Selection strategy for fixing nodes in FETI-DP method

Popis výsledku v původním jazyce

This paper deals with selection strategy of fixing nodes in the FETI-DP method. The FETI-DP method is one of non-overlapping domain decomposition methods. The method was published by Farhat and co-workers in 2001. Selection of the fixing unknowns in theFETI-DP, TFETI or BDDC domain decomposition method has strong influence on the method behavior. The selection itself is not straightforward in the case of irregular domains and subdomains. Three-step algorithm for the selection of the fixing unknowns ispresented and some numerical examples are shown. The algorithm is based on nodal multiplicity, which is the number of subdomains sharing the node. If the three-step algorithm selects unsatisfactory number of fixing nodes, additional geometrical conditions are applied. These conditions lead to selection of additional fixing nodes. Moreover, higher number of the fixing nodes usually results in better convergence of the coarse problems.

Název v anglickém jazyce

Selection strategy for fixing nodes in FETI-DP method

Popis výsledku anglicky

This paper deals with selection strategy of fixing nodes in the FETI-DP method. The FETI-DP method is one of non-overlapping domain decomposition methods. The method was published by Farhat and co-workers in 2001. Selection of the fixing unknowns in theFETI-DP, TFETI or BDDC domain decomposition method has strong influence on the method behavior. The selection itself is not straightforward in the case of irregular domains and subdomains. Three-step algorithm for the selection of the fixing unknowns ispresented and some numerical examples are shown. The algorithm is based on nodal multiplicity, which is the number of subdomains sharing the node. If the three-step algorithm selects unsatisfactory number of fixing nodes, additional geometrical conditions are applied. These conditions lead to selection of additional fixing nodes. Moreover, higher number of the fixing nodes usually results in better convergence of the coarse problems.

Druh

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

CEP obor

JN - Stavebnictví

OECD FORD obor

—

Projekt

<a href="/cs/project/GD103%2F09%2FH078" target="_blank" >GD103/09/H078: Počítačová a experimentální analýza stavebních materiálů a jejich vícevrstvých systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2010

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

Pollack Periodica, An International Journal for Engineering and Information Sciences

ISSN

1788-1994

e-ISSN

—

Svazek periodika

5

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

HU - Maďarsko

Počet stran výsledku

12

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—