This HTML5 document contains 54 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/
n11http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27740%2F12%3A86084365%21RIV13-MSM-27740___/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n12http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27740%2F12%3A86084365%21RIV13-MSM-27740___
rdf:type
skos:Concept n7:Vysledek
dcterms:description
The FETI based domain decomposition method is adapted to implement the time step of the Newmark scheme for the solution of dynamic contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our in a sense optimal MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optional preconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The proof of optimality combines the convergence theory of our MPRGP algorithm, the classical bounds on the spectrum of the mass and stiffness matrices, and our theory of the preconditioning by a conjugate projector for nonlinear problems. The results are confirmed by numerical solution of 2D and 3D dynamic contact problems. The FETI based domain decomposition method is adapted to implement the time step of the Newmark scheme for the solution of dynamic contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our in a sense optimal MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optional preconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The proof of optimality combines the convergence theory of our MPRGP algorithm, the classical bounds on the spectrum of the mass and stiffness matrices, and our theory of the preconditioning by a conjugate projector for nonlinear problems. The results are confirmed by numerical solution of 2D and 3D dynamic contact problems.
dcterms:title
Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
skos:prefLabel
Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
skos:notation
RIV/61989100:27740/12:86084365!RIV13-MSM-27740___
n7:predkladatel
n17:orjk%3A27740
n3:aktivita
n20:Z n20:S n20:P
n3:aktivity
P(ED1.1.00/02.0070), S, Z(MSM6198910027)
n3:cisloPeriodika
Neuveden
n3:dodaniDat
n8:2013
n3:domaciTvurceVysledku
n14:7294611 n14:8606609 n14:5291704 n14:5021391 n14:7723318
n3:druhVysledku
n21:J
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
166787
n3:idVysledku
RIV/61989100:27740/12:86084365
n3:jazykVysledku
n10:eng
n3:klicovaSlova
scalability; transient; dynamics; multibody contact problem; natural coarse grid; Domain decomposition
n3:klicoveSlovo
n4:natural%20coarse%20grid n4:dynamics n4:Domain%20decomposition n4:multibody%20contact%20problem n4:scalability n4:transient
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[95725B3C5981]
n3:nazevZdroje
Computer Methods in Applied Mechanics and Engineering
n3:obor
n18:BA
n3:pocetDomacichTvurcuVysledku
5
n3:pocetTvurcuVysledku
5
n3:projekt
n19:ED1.1.00%2F02.0070
n3:rokUplatneniVysledku
n8:2012
n3:svazekPeriodika
247
n3:tvurceVysledku
Kozubek, Tomáš Vlach, Oldřich Dostál, Zdeněk Markopoulos, Alexandros Brzobohatý, Tomáš
n3:wos
000310944400003
n3:zamer
n15:MSM6198910027
s:issn
0045-7825
s:numberOfPages
14
n12:doi
10.1016/j.cma.2012.08.003
n11:organizacniJednotka
27740