About: Scalable TFETI algorithm for the solution of multibody contact problems of elasticity

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

About: Scalable TFETI algorithm for the solution of multibody 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	A Total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid of the rigid body motions is adapted to the solution of contact problems of elasticity in 2D and 3D and proved to be scalable for coercive problems. Thus for the problems with prescribed displacements that are sufficient to prevent the bodies from ``floating'', our algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. A Total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid of the rigid body motions is adapted to the solution of contact problems of elasticity in 2D and 3D and proved to be scalable for coercive problems. Thus for the problems with prescribed displacements that are sufficient to prevent the bodies from ``floating'', our algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. (en)
Title	Scalable TFETI algorithm for the solution of multibody contact problems of elasticity Scalable TFETI algorithm for the solution of multibody contact problems of elasticity (en)
skos:prefLabel	Scalable TFETI algorithm for the solution of multibody contact problems of elasticity Scalable TFETI algorithm for the solution of multibody contact problems of elasticity (en)
skos:notation	RIV/61989100:27230/10:86075323!RIV11-GA0-27230___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/07/0294), Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	11
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Brzobohatý, Tomáš 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	286417
http://linked.open...ai/riv/idVysledku	RIV/61989100:27230/10:86075323
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	scalability; coercive contact problem; natural coarse grid; Domain decomposition (en)
http://linked.open.../riv/klicoveSlovo	scalability Domain decomposition coercive contact problem natural coarse grid
http://linked.open...odStatuVydavatele	GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV	[99842DDEBB3C]
http://linked.open...i/riv/nazevZdroje	INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Qualitative analysis of contact problems with friction and asymptotically optimal algorithms for their solution
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	82
http://linked.open...iv/tvurceVysledku	Brzobohatý, Tomáš Dostál, Zdeněk Kozubek, Tomáš Markopoulos, Alexandros Vondrák, Vít
http://linked.open...ain/vavai/riv/wos	000277903200002
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	0029-5981
number of pages	22 (xsd:int)
http://localhost/t...ganizacniJednotka	27230
is http://linked.open...avai/riv/vysledek of	Scalable TFETI algorithm for the solution of multibody 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