About: On scalable algorithms for numerical solution of variational inequalities based on FETI and semi-monotonic augmented Lagrangians     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)

AttributesValues
rdf:type
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
http://linked.open...avai/riv/aktivity
  • P(GA101/04/1145)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 577807
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/04:00010925
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Domain decomposition;variational inequality;scalability (en)
http://linked.open.../riv/klicoveSlovo
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
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dostál, Zdeněk
  • Horák, David
issn
  • 1439-7358
number of pages
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:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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