About: Theoretically supported scalable FETI for numerical solution of variational inequalities

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

About: Theoretically supported scalable FETI for numerical solution of variational inequalities 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	V práci je popsán algoritmus pro řešení variačních nerovnic metodou rozložení oblasti typu FETI a je dokázána jeho numerická škálovatelnost. (cs) The FETI method with a natural coarse grid is combined with recently proposed optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems in order to develop a scalable solver for elliptic boundary variational inequalities such as those describing equilibrium of a system of bodies in mutual contact. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then modified by means of orthogonal projectors to the natural coarse grid introduced by Farhat, Mandel and Roux. Finally the classical results on linear scalability for linear problems are extended to boundary variational inequalities. The results are validated by numerical experiments. The experiments also confirm that the algorithm enjoys the same parallel scalability as its linear counterpart. The FETI method with a natural coarse grid is combined with recently proposed optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems in order to develop a scalable solver for elliptic boundary variational inequalities such as those describing equilibrium of a system of bodies in mutual contact. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then modified by means of orthogonal projectors to the natural coarse grid introduced by Farhat, Mandel and Roux. Finally the classical results on linear scalability for linear problems are extended to boundary variational inequalities. The results are validated by numerical experiments. The experiments also confirm that the algorithm enjoys the same parallel scalability as its linear counterpart. (en)
Title	Theoretically supported scalable FETI for numerical solution of variational inequalities Teoreticky odůvodněný škálovatelný FETI algoritmus pro numerické řešení variačních nerovnic (cs) Theoretically supported scalable FETI for numerical solution of variational inequalities (en)
skos:prefLabel	Theoretically supported scalable FETI for numerical solution of variational inequalities Teoreticky odůvodněný škálovatelný FETI algoritmus pro numerické řešení variačních nerovnic (cs) Theoretically supported scalable FETI for numerical solution of variational inequalities (en)
skos:notation	RIV/61989100:27240/07:00014976!RIV08-AV0-27240___
http://linked.open.../vavai/riv/strany	500-513
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET400300415), P(GA101/04/1145), Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	45
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Dostál, Zdeněk Horák, David
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	455003
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/07:00014976
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Domain decomposition; variational inequality; scalability; parallel algorithms; FETI (en)
http://linked.open.../riv/klicoveSlovo	variational inequality parallel algorithms scalability Domain decomposition FETI
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[066A035EEA4C]
http://linked.open...i/riv/nazevZdroje	SIAM Journal on Numerical Analysis
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Modelling and simulation of complex technical problems:effective numerical algorithms and parallel implementation using new information technologie Development and implementation of scalable numerical methods for solving physically realistic models of contact problems with friction in 2D and 3D
http://linked.open...UplatneniVysledku	2007
http://linked.open...v/svazekPeriodika	2
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Horák, David
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	0036-1429
number of pages	14 (xsd:int)
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	Theoretically supported scalable FETI for numerical solution of variational inequalities Theoretically supported scalable FETI for numerical solution of variational inequalities Theoretically supported scalable FETI for numerical solution of variational inequalities

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