Abstract

Abstract Geometric variation is an inevitable element of any fabrication process. To secure the geometric quality of the assembled products, variation simulation is performed to control compliance with the set geometric requirements. In non-rigid variation simulation, contact modeling is used to avoid the virtual penetration of the components in the adjacent areas, enhancing the simulation accuracy. For frictionless contact models, numerical errors and convergence issues due to the deformation behavior of the interacting surfaces are still limiting the computational efficiency of solving this optimization problem. The optimization problem associated with a contact model is often large-scale, and in practice, fast and robust methods for achieving convergence are required. Previous implementations of contact modeling for non-rigid variation simulation have been prominently based on the Iterative or Penalty Methods. In this paper, a quadratic programming approach has been introduced, based on the Lagrangian multiplier method, for robust contact modeling in non-rigid variation simulation, and the performance of the proposed approach has been compared to the previously applied Iterative and Interior Point Method. The methods have been compared on three industrial reference cases, and the convergence and time-efficiency of each method are compared. The results show that robust optimization of the quadratic program associated with the contact model is highly dependent on the reduced stiffness matrix condition. Furthermore, it has been shown that robust and efficient contact modeling in non-rigid variation simulation is achievable through the proposed quadratic programming method.

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.