Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084365" target="_blank" >RIV/61989100:27240/12:86084365 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/12:86084365

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.cma.2012.08.003" target="_blank" >http://dx.doi.org/10.1016/j.cma.2012.08.003</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cma.2012.08.003" target="_blank" >10.1016/j.cma.2012.08.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

Popis výsledku v původním jazyce

The FETI based domain decomposition method is adapted to implement the time step of the Newmark scheme for the solution of dynamic contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our in a sense optimal MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optionalpreconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The proof of optimality combines the convergence theory of our MPRGP algorithm, the classical bounds on thespectrum of the mass and stiffness matrices, and our theory of the preconditioning by a conjugate projector for nonlinear problems. The results are confirmed by numerical solution of 2D and 3D dynamic contact problems.

Název v anglickém jazyce

Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

Popis výsledku anglicky

The FETI based domain decomposition method is adapted to implement the time step of the Newmark scheme for the solution of dynamic contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our in a sense optimal MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optionalpreconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The proof of optimality combines the convergence theory of our MPRGP algorithm, the classical bounds on thespectrum of the mass and stiffness matrices, and our theory of the preconditioning by a conjugate projector for nonlinear problems. The results are confirmed by numerical solution of 2D and 3D dynamic contact problems.

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/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

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

Computer Methods in Applied Mechanics and Engineering

ISSN

0045-7825

e-ISSN

—

Svazek periodika

247

Číslo periodika v rámci svazku

Neuveden

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

37-50

Kód UT WoS článku

000310944400003

EID výsledku v databázi Scopus

—