This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21220%2F12%3A00201957%21RIV13-MSM-21220___/
skoshttp://www.w3.org/2004/02/skos/core#
n6http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21220%2F12%3A00201957%21RIV13-MSM-21220___
rdf:type
n14:Vysledek skos:Concept
dcterms:description
In most recent substructuring methods, a fundamental role is played by the coarse space. For some of these methods (e.g. BDDC and FETI-DP), its definition relies on a 'minimal' set of coarse nodes (sometimes called corners) which assures invertibility of local subdomain problems and also of the global coarse problem. This basic set is typically enhanced by enforcing continuity of functions at some generalized degrees of freedom, such as average values on edges or faces of subdomains. We revisit existing algorithms for selection of corners. The main contribution of this paper consists of proposing a new heuristic algorithm for this purpose. Considering faces as the basic building blocks of the interface, inherent parallelism, and better robustness with respect to disconnected subdomains are among features of the new technique. The advantages of the presented algorithm in comparison to some earlier approaches are demonstrated on three engineering problems of structural analysis solved by the BDDC method. In most recent substructuring methods, a fundamental role is played by the coarse space. For some of these methods (e.g. BDDC and FETI-DP), its definition relies on a 'minimal' set of coarse nodes (sometimes called corners) which assures invertibility of local subdomain problems and also of the global coarse problem. This basic set is typically enhanced by enforcing continuity of functions at some generalized degrees of freedom, such as average values on edges or faces of subdomains. We revisit existing algorithms for selection of corners. The main contribution of this paper consists of proposing a new heuristic algorithm for this purpose. Considering faces as the basic building blocks of the interface, inherent parallelism, and better robustness with respect to disconnected subdomains are among features of the new technique. The advantages of the presented algorithm in comparison to some earlier approaches are demonstrated on three engineering problems of structural analysis solved by the BDDC method.
dcterms:title
Face-based Selection of Corners in 3D Substructuring Face-based Selection of Corners in 3D Substructuring
skos:prefLabel
Face-based Selection of Corners in 3D Substructuring Face-based Selection of Corners in 3D Substructuring
skos:notation
RIV/68407700:21220/12:00201957!RIV13-MSM-21220___
n14:predkladatel
n19:orjk%3A21220
n4:aktivita
n12:Z n12:P
n4:aktivity
P(GA106/08/0403), P(IAA100760702), Z(AV0Z10190503), Z(MSM6840770010)
n4:cisloPeriodika
10
n4:dodaniDat
n13:2013
n4:domaciTvurceVysledku
n10:5240018 n10:3542653
n4:druhVysledku
n15:J
n4:duvernostUdaju
n11:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
136002
n4:idVysledku
RIV/68407700:21220/12:00201957
n4:jazykVysledku
n20:eng
n4:klicovaSlova
domain decomposition; iterative substructuring; BDDC; parallel algorithms; corner selection
n4:klicoveSlovo
n5:parallel%20algorithms n5:iterative%20substructuring n5:domain%20decomposition n5:BDDC n5:corner%20selection
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[71A3911E56E9]
n4:nazevZdroje
Mathematics and Computers in Simulation
n4:obor
n16:BA
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
4
n4:projekt
n7:IAA100760702 n7:GA106%2F08%2F0403
n4:rokUplatneniVysledku
n13:2012
n4:svazekPeriodika
82
n4:tvurceVysledku
Čertíková, Marta Burda, Pavel Novotný, J. Šístek, J.
n4:wos
000308519900007
n4:zamer
n8:MSM6840770010 n8:AV0Z10190503
s:issn
0378-4754
s:numberOfPages
13
n6:doi
10.1016/j.matcom.2011.06.007
n21:organizacniJednotka
21220