Projector-less TFETI for contact problems: Preliminary results

Result code in 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>
Alternative codes found
RIV/61989100:27740/17:10237665
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Projector-less TFETI for contact problems: Preliminary results
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)