About: TFETI Scalable Solvers for Transient Contact Problems

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

About: TFETI Scalable Solvers for Transient Contact Problems 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
rdfs:seeAlso	http://link.springer.com/chapter/10.1007%2F978-3-642-35275-1_38
Description	We review our results obtained by application of the TFETI domain decomposition method to implement the time step of the Newmark scheme for the solution of transient contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded as well as the ratio of the time and space discretization, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our 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 optimality relies on our results on quadratic programming, the theory of the preconditioning by a conjugate projector for nonlinear problems, and the classical bounds on the spectrum of the mass and stiffness matrices. The results are confirmed by numerical solution of 3D transient contact problems. We review our results obtained by application of the TFETI domain decomposition method to implement the time step of the Newmark scheme for the solution of transient contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded as well as the ratio of the time and space discretization, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our 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 optimality relies on our results on quadratic programming, the theory of the preconditioning by a conjugate projector for nonlinear problems, and the classical bounds on the spectrum of the mass and stiffness matrices. The results are confirmed by numerical solution of 3D transient contact problems. (en)
Title	TFETI Scalable Solvers for Transient Contact Problems TFETI Scalable Solvers for Transient Contact Problems (en)
skos:prefLabel	TFETI Scalable Solvers for Transient Contact Problems TFETI Scalable Solvers for Transient Contact Problems (en)
skos:notation	RIV/61989100:27230/13:86087931!RIV14-GA0-27230___
http://linked.open...avai/predkladatel	Fakulta strojní
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA101/08/0574), S, Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	2013
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Markopoulos, Alexandros
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 / Fakulta strojní
http://linked.open...dnocenehoVysledku	110795
http://linked.open...ai/riv/idVysledku	RIV/61989100:27230/13:86087931
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Strictly convexes; Stiffness matrices; Space discretizations; Rigid-body motion; Numerical solution; Nonlinear problems; Discretization parameters; Constrained quadratic programming (en)
http://linked.open.../riv/klicoveSlovo	Constrained quadratic programming Discretization parameters Nonlinear problems Rigid-body motion Space discretizations Stiffness matrices Strictly convexes Numerical solution
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[EFA7F9B51FF3]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computational Science and Engineering. Volume 91
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Solution to very complex contact problems with other non-linearities by modern mathematical methods
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	91
http://linked.open...iv/tvurceVysledku	Brzobohatý, Tomáš Dostál, Zdeněk Kozubek, Tomáš Markopoulos, Alexandros Vlach, Oldřich
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	1439-7358
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-35275-1_38
http://localhost/t...ganizacniJednotka	27230

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