About: Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/61989100:27740/12:86084365!RIV13-MSM-27740___
http://linked.open...avai/predkladatel	IT4Innovations
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), S, Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	Neuveden
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Dostál, Zdeněk Brzobohatý, Tomáš Markopoulos, Alexandros Kozubek, Tomáš Vlach, Oldřich
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / IT4Innovations
http://linked.open...dnocenehoVysledku	166787
http://linked.open...ai/riv/idVysledku	RIV/61989100:27740/12:86084365
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	scalability; transient; dynamics; multibody contact problem; natural coarse grid; Domain decomposition (en)
http://linked.open.../riv/klicoveSlovo	scalability Domain decomposition dynamics transient multibody contact problem natural coarse grid
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[95725B3C5981]
http://linked.open...i/riv/nazevZdroje	Computer Methods in Applied Mechanics and Engineering
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	5 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	247
http://linked.open...iv/tvurceVysledku	Brzobohatý, Tomáš Dostál, Zdeněk Kozubek, Tomáš Markopoulos, Alexandros Vlach, Oldřich
http://linked.open...ain/vavai/riv/wos	000310944400003
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	0045-7825
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.cma.2012.08.003
http://localhost/t...ganizacniJednotka	27740
is http://linked.open...avai/riv/vysledek of	Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software