About: TBETI and TFETI algorithms for contact shape optimization problems

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

About: TBETI and TFETI algorithms for contact shape optimization problems 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
rdfs:seeAlso	http://www.ctresources.info/ccp/paper.html?id=6251
Description	The paper shows how to accelerate solution of contact shape optimization problems on massively parallel computers. We proposed two efficient algorithms for solution such problems. The first one is called Finite Element Tearing and Interconnecting (FETI) domain decomposition method, which is based on finite element approximation of the state problem. The second one is based on the boundary element approximation and we call it Boundary Element Tearing and Interconnecting (BETI) method. In this paper we shall apply those methods to the efficient parallel solution of sensitivity analysis which shows to be the most expensive part of the shape optimization process. The performance comparison of proposed methods will be demonstrated on the Hertz type problem. The paper shows how to accelerate solution of contact shape optimization problems on massively parallel computers. We proposed two efficient algorithms for solution such problems. The first one is called Finite Element Tearing and Interconnecting (FETI) domain decomposition method, which is based on finite element approximation of the state problem. The second one is based on the boundary element approximation and we call it Boundary Element Tearing and Interconnecting (BETI) method. In this paper we shall apply those methods to the efficient parallel solution of sensitivity analysis which shows to be the most expensive part of the shape optimization process. The performance comparison of proposed methods will be demonstrated on the Hertz type problem. (en)
Title	TBETI and TFETI algorithms for contact shape optimization problems TBETI and TFETI algorithms for contact shape optimization problems (en)
skos:prefLabel	TBETI and TFETI algorithms for contact shape optimization problems TBETI and TFETI algorithms for contact shape optimization problems (en)
skos:notation	RIV/61989100:27740/11:86089257!RIV14-MSM-27740___
http://linked.open...avai/predkladatel	IT4Innovations
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
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 / IT4Innovations
http://linked.open...dnocenehoVysledku	234263
http://linked.open...ai/riv/idVysledku	RIV/61989100:27740/11:86089257
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Parallel programming; Finite element method; Domain decomposition; Contact problem; Boundary element method (en)
http://linked.open.../riv/klicoveSlovo	Contact problem Finite element method Boundary element method Parallel programming Domain decomposition
http://linked.open...ontrolniKodProRIV	[18EF5BD02764]
http://linked.open...v/mistoKonaniAkce	Ajaccio
http://linked.open...i/riv/mistoVydani	Kippen, Stirlingshire
http://linked.open...i/riv/nazevZdroje	Civil-Comp Proceedings. Volume 95
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Kozubek, Tomáš Vondrák, Vít Sadowská, Marie
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-04-12 (xsd:date)
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.4203/ccp.95.3
http://purl.org/ne...btex#hasPublisher	Civil-Comp Press
https://schema.org/isbn	978-1-905088-42-3
http://localhost/t...ganizacniJednotka	27740

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