TBETI and TFETI algorithms for contact shape optimization problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F11%3A86089257" target="_blank" >RIV/61989100:27740/11:86089257 - isvavai.cz</a>
Result on the web
<a href="http://www.ctresources.info/ccp/paper.html?id=6251" target="_blank" >http://www.ctresources.info/ccp/paper.html?id=6251</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4203/ccp.95.3" target="_blank" >10.4203/ccp.95.3</a>

Result language
angličtina
Original language name
TBETI and TFETI algorithms for contact shape optimization problems
Original language description
The paper shows how to accelerate solution of contact shape optimization problems on massively parallel computers. We proposed two efficient algorithms for solution such problems. The first one is called Finite Element Tearing and Interconnecting (FETI)domain decomposition method, which is based on finite element approximation of the state problem. The second one is based on the boundary element approximation and we call it Boundary Element Tearing and Interconnecting (BETI) method. In this paper we shall apply those methods to the efficient parallel solution of sensitivity analysis which shows to be the most expensive part of the shape optimization process. The performance comparison of proposed methods will be demonstrated on the Hertz type problem.
Czech name
—
Czech description
—

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

Similar results(10)