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

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

Namespace Prefixes

PrefixIRI
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F02%3A00006692%21RIV%2F2003%2FGA0%2F272403%2FN/
n14http://localhost/temp/predkladatel/
n4http://purl.org/net/nknouf/ns/bibtex#
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n8https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n22http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F02%3A00006692%21RIV%2F2003%2FGA0%2F272403%2FN
rdf:type
skos:Concept n12:Vysledek
dcterms:description
FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o
dcterms:title
Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization
skos:prefLabel
Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization
skos:notation
RIV/61989100:27240/02:00006692!RIV/2003/GA0/272403/N
n5:strany
361-370
n5:aktivita
n15:P n15:Z
n5:aktivity
P(GA101/01/0538), Z(MSM 272400019)
n5:dodaniDat
n17:2003
n5:domaciTvurceVysledku
n10:8754748 n10:9411577 n10:5021391
n5:druhVysledku
n9:D
n5:duvernostUdaju
n19:S
n5:entitaPredkladatele
n11:predkladatel
n5:idSjednocenehoVysledku
662999
n5:idVysledku
RIV/61989100:27240/02:00006692
n5:jazykVysledku
n13:eng
n5:klicovaSlova
Contact shape optimization
n5:klicoveSlovo
n22:Contact%20shape%20optimization
n5:kontrolniKodProRIV
[E4F8D5272FBF]
n5:mistoKonaniAkce
Lyon, France
n5:mistoVydani
Barcelona
n5:nazevZdroje
Domain Decomposition Methods in Science and Engineering
n5:obor
n6:BA
n5:pocetDomacichTvurcuVysledku
3
n5:pocetTvurcuVysledku
4
n5:pocetUcastnikuAkce
0
n5:pocetZahranicnichUcastnikuAkce
0
n5:projekt
n20:GA101%2F01%2F0538
n5:rokUplatneniVysledku
n17:2002
n5:tvurceVysledku
Vondrák, Vít Szweda, Jan Horák, David Dostál, Zdeněk
n5:typAkce
n18:EUR
n5:zahajeniAkce
2000-01-01+01:00
n5:zamer
n21:MSM%20272400019
s:numberOfPages
10
n4:hasPublisher
CIMNE
n8:isbn
84-95999-07-2
n14:organizacniJednotka
27240