On selection of interface weights in domain decomposition methods
Čertíková, Marta; Šístek, Jakub; Burda, Pavel
- Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics AS CR(Prague), page 35-44
Access Full Article
topAbstract
topHow to cite
topČertíková, Marta, Šístek, Jakub, and Burda, Pavel. "On selection of interface weights in domain decomposition methods." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2013. 35-44. <http://eudml.org/doc/271305>.
@inProceedings{Čertíková2013,
abstract = {Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments.
Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.},
author = {Čertíková, Marta, Šístek, Jakub, Burda, Pavel},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {domain decomposition; finite elements; sparse matrices; balancing domain decomposition by constrains method; interface weights; averaging operator},
location = {Prague},
pages = {35-44},
publisher = {Institute of Mathematics AS CR},
title = {On selection of interface weights in domain decomposition methods},
url = {http://eudml.org/doc/271305},
year = {2013},
}
TY - CLSWK
AU - Čertíková, Marta
AU - Šístek, Jakub
AU - Burda, Pavel
TI - On selection of interface weights in domain decomposition methods
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2013
CY - Prague
PB - Institute of Mathematics AS CR
SP - 35
EP - 44
AB - Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments.
Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.
KW - domain decomposition; finite elements; sparse matrices; balancing domain decomposition by constrains method; interface weights; averaging operator
UR - http://eudml.org/doc/271305
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.