The Selection of Fixing Nodes for the FETI-DP Method in Three Dimensions

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The Selection of Fixing Nodes for the FETI-DP Method in Three Dimensions

Popis výsledku v původním jazyce

This contributions deals with a selection algorithm of fixing nodes for the FETI-DP method, which is non-overlapping domain decomposition method. Fixing nodes enforce non-singularity of subdomain matrices and matrix of the coarse problem. The selection of proper fixing nodes deserves a special attention. The developed algorithm is based on the selection form graph which is created form interface nodes of finite element mesh. The selection procedure is described in the contribution and is able to chose aminimal needed number of fixing nodes. An extended algorithm was also created. This algorithm can increase the number of fixing nodes which lead to improving convergence of the coarse problem. It was observed during numerical tests. But the large numberof fixing nodes can lead to prolongation of the whole solution of the problem. An optimal number of fixing nodes exists for each problem. The optimal number results in the shortest time of the whole solution.

Název v anglickém jazyce

The Selection of Fixing Nodes for the FETI-DP Method in Three Dimensions

Popis výsledku anglicky

This contributions deals with a selection algorithm of fixing nodes for the FETI-DP method, which is non-overlapping domain decomposition method. Fixing nodes enforce non-singularity of subdomain matrices and matrix of the coarse problem. The selection of proper fixing nodes deserves a special attention. The developed algorithm is based on the selection form graph which is created form interface nodes of finite element mesh. The selection procedure is described in the contribution and is able to chose aminimal needed number of fixing nodes. An extended algorithm was also created. This algorithm can increase the number of fixing nodes which lead to improving convergence of the coarse problem. It was observed during numerical tests. But the large numberof fixing nodes can lead to prolongation of the whole solution of the problem. An optimal number of fixing nodes exists for each problem. The optimal number results in the shortest time of the whole solution.

Druh

D - Stať ve sborníku

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 statě ve sborníku

Proceedings of the Seventh International Conference on Engineering Computational Technology

ISBN

978-1-905088-40-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

Civil-Comp Press Ltd

Místo vydání

Stirling

Místo konání akce

Valencie

Datum konání akce

14. 9. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—