Projector-less TFETI for contact problems: Preliminary results

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10237665" target="_blank" >RIV/61989100:27240/17:10237665 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/17:10237665

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Projector-less TFETI for contact problems: Preliminary results

Popis výsledku v původním jazyce

The FETI methods turned out to be very efficient for the solution of large problems arising from the discretization of elliptic partial differential equations (PDEs), but their parallel scalability can be degraded by the increasing cost of the projectors containing coarse problem (CP) solution. If applied to discretized variational inequalities, the relevant quadratic programming (QP) problems employing FETI methods can be solved by means of the MPRGP and SMALBE algorithms. The Hessian matrix contains three projector applications that can be implemented using two CP solutions. These QP algorithms and FETI methods are implemented in our PERMON software package based on PETSc. The paper deals with the modification of the TFETI method that eliminates applications of the projectors while the numerical scalability of the solver is preserved. This can be achieved by using the Moore-Penrose pseudoinverse, obtainable by projecting the input vector onto the range of the stiffness matrix. This operation is purely local and very cheap. Numerical experiments demonstrating performance of this new approach are presented. © Civil-Comp Press, 2017.

Název v anglickém jazyce

Projector-less TFETI for contact problems: Preliminary results

Popis výsledku anglicky

The FETI methods turned out to be very efficient for the solution of large problems arising from the discretization of elliptic partial differential equations (PDEs), but their parallel scalability can be degraded by the increasing cost of the projectors containing coarse problem (CP) solution. If applied to discretized variational inequalities, the relevant quadratic programming (QP) problems employing FETI methods can be solved by means of the MPRGP and SMALBE algorithms. The Hessian matrix contains three projector applications that can be implemented using two CP solutions. These QP algorithms and FETI methods are implemented in our PERMON software package based on PETSc. The paper deals with the modification of the TFETI method that eliminates applications of the projectors while the numerical scalability of the solver is preserved. This can be achieved by using the Moore-Penrose pseudoinverse, obtainable by projecting the input vector onto the range of the stiffness matrix. This operation is purely local and very cheap. Numerical experiments demonstrating performance of this new approach are presented. © Civil-Comp Press, 2017.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2017

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

Civil-Comp Proceedings. Volume 111

ISSN

1759-3433

e-ISSN

—

Svazek periodika

111

Číslo periodika v rámci svazku

2017

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

13

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85020383251