Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1990-1994  (2)
Material
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 10 (1994), S. 249-255 
    ISSN: 1069-8299
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An algorithm for evaluation of friction in general contact-impact interfaces is described. The algorithm is based on an explicit finite-element method. Coulomb's friction law is assumed. The defence node algorithm is used such that the sticking condition can be imposed with the Lagrange multiplier method even in explicit dynamic analysis. The algorithm is supposed to be applicable in general situations, including large deformations of the contact-impact bodies and large relative sliding between the contact-impact boundaries. Numerical results are presented to demonstrate the performance of the algorithm.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 37 (1994), S. 359-386 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new global search method for general contact systems is developed and implemented in the DYNA3D program, along with a recent contact interface algorithm. The concept of ‘position codes’ for efficient global contact searching is presented. With the position code algorithm, the problem of sorting and searching in three dimensions is transformed to a process of sorting and searching within a one-dimensional array. The cost of contact searching is of the order of N log2 N, where N is the number of nodes in the system. The proposed algorithms are uncomplicated and the implementation into any finite element code is straightforward. Numerical experiments are presented in order to examine the behaviour of the algorithms in different aspects.
    Additional Material: 27 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...