About: Non-linear 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
rdfs:seeAlso
Description
  • The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, and contact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', 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 briefly reviewed and a new version of solution algorithm is presented. 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 a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and parallel scalabilities.
  • The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, and contact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', 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 briefly reviewed and a new version of solution algorithm is presented. 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 a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and parallel scalabilities. (en)
Title
  • Non-linear scalable TFETI domain decomposition based contact algorithm
  • Non-linear scalable TFETI domain decomposition based contact algorithm (en)
skos:prefLabel
  • Non-linear scalable TFETI domain decomposition based contact algorithm
  • Non-linear scalable TFETI domain decomposition based contact algorithm (en)
skos:notation
  • RIV/61989100:27740/10:86091987!RIV15-MSM-27740___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6198910027)
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
  • 275050
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/10:86091987
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Solution algorithms; Prescribed displacements; Parallel scalability; Numerical experiments; Natural coarse grids; Finite element tearing and interconnecting; Equality constraints; Contact algorithms (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [194F1A7183F0]
http://linked.open...v/mistoKonaniAkce
  • Sydney
http://linked.open...i/riv/mistoVydani
  • Bristol
http://linked.open...i/riv/nazevZdroje
  • IOP Conference Series: Materials Science and Engineering. Volume 10
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dobiáš, Jiří
  • Dostál, Zdeněk
  • Kozubek, Tomáš
  • Vondrák, Vít
  • Pták, Stanislav
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000290445000162
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 1757-8981
number of pages
http://bibframe.org/vocab/doi
  • 10.1088/1757-899X/10/1/012161
http://purl.org/ne...btex#hasPublisher
  • IOP Publishing
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software