Two Algorithms for the Contact Problem in Elastostatics

摘要

A fundamental algorithm is given on which are based two algorithms for the discretized elastostatic contact problem: one for the normal, frictionless contact problem, and one for the tangential, frictional contact problem. The validity of the fundamental algorithm and of the two contact versions are proved rigorously. For the fundamental algorithm and the normal contact problem it is proved that the algorithm terminates after a finite number of steps. For the frictional algorithm, also, very good convergence properties can be proved. The paper ends with a discussion of applications.