Application of the partial Dirichlet–Neumann contact algorithm to simulate low-velocity impact events on composite structures
Impact simulations for damage resistance analysis are computationally intensive due to contact algorithms and advanced damage models. Both methods, which are the main ingredients in an impact event, require refined meshes at the contact zone to obtain accurate predictions of the contact force and da...
| Autores: | , , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/381114 |
| Acesso em linha: | https://hdl.handle.net/2117/381114 https://dx.doi.org/10.1016/j.compositesa.2022.107424 |
| Access Level: | acceso abierto |
| Palavra-chave: | High performance computing Airplanes Contact mechanics Damage modeling Finite element analysis High-performance computing Simulació per ordinador Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica::Aplicacions informàtiques a la física i l‘enginyeria |
| Resumo: | Impact simulations for damage resistance analysis are computationally intensive due to contact algorithms and advanced damage models. Both methods, which are the main ingredients in an impact event, require refined meshes at the contact zone to obtain accurate predictions of the contact force and damage onset and propagation through the material. This work presents the application of the partial Dirichlet–Neumann contact algorithm to simulate low-velocity impact problems on composite structures using High-Performance Computing. This algorithm is devised for parallel finite element codes running on supercomputers, and it is extended to explicit time integration schemes to solve impact problems including damage. The proposed framework is validated with a standard test for damage resistance on fiber-reinforced polymer matrix composites. Moreover, the parallel performance of the proposed algorithm has been evaluated in a mesh of 74M of elements running with 2400 processors |
|---|