Original title: Numerical comparison of different choices of interface weights in the BDDC method
Authors: Čertíková, M. ; Burda, P. ; Šístek, Jakub
Document type: Papers
Conference/Event: Applications of Mathematics 2012, Prague (CZ), 2012-05-02 / 2012-05-05
Year: 2012
Language: eng
Abstract: 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.
Keywords: averaging; BDDC; domain decomposition; iterative substructuring
Host item entry: Proceedings of the International Conference Applications of Mathematics 2012, ISBN 978-80-85823-60-8

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at external website.
External URL: http://www.math.cas.cz/~am2012/proceedings/contributions/certikova.pdf
Original record: http://hdl.handle.net/11104/0209223

Permalink: http://www.nusl.cz/ntk/nusl-112739


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Conference materials > Papers