About: Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization

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

About: Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization 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	FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o (en)
Title	Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization (en)
skos:prefLabel	Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization (en)
skos:notation	RIV/61989100:27240/02:00006692!RIV/2003/GA0/272403/N
http://linked.open.../vavai/riv/strany	361-370
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA101/01/0538), Z(MSM 272400019)
http://linked.open...vai/riv/dodaniDat	2003
http://linked.open...aciTvurceVysledku	Szweda, Jan Dostál, Zdeněk 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 / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	662999
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/02:00006692
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Contact shape optimization (en)
http://linked.open.../riv/klicoveSlovo	Contact shape optimization
http://linked.open...ontrolniKodProRIV	[E4F8D5272FBF]
http://linked.open...v/mistoKonaniAkce	Lyon, France
http://linked.open...i/riv/mistoVydani	Barcelona
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	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Development and implementation of parallel algorithms for 3D contact problems with friction and contact shape optimization
http://linked.open...UplatneniVysledku	2002
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Szweda, Jan Horák, David Vondrák, Vít
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2000-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20272400019
number of pages	10 (xsd:int)
http://purl.org/ne...btex#hasPublisher	CIMNE
https://schema.org/isbn	84-95999-07-2
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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software