Open Access

CORRECTION

Correction: A “Parallel Universe” Scheme for Crack Nucleation in the Phase Field Method for Fracture

Yihao Chen¹, Yongxing Shen^1,*

1 University of Michigan – Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai, 200240, China
2 Second author’s affiliation, Address, City, Postcode, Country

* Corresponding Author: Yongxing Shen. Email:

The International Conference on Computational & Experimental Engineering and Sciences 2024, 30(2), 1-1. https://doi.org/10.32604/icces.2024.011251

Abstract

The phase field method for fracture has become mainstream for fracture simulation. It transforms the crack nucleation problem into a minimization problem of the sum of the elastic potential energy and the crack surface energy. Because of the biconvexity of its energy functional, there is an energy barrier between local minima with and without a crack, resulting it difficult for standard methods, such as the Newton method, to converge to a cracked solution when starting from a solid without crack, especially when the material and the geometry are uniform, even if current cracked solution with cracks has a lower energy. Here, we propose an algorithm termed the “parallel universe” scheme [1] to capture the global minimum. This algorithm has two key ingredients: (a) a necessary condition for cracking based on the current uncracked solution, and (b) beginning from when this condition is met, Newton iteration with two initial guesses, an uncracked one and a cracked one, will both be performed and the converged candidate solution with lower energy is accepted as the solution at that load step. Once the cracked candidate solution is accepted, the uncracked one is discarded, i.e., only one “universe” is retained. This cracked initial guess is obtained only once for all load steps by solving a series of similar minimization problems with a progressively reduced critical crack energy release rate. Numerical examples with isotropic and anisotropic critical crack energy release rates indicate that the proposed algorithm is more reliable (as there is no need to retrace) and more efficient than the standard Newton iteration and a well-known backtracking algorithm [2].

---

Keywords

---