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

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

Namespace Prefixes

PrefixIRI
n6http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n12https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n16http://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/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27740%2F11%3A86089257%21RIV14-MSM-27740___/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n23http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27740%2F11%3A86089257%21RIV14-MSM-27740___
rdf:type
n7:Vysledek skos:Concept
rdfs:seeAlso
http://www.ctresources.info/ccp/paper.html?id=6251
dcterms:description
The paper shows how to accelerate solution of contact shape optimization problems on massively parallel computers. We proposed two efficient algorithms for solution such problems. The first one is called Finite Element Tearing and Interconnecting (FETI) domain decomposition method, which is based on finite element approximation of the state problem. The second one is based on the boundary element approximation and we call it Boundary Element Tearing and Interconnecting (BETI) method. In this paper we shall apply those methods to the efficient parallel solution of sensitivity analysis which shows to be the most expensive part of the shape optimization process. The performance comparison of proposed methods will be demonstrated on the Hertz type problem. The paper shows how to accelerate solution of contact shape optimization problems on massively parallel computers. We proposed two efficient algorithms for solution such problems. The first one is called Finite Element Tearing and Interconnecting (FETI) domain decomposition method, which is based on finite element approximation of the state problem. The second one is based on the boundary element approximation and we call it Boundary Element Tearing and Interconnecting (BETI) method. In this paper we shall apply those methods to the efficient parallel solution of sensitivity analysis which shows to be the most expensive part of the shape optimization process. The performance comparison of proposed methods will be demonstrated on the Hertz type problem.
dcterms:title
TBETI and TFETI algorithms for contact shape optimization problems TBETI and TFETI algorithms for contact shape optimization problems
skos:prefLabel
TBETI and TFETI algorithms for contact shape optimization problems TBETI and TFETI algorithms for contact shape optimization problems
skos:notation
RIV/61989100:27740/11:86089257!RIV14-MSM-27740___
n7:predkladatel
n21:orjk%3A27740
n3:aktivita
n18:S
n3:aktivity
S
n3:dodaniDat
n4:2014
n3:domaciTvurceVysledku
n14:9411577 n14:5021391 n14:8606609
n3:druhVysledku
n23:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
234263
n3:idVysledku
RIV/61989100:27740/11:86089257
n3:jazykVysledku
n22:eng
n3:klicovaSlova
Parallel programming; Finite element method; Domain decomposition; Contact problem; Boundary element method
n3:klicoveSlovo
n5:Contact%20problem n5:Parallel%20programming n5:Finite%20element%20method n5:Boundary%20element%20method n5:Domain%20decomposition
n3:kontrolniKodProRIV
[18EF5BD02764]
n3:mistoKonaniAkce
Ajaccio
n3:mistoVydani
Kippen, Stirlingshire
n3:nazevZdroje
Civil-Comp Proceedings. Volume 95
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
4
n3:rokUplatneniVysledku
n4:2011
n3:tvurceVysledku
Kozubek, Tomáš Vondrák, Vít Sadowská, Marie Dostál, Zdeněk
n3:typAkce
n6:WRD
n3:zahajeniAkce
2011-04-12+02:00
s:numberOfPages
10
n16:doi
10.4203/ccp.95.3
n15:hasPublisher
Civil-Comp Press
n12:isbn
978-1-905088-42-3
n10:organizacniJednotka
27740