Elastic crack growth in finite elements with minimal remeshing. (English) Zbl 0943.74061

Summary: We present a minimal remeshing finite element method for crack growth. Discontinuous enrichment functions are added to the finite element approximation to account for the presence of crack. This method allows the crack to be arbitrarily aligned within the mesh. For severely curved cracks, remeshing may be needed but only away from the crack tip where remeshing is much easier. Results are presented for a wide range of two-dimensional crack problems, showing excellent accuracy.


74S05 Finite element methods applied to problems in solid mechanics
74R10 Brittle fracture
Full Text: DOI


[1] Melenk, Computer Methods in Applied Mechanics and Engineering 39 pp 289– (1996) · Zbl 0881.65099
[2] hp clouds?a meshless method to solve boundary-value problems. Technical Report, TICAM, 1995.
[3] Belytschko, International Journal of Numerical Methods in Engineering 37 pp 229– (1994) · Zbl 0796.73077
[4] Fleming, International Journal for Numerical Methods in Engineering 40 pp 1483– (1997)
[5] Belytschko, Computer Methods in Applied Mechanics and Engineering 139 pp 3– (1996) · Zbl 0891.73075
[6] Swenson, Computational Mechanics 3 pp 381– (1988) · Zbl 0663.73074
[7] Oliver, Computational Mechanics 17 pp 49– (1995)
[8] Fracture Mechanics; Edward Arnold: New York, 1989.
[9] Yau, Journal of Applied Mechanics 47 pp 335– (1980) · Zbl 0463.73103
[10] Moran, Engineering Fracture Mechanics 127 (1987)
[11] Fracture Mechanics; Kluwer Academics Publishers: Boston, 1993. · Zbl 0834.73056
[12] Mesh-free applications to fracture mechanics and an analysis of the corrected derivative method. Ph.D. Thesis, Northwestern University, 1998.
[13] Nuismer, International Journal of Fracture 11 pp 245– (1975)
[14] Erdogan, Journal of Basic Engineering 85 pp 519– (1963)
[15] Sih, International Journal of Fracture 10 pp 305– (1974)
[16] Shih, Journal of Applied Mechanics 55 pp 299– (1988)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.