Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 12, 2008 | public
Journal Article

Fracture and fragmentation of simplicial finite element meshes using graphs

Abstract

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 three-dimensional fracture algorithm by Pandolfi and Ortiz (Eng. Comput. 1998; 14(4):287–308). It is shown that the graph representation initializes in O(N^(1.1)_E) time and fractures in O(N^(1.0)_I) time, while the reference implementation requires O(N^(2.1)_E) time to initialize and O(N^(1.9)_I) time to fracture, where N_E is the number of elements in the mesh and N_I is the number of interfaces to fracture.

Additional Information

© 2007 John Wiley & Sons. Received 20 October 2006; Revised 23 May 2007; Accepted 25 May 2007. We gratefully acknowledge the support of the Department of Energy through Caltech's ASC Center for the Simulation of the Dynamic Response of Materials. This work was performed in part under the auspices of the U.S. Department of Energy by the University of California, Lawrence Livermore National Laboratory under contract no. W-7405-Eng-48.

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023