IUTAM Symposium on Computational Methods in Contact Mechanics

There is still room for research in computational contact mechanics, hence engineering analysis includes unilateral constraints when a detailed modelling of a problem is needed. Contact modelling within real structures includes e.g. rolling wheels, metal forming processes and car crash analysis, and is outcome of the increasing power of modern computers. Also, multi-physics modelling of thermo-mechanical or electro-mechanical contact and microscopic modelling are used in order to get a deeper insight into the mechanism of friction and wear. Moreover, new numerical simulation techniques were developed within the finite element or boundary element method yielding better discretization tools and more efficient algorithms for contact. However, up to now there exists no approach which solves all problems of the above mentioned areas in a robust and reliable way, hence investigations and developments are still needed. The aim of the symposium was to bring scientists together who work on the frontier of research in computational contact mechanics described above, or in closely related subjects. During the symposium 37 scientists presented their newest findings in the area of discretization techniques for contact, algorithms and interesting numerical simulations of contact problems. The symposium gave detailed insight in the newest development in the area of simulation techniques for contact problems. Topics treated included new mathematical techniques like multi-level approaches, new discretization techniques like the mortar-method, advanced applications of unilateral contact to masonry structures, decohesion analysis and tractive rolling of tires. The current volume provides a good overview of modern techniques and state-of-the-art discretizations schemes applied in contact mechanics, and will stimulate future collaboration in science related to computational contact mechanics and in the organization of minisymposia and workshops in the area contact mechanics.