About: Numerically and parallel scalable TFETI based algorithms for contact problems

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

About: Numerically and parallel scalable TFETI based algorithms for 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
Description	In Reference [8], a total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid defined by the rigid body motions of the subdomains is adapted to the solution of multibody contact problems with friction in three dimensions and proved to be scalable for Tresca friction. The analysis admits %22floating%22 bodies. The algorithm finds an approximate solution at a cost asymptotically proportional to the number of variables provided the ratio of the decomposition and the discretization parameters is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux [11] on the scalability of the FETI algorithm for linear problems and on our development of optimal quadratic programming algorithms. The algorithm preserves the parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate that our algorithm is effective. The effectiveness of the method in the inner loop of the fixed point iterations for the solution of the contact problems with Coulomb's friction is illustrated with the analysis of a mine support. In Reference [8], a total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid defined by the rigid body motions of the subdomains is adapted to the solution of multibody contact problems with friction in three dimensions and proved to be scalable for Tresca friction. The analysis admits %22floating%22 bodies. The algorithm finds an approximate solution at a cost asymptotically proportional to the number of variables provided the ratio of the decomposition and the discretization parameters is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux [11] on the scalability of the FETI algorithm for linear problems and on our development of optimal quadratic programming algorithms. The algorithm preserves the parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate that our algorithm is effective. The effectiveness of the method in the inner loop of the fixed point iterations for the solution of the contact problems with Coulomb's friction is illustrated with the analysis of a mine support. (en)
Title	Numerically and parallel scalable TFETI based algorithms for contact problems Numerically and parallel scalable TFETI based algorithms for contact problems (en)
skos:prefLabel	Numerically and parallel scalable TFETI based algorithms for contact problems Numerically and parallel scalable TFETI based algorithms for contact problems (en)
skos:notation	RIV/61989100:27740/10:86092848!RIV15-MSM-27740___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6198910027)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Brzobohatý, Tomáš Markopoulos, Alexandros Kozubek, Tomáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	275690
http://linked.open...ai/riv/idVysledku	RIV/61989100:27740/10:86092848
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Scalability; Natural coarse grid; Multibody contact problem; Friction; Domain decomposition (en)
http://linked.open.../riv/klicoveSlovo	Multibody contact problem Domain decomposition Natural coarse grid Friction Scalability
http://linked.open...ontrolniKodProRIV	[EEC2627636B7]
http://linked.open...v/mistoKonaniAkce	Valencie
http://linked.open...i/riv/mistoVydani	Kippen, Stirlingshire
http://linked.open...i/riv/nazevZdroje	Proceedings of the 7th International Conference on Engineering Computational Technology
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Brzobohatý, Tomáš Kozubek, Tomáš Markopoulos, Alexandros
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-09-14 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
number of pages	9 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Civil-Comp Press
https://schema.org/isbn	978-1-905088-39-3
http://localhost/t...ganizacniJednotka	27740

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, 117 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software