This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/ontology/domain/vavai/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
n7http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61388998%3A_____%2F09%3A00333602%21RIV10-AV0-61388998/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61388998%3A_____%2F09%3A00333602%21RIV10-AV0-61388998
rdf:type
n16:Vysledek skos:Concept
dcterms: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. 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.
dcterms:title
Review of methods for local contact search Review of methods for local contact search
skos:prefLabel
Review of methods for local contact search Review of methods for local contact search
skos:notation
RIV/61388998:_____/09:00333602!RIV10-AV0-61388998
n3:aktivita
n5:P n5:Z
n3:aktivity
P(GA101/07/1471), P(GA101/09/1630), Z(AV0Z20760514)
n3:dodaniDat
n9:2010
n3:domaciTvurceVysledku
n8:8741883 n8:4510747 n8:8034451
n3:druhVysledku
n11:O
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n7:predkladatel
n3:idSjednocenehoVysledku
339273
n3:idVysledku
RIV/61388998:_____/09:00333602
n3:jazykVysledku
n14:eng
n3:klicovaSlova
contact algorithm; normal vector; optimization methods
n3:klicoveSlovo
n4:optimization%20methods n4:normal%20vector n4:contact%20algorithm
n3:kontrolniKodProRIV
[F83626999E6F]
n3:obor
n12:JC
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n17:GA101%2F09%2F1630 n17:GA101%2F07%2F1471
n3:rokUplatneniVysledku
n9:2009
n3:tvurceVysledku
Kopačka, Ján Gabriel, Dušan Plešek, Jiří
n3:zamer
n6:AV0Z20760514