Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs
An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the 3D fracture algorithm by Pandolfi and Ortiz [22]. It is shown that the graph representation initializes in O(N{sub E}{sup 1.1}) time and fractures in O(N{sub I}{sup 1.0}) time, while the reference implementation requires O(N{sub E}{sup 2.1}) time to initialize and O(N{sub I}{sup 1.9}) time to fracture, where NE is the number of elements in the mesh and N{sub I} is the number of interfaces to fracture.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 928162
- Report Number(s):
- UCRL-JRNL-225523; IJNMBH; TRN: US200815%%758
- Journal Information:
- International Journal for Numerical Methods in Engineering, Vol. 73; ISSN 0029-5981
- Country of Publication:
- United States
- Language:
- English
Similar Records
Deploy production sliding mesh capability with linear solver benchmarking (ECP Milestone Report, Ver. 1.0)
Deploy production sliding mesh capability with linear solver benchmarking.