About: Scalable FETI with Optimal Dual Penalty for a Variational Inequality

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

About: Scalable FETI with Optimal Dual Penalty for a Variational Inequality 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	The FETI method with the natural coarse grid is combined with the penalty method to develop an efficient solver for elliptic variational inequalities. A proof is given that a prescribed bound on the norm of feasibility of solution may be achieved with a value of the penalty parameter that does not depend on the discretization parameter and that an approximate solution with the prescribed bound on violation of the Karush-Kuhn-Tucker conditions may be found in a number of steps that does not depend on the discretization parameter. Results of numerical experiments with parallel solution of a model problem discretized by up to more than eight million of nodal variables are in agreement with the theory and demonstrate numerically both optimality of the penalty and scalability of the algorithm presented. The FETI method with the natural coarse grid is combined with the penalty method to develop an efficient solver for elliptic variational inequalities. A proof is given that a prescribed bound on the norm of feasibility of solution may be achieved with a value of the penalty parameter that does not depend on the discretization parameter and that an approximate solution with the prescribed bound on violation of the Karush-Kuhn-Tucker conditions may be found in a number of steps that does not depend on the discretization parameter. Results of numerical experiments with parallel solution of a model problem discretized by up to more than eight million of nodal variables are in agreement with the theory and demonstrate numerically both optimality of the penalty and scalability of the algorithm presented. (en) The FETI method with the natural coarse grid is combined with the penalty method to develop an efficient solver for elliptic variational inequalities. A proof is given that a prescribed bound on the norm of feasibility of solution may be achieved with a value of the penalty parameter that does not depend on the discretization parameter and that an approximate solution with the prescribed bound on violation of the Karush-Kuhn-Tucker conditions may be found in a number of steps that does not depend on the discretization parameter. Results of numerical experiments with parallel solution of a model problem discretized by up to more than eight million of nodal variables are in agreement with the theory and demonstrate numerically both optimality of the penalty and scalability of the algorithm presented. (cs)
Title	Scalable FETI with Optimal Dual Penalty for a Variational Inequality Scalable FETI with Optimal Dual Penalty for a Variational Inequality (en) Scalable FETI with Optimal Dual Penalty for a Variational Inequality (cs)
skos:prefLabel	Scalable FETI with Optimal Dual Penalty for a Variational Inequality Scalable FETI with Optimal Dual Penalty for a Variational Inequality (en) Scalable FETI with Optimal Dual Penalty for a Variational Inequality (cs)
skos:notation	RIV/61989100:27240/04:00010922!RIV/2005/GA0/272405/N
http://linked.open.../vavai/riv/strany	455-472
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA101/04/1145)
http://linked.open...iv/cisloPeriodika	5
http://linked.open...vai/riv/dodaniDat	2005
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	585505
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/04:00010922
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	scalability;variational inequality;penalty (en)
http://linked.open.../riv/klicoveSlovo	variational inequality scalability penalty
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[6C840BD21883]
http://linked.open...i/riv/nazevZdroje	Numerical Linear Algebra with Applications
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...v/svazekPeriodika	11
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Horák, David
issn	1070-5325
number of pages	18 (xsd:int)
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software