About: Selection strategy for fixing nodes in FETI-DP method     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 deals with selection strategy of fixing nodes in the FETI-DP method. The FETI-DP method is one of non-overlapping domain decomposition methods. The method was published by Farhat and co-workers in 2001. Selection of the fixing unknowns in the FETI-DP, TFETI or BDDC domain decomposition method has strong influence on the method behavior. The selection itself is not straightforward in the case of irregular domains and subdomains. Three-step algorithm for the selection of the fixing unknowns is presented and some numerical examples are shown. The algorithm is based on nodal multiplicity, which is the number of subdomains sharing the node. If the three-step algorithm selects unsatisfactory number of fixing nodes, additional geometrical conditions are applied. These conditions lead to selection of additional fixing nodes. Moreover, higher number of the fixing nodes usually results in better convergence of the coarse problems.
  • This paper deals with selection strategy of fixing nodes in the FETI-DP method. The FETI-DP method is one of non-overlapping domain decomposition methods. The method was published by Farhat and co-workers in 2001. Selection of the fixing unknowns in the FETI-DP, TFETI or BDDC domain decomposition method has strong influence on the method behavior. The selection itself is not straightforward in the case of irregular domains and subdomains. Three-step algorithm for the selection of the fixing unknowns is presented and some numerical examples are shown. The algorithm is based on nodal multiplicity, which is the number of subdomains sharing the node. If the three-step algorithm selects unsatisfactory number of fixing nodes, additional geometrical conditions are applied. These conditions lead to selection of additional fixing nodes. Moreover, higher number of the fixing nodes usually results in better convergence of the coarse problems. (en)
Title
  • Selection strategy for fixing nodes in FETI-DP method
  • Selection strategy for fixing nodes in FETI-DP method (en)
skos:prefLabel
  • Selection strategy for fixing nodes in FETI-DP method
  • Selection strategy for fixing nodes in FETI-DP method (en)
skos:notation
  • RIV/68407700:21110/10:00169180!RIV11-GA0-21110___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD103/09/H078)
http://linked.open...iv/cisloPeriodika
  • 2
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
  • 286796
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21110/10:00169180
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • FETI-DP method; fixing nodes; domain decomposition method; finite element method (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • HU - Maďarsko
http://linked.open...ontrolniKodProRIV
  • [403C454642FC]
http://linked.open...i/riv/nazevZdroje
  • Pollack Periodica, An International Journal for Engineering and Information Sciences
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...v/svazekPeriodika
  • 5
http://linked.open...iv/tvurceVysledku
  • Kruis, Jaroslav
  • Brož, Jaroslav
issn
  • 1788-1994
number of pages
http://localhost/t...ganizacniJednotka
  • 21110
is http://linked.open...avai/riv/vysledek of
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, 19 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software