About: Review of methods for local contact search     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
  • The local contact search is a numerical procedure of a contact algorithm which is used for computing of a penetration vector between so-called master and slave segments of contact surfaces. There are several approaches. In this paper the minimum distance problem between the master segment and the integration point of the slave segment is used. For quadrilateral elements this approach leads to the system of two nonlinear equations. For its solution several methods was tested (Newton-Raphson method, least square projection, method of steepest descent, Broyden's method, BFGS method, DFP method and simplex method) and efficiency was compared. (en)
  • The local contact search is a numerical procedure of a contact algorithm which is used for computing of a penetration vector between so-called master and slave segments of contact surfaces. There are several approaches. In this paper the minimum distance problem between the master segment and the integration point of the slave segment is used. For quadrilateral elements this approach leads to the system of two nonlinear equations. For its solution several methods was tested (Newton-Raphson method, least square projection, method of steepest descent, Broyden's method, BFGS method, DFP method and simplex method) and efficiency was compared.
Title
  • Review of methods for local contact search (en)
  • Review of methods for local contact search
skos:prefLabel
  • Review of methods for local contact search (en)
  • Review of methods for local contact search
skos:notation
  • RIV/61388998:_____/09:00333602!RIV10-AV0-61388998
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA101/07/1471), P(GA101/09/1630), Z(AV0Z20760514)
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
  • 339273
http://linked.open...ai/riv/idVysledku
  • RIV/61388998:_____/09:00333602
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • contact algorithm; normal vector; optimization methods (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [F83626999E6F]
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
  • Plešek, Jiří
  • Gabriel, Dušan
  • Kopačka, Ján
http://linked.open...n/vavai/riv/zamer
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