About: Hybrid Total FETI 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
  • We describe a hybrid FETI (Finite Element Tearing and Interconnecting) method based on our variant of the FETI type domain decomposition method called Total FETI. In our approach a small number of neighboring subdomains is aggregated into the clusters, which results into the smaller coarse problem. To solve the original problem Total FETI method is applied twice: to the clusters and then to the subdomains in each cluster. This approach simplifies implementation of hybrid FETI methods and enables to extend parallelization of the original problem up to tens of thousands of cores due to the coarse space reduction and thus less memory requirements. The performance is demonstrated on a linear elasticity benchmark.
  • We describe a hybrid FETI (Finite Element Tearing and Interconnecting) method based on our variant of the FETI type domain decomposition method called Total FETI. In our approach a small number of neighboring subdomains is aggregated into the clusters, which results into the smaller coarse problem. To solve the original problem Total FETI method is applied twice: to the clusters and then to the subdomains in each cluster. This approach simplifies implementation of hybrid FETI methods and enables to extend parallelization of the original problem up to tens of thousands of cores due to the coarse space reduction and thus less memory requirements. The performance is demonstrated on a linear elasticity benchmark. (en)
Title
  • Hybrid Total FETI method
  • Hybrid Total FETI method (en)
skos:prefLabel
  • Hybrid Total FETI method
  • Hybrid Total FETI method (en)
skos:notation
  • RIV/61989100:27740/12:86084418!RIV13-MSM-27740___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED1.1.00/02.0070), S
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
  • 139961
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/12:86084418
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Total FETI; Scalable algorithm; Hybrid FETI; Domain decomposition (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [702B2FEBA56F]
http://linked.open...v/mistoKonaniAkce
  • Vídeň
http://linked.open...i/riv/mistoVydani
  • Vienna
http://linked.open...i/riv/nazevZdroje
  • ECCOMAS 2012 - European Congress on Computational Methods in Applied Sciences and Engineering, e-Book Full Papers
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
  • Kozubek, Tomáš
  • Markopoulos, Alexandros
  • Menšík, Martin
  • Jarošová, Marta
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vienna University of Technology
https://schema.org/isbn
  • 978-3-9503537-0-9
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, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software