About: Effective algorithms for implementation of FETI-based domain decomposition methods

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

About: Effective algorithms for implementation of FETI-based domain decomposition methods 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
Description	Finite Element Tearing and Interconecting (FETI) methods are powerful tool for solving various problems from practice, e.g. solid mechanics, shape optimization, contact problems, fluid dynamics etc. For parallel implementation of FETI methods, we need some general tool to decompose the given problem into prescribed number of sub-domains. For successful solving of the resulting problem it is essential that all sub-domains are simply connected and the decomposition is of high-quality. In case of floating structure, domain decomposition is also used for detection of 'fixing nodes' that stabilize the evaluating of the action of a generalized inverse. Thus, traditional solvers based on Cholesky decomposition can be adapted to solve the symmetric positive semi-definite system of linear equations by recognition of zero rows or columns and also by setting up a well conditioned regular sub-matrix of the problem. The best position of 'fixing nodes' is such that the structure is as stiff as possible. Finding the set of 'fixing nodes' can be solved by graph approach. Civil-Comp Press, 2009. Finite Element Tearing and Interconecting (FETI) methods are powerful tool for solving various problems from practice, e.g. solid mechanics, shape optimization, contact problems, fluid dynamics etc. For parallel implementation of FETI methods, we need some general tool to decompose the given problem into prescribed number of sub-domains. For successful solving of the resulting problem it is essential that all sub-domains are simply connected and the decomposition is of high-quality. In case of floating structure, domain decomposition is also used for detection of 'fixing nodes' that stabilize the evaluating of the action of a generalized inverse. Thus, traditional solvers based on Cholesky decomposition can be adapted to solve the symmetric positive semi-definite system of linear equations by recognition of zero rows or columns and also by setting up a well conditioned regular sub-matrix of the problem. The best position of 'fixing nodes' is such that the structure is as stiff as possible. Finding the set of 'fixing nodes' can be solved by graph approach. Civil-Comp Press, 2009. (en)
Title	Effective algorithms for implementation of FETI-based domain decomposition methods Effective algorithms for implementation of FETI-based domain decomposition methods (en)
skos:prefLabel	Effective algorithms for implementation of FETI-based domain decomposition methods Effective algorithms for implementation of FETI-based domain decomposition methods (en)
skos:notation	RIV/61989100:27240/09:86084932!RIV13-GA0-27240___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA101/08/0574), Z(MSM6198910027)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Brzobohatý, Tomáš Markopoulos, Alexandros Kozubek, Tomáš Kabelíková, Pavla
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 / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	312335
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/09:86084932
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Total FETI; Semidefinite matrices; Perron vector; Generalized inverse; Fixing nodes; Cholesky decomposition (en)
http://linked.open.../riv/klicoveSlovo	Total FETI Cholesky decomposition Fixing nodes Generalized inverse Perron vector Semidefinite matrices
http://linked.open...ontrolniKodProRIV	[5E99B46F13E2]
http://linked.open...v/mistoKonaniAkce	Funchal
http://linked.open...i/riv/mistoVydani	Kippen, Stirlingshire
http://linked.open...i/riv/nazevZdroje	Proceedings of the 12th International Conference on Civil, Structural and Environmental Engineering Computing
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Solution to very complex contact problems with other non-linearities by modern mathematical methods
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Brzobohatý, Tomáš Kozubek, Tomáš Markopoulos, Alexandros Kabelíková, Pavla
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-09-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
number of pages	11 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Civil-Comp Press
https://schema.org/isbn	978-1-905088-30-0
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	Effective algorithms for implementation of FETI-based domain decomposition methods

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