Iterative convergence in phase-field brittle fracture computations: exact line search is all you need

TL;DR

This paper introduces an exact line search method based on bisection for phase-field brittle fracture models, ensuring global convergence of the iterative solution process and improving robustness over traditional methods.

Contribution

It proposes a novel bisection-based line search algorithm that guarantees convergence in solving non-convex energy minimization problems in fracture modeling.

Findings

The method guarantees convergence under certain conditions.

It demonstrates robustness across various benchmark tests.

It outperforms other line search algorithms in efficiency.

Abstract

Variational phase-field models of brittle fracture pose a local constrained minimization problem of a non-convex energy functional. In the discrete setting, the problem is most often solved by alternate minimization, exploiting the separate convexity of the energy with respect to the two unknowns. This approach is theoretically guaranteed to converge, provided each of the individual subproblems is solved successfully. However, strong non-linearities of the energy functional may lead to failure of iterative convergence within one or both subproblems. In this paper, we propose an exact line search algorithm based on bisection, which (under certain conditions) guarantees global convergence of Newton's method for each subproblem and consequently the successful determination of critical points of the energy through the alternate minimization scheme. Through several benchmark tests computed with various strain energy decompositions and two strategies for the enforcement of the irreversibility constraint in two and three dimensions, we demonstrate the robustness of the approach and assess its efficiency in comparison with other commonly used line search algorithms.