Review of methods for local contact search
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61388998%3A_____%2F09%3A00333602" target="_blank" >RIV/61388998:_____/09:00333602 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Review of methods for local contact search
Original language 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 distanceproblem 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, leastsquare projection, method of steepest descent, Broyden's method, BFGS method, DFP method and simplex method) and efficiency was compared.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů