Numerical comparison of different choices of interface weights in the BDDC method

0376944 - MÚ 2013 RIV CZ eng C - Conference Paper (international conference)
Čertíková, M. - Burda, P. - Šístek, Jakub
Numerical comparison of different choices of interface weights in the BDDC method.
Proceedings of the International Conference Applications of Mathematics 2012. Prague: Institute of Mathematics AS CR, 2012 - (Brandts, J.; Chleboun, J.; Korotov, S.; Segeth, K.; Šístek, J.; Vejchodský, T.), s. 55-61. ISBN 978-80-85823-60-8.
[Applications of Mathematics 2012. Prague (CZ), 02.05.2012-05.05.2012]
Institutional support: RVO:67985840
Keywords : BDDC * domain decomposition * iterative substructuring * averaging
Subject RIV: BA - General Mathematics
http://www.math.cas.cz/~am2012/proceedings/contributions/certikova.pdf

Balancing Domain Decomposition by Constraints (BDDC) belongs to the class of primal substructuring Domain Decomposition (DD) methods. DD methods are iterative methods successfully used in engineering to parallelize solution of large linear systems arising from discretization of second order elliptic problems. Substructuring DD methods represent an important class of DD methods. Their main idea is to divide the underlying domain into nonoverlapping subdomains and solvemany relatively small, local problems on subdomains instead of one large problem on the whole domain. In primal methods, it has to be specified how to distribute interface residuals among subdomains and how to obtain global, interface values of solution from local values on adjacent subdomains. Usually a weighted average is used with some simple choice of weights.
Permanent Link: http://hdl.handle.net/11104/0209223