Graph neural networks for simulating crack coalescence and propagation in brittle materials

Authors: Roberto Perera, Davide Guzzetti, Vinamra Agrawal

arXiv: 2107.05142v5 - DOI (cond-mat.mtrl-sci)

Abstract: High-fidelity fracture mechanics simulations of multiple microcracks interaction via physics-based models quickly become computationally expensive as the number of microcracks increases. This work develops a Graph Neural Network (GNN) based framework to simulate fracture and stress evolution in brittle materials due to multiple microcracks' interaction. The GNN framework is trained on the dataset generated by XFEM-based fracture simulator. Our framework achieves high prediction accuracy on the test set (compared to an XFEM-based fracture simulator) by engineering a sequence of GNN-based predictions. The first prediction stage determines Mode-I and Mode-II stress intensity factors (which can be used to compute the stress evolution by LEFM), the second prediction stage determines which microcracks will propagate, and the final stage actually propagates crack-tip positions for the selected microcracks to the next time instant. The trained GNN framework is capable of simulating crack propagation, coalescence and corresponding stress distribution for a wide range of initial microcrack configurations (from 5 to 19 microcracks) without any additional modification. Lastly, the framework's simulation time shows speed-ups 6x-25x faster compared to an XFEM-based simulator. These characteristics, make our GNN framework an attractive approach for simulating microcrack propagation and stress evolution in brittle materials with multiple initial microcracks.

Submitted to arXiv on 11 Jul. 2021

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.