About: On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians

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

About: On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians Goto Sponge Distinct 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	Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. 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 optionally modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by a new variant of the augmented Lagrangian type algorithm with the inner loop for the solution of bound constrained quadratic programming problems. Recent theoretical results are reported that guarantee scalability of the algorithm. The results are confirmed by numerical experiments. Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. 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 optionally modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by a new variant of the augmented Lagrangian type algorithm with the inner loop for the solution of bound constrained quadratic programming problems. Recent theoretical results are reported that guarantee scalability of the algorithm. The results are confirmed by numerical experiments. (en) Theoretical and experimental results concerning a new FETI based algorithm for numerical solution of variational inequalities are reviewed. 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 optionally modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by a new variant of the augmented Lagrangian type algorithm with the inner loop for the solution of bound constrained quadratic programming problems. Recent theoretical results are reported that guarantee scalability of the algorithm. The results are confirmed by numerical experiments. (cs)
Title	On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians (en) On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians (cs)
skos:prefLabel	On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians (en) On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians (cs)
skos:notation	RIV/61989100:27240/04:00010925!RIV/2005/GA0/272405/N
http://linked.open.../vavai/riv/strany	487-494
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA101/04/1145)
http://linked.open...vai/riv/dodaniDat	2005
http://linked.open...aciTvurceVysledku	Dostál, Zdeněk Horák, David
http://linked.open.../riv/druhVysledku	C - Kapitola v knize
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	577807
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/04:00010925
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Domain decomposition;variational inequality;scalability (en)
http://linked.open.../riv/klicoveSlovo	variational inequality scalability Domain decomposition
http://linked.open...ontrolniKodProRIV	[A8CE8657D6E7]
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...vEdiceCisloSvazku	Neuveden
http://linked.open...i/riv/nazevZdroje	Domain Decomposition Methods in Science and Engineering
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	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	2004
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Horák, David
issn	1439-7358
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag. (Berlin; Heidelberg)
http://localhost/t...ganizacniJednotka	27240

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