About: Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method     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
rdfs:seeAlso
Description
  • One of new methods which can successfully be applied to solution to contact problems is the FETI method which is based on decomposition of a spatial domain into a set of totally disconnected non-overlapping subdomains with Lagrange multipliers enforcing compatibility at the interfaces. It has turned out to be one of the most successful algorithms for parallel solution of problems described by elliptic partial differential equations. The idea that every individual subdomain interacts with its neighbours in terms of the Lagrangian multipliers can naturally be applied to contact problems. In addition in static cases, this approach renders possible the solution to the semicoercive problems, i.e. the structures with some floating subdomains. The algorithms stemming from the FETI method were tested in the following numerical experiments:(a) Comparison with the analytical solution to a classic Hertzian problem; (b) Comparison with the analytical solution to contact of a cylinder in a cylindric hole with para
  • One of new methods which can successfully be applied to solution to contact problems is the FETI method which is based on decomposition of a spatial domain into a set of totally disconnected non-overlapping subdomains with Lagrange multipliers enforcing compatibility at the interfaces. It has turned out to be one of the most successful algorithms for parallel solution of problems described by elliptic partial differential equations. The idea that every individual subdomain interacts with its neighbours in terms of the Lagrangian multipliers can naturally be applied to contact problems. In addition in static cases, this approach renders possible the solution to the semicoercive problems, i.e. the structures with some floating subdomains. The algorithms stemming from the FETI method were tested in the following numerical experiments:(a) Comparison with the analytical solution to a classic Hertzian problem; (b) Comparison with the analytical solution to contact of a cylinder in a cylindric hole with para (en)
  • One of new methods which can successfully be applied to solution to contact problems is the FETI method which is based on decomposition of a spatial domain into a set of totally disconnected non-overlapping subdomains with Lagrange multipliers enforcing compatibility at the interfaces. It has turned out to be one of the most successful algorithms for parallel solution of problems described by elliptic partial differential equations. The idea that every individual subdomain interacts with its neighbours in terms of the Lagrangian multipliers can naturally be applied to contact problems. In addition in static cases, this approach renders possible the solution to the semicoercive problems, i.e. the structures with some floating subdomains. The algorithms stemming from the FETI method were tested in the following numerical experiments:(a) Comparison with the analytical solution to a classic Hertzian problem; (b) Comparison with the analytical solution to contact of a cylinder in a cylindric hole with para (cs)
Title
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method (en)
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method (cs)
skos:prefLabel
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method (en)
  • Semicoercive Contact Problems with Large Displacements by FETI Domain Decomposion Method (cs)
skos:notation
  • RIV/61989100:27240/04:00010929!RIV/2005/GA0/272405/N
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA101/02/0072)
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
  • 585827
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/04:00010929
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Contact problems;large displacements;domain decomposition (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...i/riv/kodPristupu
http://linked.open...ontrolniKodProRIV
  • [6370041A9F44]
http://linked.open...i/riv/mistoVydani
  • Jyvaskyla
http://linked.open...telVyzkumneZpravy
  • University of Jyvaskyla
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
  • Vondrák, Vít
  • Dobiáš, J.
  • Pták, S.
http://linked.open...rzeVyzkumneZpravy
  • 5
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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software