About: A non-linear dynamic parallel domain decomposition based algorithm

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

About: A non-linear dynamic parallel domain decomposition based algorithm 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	This paper is concerned with application of a new variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to the solution to non-linear dynamic problems. Geometric, material, and contact non-linearities are considered. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains exhibit rigid body modes, the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid is more effective. The basic theory and relationships of both FETI and TFETI are reviewed. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective in some sense optimal algorithms can be applied. Numerical experiments show that optimal convergence properties of the time independent TFETI are preserved in the time dependent case. It is also demonstrated that our algorithms exhibit the parallel scalability. This paper is concerned with application of a new variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to the solution to non-linear dynamic problems. Geometric, material, and contact non-linearities are considered. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains exhibit rigid body modes, the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid is more effective. The basic theory and relationships of both FETI and TFETI are reviewed. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective in some sense optimal algorithms can be applied. Numerical experiments show that optimal convergence properties of the time independent TFETI are preserved in the time dependent case. It is also demonstrated that our algorithms exhibit the parallel scalability. (en)
Title	A non-linear dynamic parallel domain decomposition based algorithm A non-linear dynamic parallel domain decomposition based algorithm (en)
skos:prefLabel	A non-linear dynamic parallel domain decomposition based algorithm A non-linear dynamic parallel domain decomposition based algorithm (en)
skos:notation	RIV/61989100:27240/09:86085142!RIV13-GA0-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA101/08/0574)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Dostál, Zdeněk Kozubek, Tomáš Vondrák, Vít
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 / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	301435
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/09:86085142
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Parallel processing; Material non-linearity; Geometric non-linearity; Finite element method; Dynamics; Domain decomposition; Contact non-linearity (en)
http://linked.open.../riv/klicoveSlovo	Geometric non-linearity Material non-linearity Dynamics Finite element method Contact non-linearity Domain decomposition Parallel processing
http://linked.open...ontrolniKodProRIV	[FEDDE1BEDED3]
http://linked.open...v/mistoKonaniAkce	Funchal
http://linked.open...i/riv/mistoVydani	Kippen, Stirlingshire
http://linked.open...i/riv/nazevZdroje	Proceedings of the 12th International Conference on Civil, Structural and Environmental Engineering Computing
http://linked.open...in/vavai/riv/obor	JR
http://linked.open...ichTvurcuVysledku	3 (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	2009
http://linked.open...iv/tvurceVysledku	Dobiáš, Jiří Dostál, Zdeněk Kozubek, Tomáš Vondrák, Vít Pták, Svatopluk
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-09-01 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.4203/ccp.91.117
http://purl.org/ne...btex#hasPublisher	Civil-Comp Press
https://schema.org/isbn	978-1-905088-30-0
http://localhost/t...ganizacniJednotka	27240

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