About: Scalable TFETI domain decomposition based contact 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)

AttributesValues
rdf:type
Description
  • This paper is concerned with a novel algorithm for a solution to contact problems stemming from the TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. The TFETI method is based on the idea that the compatibility between non-overlapping sub-domains, into which the original domain is partitioned, is enforced by the Lagrange multipliers. The distinctive feature of the TFETI consists of the fact that the method also enforces the Dirichlet boundary conditions by means of the Lagrange multipliers. The TFETI based technique converts the original contact problem to the quadratic programming one with the equalities and simple bound constraints. Moreover, it also results in more efficient preconditioning by an enriched natural coarse grid defined by a priory known kernels of the stiffness matrices. Our new algorithm exhibits both parallel and numerical scalabilities so that it enables us to effectively solve steady-state problems of deformable bodies undergoing contact, geometric and material nonlinear effects. In this paper we propose an algorithm with nested iteration strategy, where its inner part consists of a new version of our previously developed MPRGP and SMALBE algorithms and the outer loop iterates on the geometric and material non-linearities. Numerical experiments include solutions to steady-state problems with non-linear effects and their results document that the proposed algorithms are robust, highly accurate and exhibit both parallel and numerical scalabilities
  • This paper is concerned with a novel algorithm for a solution to contact problems stemming from the TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. The TFETI method is based on the idea that the compatibility between non-overlapping sub-domains, into which the original domain is partitioned, is enforced by the Lagrange multipliers. The distinctive feature of the TFETI consists of the fact that the method also enforces the Dirichlet boundary conditions by means of the Lagrange multipliers. The TFETI based technique converts the original contact problem to the quadratic programming one with the equalities and simple bound constraints. Moreover, it also results in more efficient preconditioning by an enriched natural coarse grid defined by a priory known kernels of the stiffness matrices. Our new algorithm exhibits both parallel and numerical scalabilities so that it enables us to effectively solve steady-state problems of deformable bodies undergoing contact, geometric and material nonlinear effects. In this paper we propose an algorithm with nested iteration strategy, where its inner part consists of a new version of our previously developed MPRGP and SMALBE algorithms and the outer loop iterates on the geometric and material non-linearities. Numerical experiments include solutions to steady-state problems with non-linear effects and their results document that the proposed algorithms are robust, highly accurate and exhibit both parallel and numerical scalabilities (en)
Title
  • Scalable TFETI domain decomposition based contact algorithm
  • Scalable TFETI domain decomposition based contact algorithm (en)
skos:prefLabel
  • Scalable TFETI domain decomposition based contact algorithm
  • Scalable TFETI domain decomposition based contact algorithm (en)
skos:notation
  • RIV/61989100:27740/11:86092850!RIV15-GA0-27740___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA101/08/0574), Z(AV0Z20760514)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 228195
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/11:86092850
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Scalability; Material non-linearity; Geometric non-linearity; Domain decomposition; Contact non-linearity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [2B393AC4C7F3]
http://linked.open...v/mistoKonaniAkce
  • Malta
http://linked.open...i/riv/mistoVydani
  • Southampton
http://linked.open...i/riv/nazevZdroje
  • WIT Transactions on Engineering Sciences. Volume 71
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dobiáš, Jiří
  • Dostál, Zdeněk
  • Kozubek, Tomáš
  • Markopoulos, Alexandros
  • Pták, Stanislav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 1743-3533
number of pages
http://bibframe.org/vocab/doi
  • 10.2495/SECM110061
http://purl.org/ne...btex#hasPublisher
  • WIT Press
https://schema.org/isbn
  • 978-1-84564-530-4
http://localhost/t...ganizacniJednotka
  • 27740
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software