Non-linear scalable TFETI domain decomposition based contact algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86091987" target="_blank" >RIV/61989100:27240/10:86091987 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/10:86091987

Výsledek na webu

<a href="http://iopscience.iop.org/1757-899X/10/1/012161/pdf/1757-899X_10_1_012161.pdf" target="_blank" >http://iopscience.iop.org/1757-899X/10/1/012161/pdf/1757-899X_10_1_012161.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1088/1757-899X/10/1/012161" target="_blank" >10.1088/1757-899X/10/1/012161</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Non-linear scalable TFETI domain decomposition based contact algorithm

Popis výsledku v původním jazyce

The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, andcontact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid ismore effective. The basic theory and relationships of both FETI and TFETI are briefly reviewed and a new version of solution algorithm is presented. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective, in a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and paralle

Název v anglickém jazyce

Non-linear scalable TFETI domain decomposition based contact algorithm

Popis výsledku anglicky

The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, andcontact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid ismore effective. The basic theory and relationships of both FETI and TFETI are briefly reviewed and a new version of solution algorithm is presented. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective, in a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and paralle

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

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

IOP Conference Series: Materials Science and Engineering. Volume 10

ISBN

—

ISSN

1757-8981

e-ISSN

—

Počet stran výsledku

10

Strana od-do

"Article Number: 012161"

Název nakladatele

IOP Publishing

Místo vydání

Bristol

Místo konání akce

Sydney

Datum konání akce

19. 7. 2010

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

WRD - Celosvětová akce

Kód UT WoS článku

000290445000162