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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Heinzmann, Jonas, Vicentini, Francesco, Carrara, Pietro, De Lorenzis, Laura
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908679993819136
author Heinzmann, Jonas
Vicentini, Francesco
Carrara, Pietro
De Lorenzis, Laura
author_facet Heinzmann, Jonas
Vicentini, Francesco
Carrara, Pietro
De Lorenzis, Laura
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2511_23064
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Iterative convergence in phase-field brittle fracture computations: exact line search is all you need
Heinzmann, Jonas
Vicentini, Francesco
Carrara, Pietro
De Lorenzis, Laura
Computational Engineering, Finance, and Science
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.
title Iterative convergence in phase-field brittle fracture computations: exact line search is all you need
topic Computational Engineering, Finance, and Science
url https://arxiv.org/abs/2511.23064