TFETI Coarse Space Projectors Parallelization Strategies

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084421" target="_blank" >RIV/61989100:27240/12:86084421 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/12:86084421
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-31464-3_16" target="_blank" >http://dx.doi.org/10.1007/978-3-642-31464-3_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-31464-3_16" target="_blank" >10.1007/978-3-642-31464-3_16</a>

Result language
angličtina
Original language name
TFETI Coarse Space Projectors Parallelization Strategies
Original language description
This paper deals with an analysis of various parallelization strategies for the TFETI algorithm. The data distributions and the most relevant actions are discussed, especially those concerning coarse problem. Being a part of the coarse space projector, it couples all the subdomains computations and accelerates convergence. Its direct solution is more robust but complicates the massively parallel implementation. Presented numerical results confirm high parallel scalability of the coarse problem solutionif the dual constraint matrix is distributed and then orthonormalized in parallel. Benchmarks were implemented using PETSc parallelization library and run on HECToR service at EPCC in Edinburgh.
Czech name
—
Czech description
—

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)