Abstract

AbstractContact‐impact algorithms, which are sometimes called slideline algorithms, are a computationally time‐consuming part of many explicit simulations of non‐linear problems because they involve many branches, so they are not amenable to vectorization, which is essential for speed on supercomputers. The pinball algorithm is a simplified slideline algorithm which is readily vectorized. Its major idea is to embed pinballs in surface elements and to enforce the impenetrability condition only to pinballs. It can be implemented in either a Lagrange multiplier or penalty method. It is shown that, in any Lagrange multiplier method, no iterations are needed to define the contact surface. Examples of solutions and running times are given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.