Assessing Nonlinear Elimination Preconditioning for Trust-Region Phase-Field Fracture
Abstract
Each quasi-static load step of phase-field fracture is a bound-constrained minimization of a nonconvex, coupled displacement-damage energy under an irreversibility bound on the damage. Monolithic Newton stalls once the nonlinearity localizes at the advancing crack front, and staggered (alternate-minimization) schemes converge slowly there. We present an on-demand nonlinear-elimination preconditioned trust-region Newton method: an energy Steihaug-Toint trust region, a primal-dual active set for irreversibility, and a bound-constrained field-split sweep that eliminates an algebraically-identified "hard set" spanning both fields before each step. The elimination is applied on demand -- triggered by the coupled Newton's own stalling and otherwise skipped -- so the method reduces to monolithic Newton at no surcharge where the step is already healthy. We find the robustness to come from the energy trust region: with that globalization fixed, monolithic Newton already completes every loading history without cutbacks, where residual-merit Newton death-spirals, alternate minimization stalls, and the full-field sweep loses robustness. Against that well-globalized baseline, the on-demand elimination cuts outer nonlinear iterations by 19-25% (brittle) and 17% (ductile), with always-on elimination reaching 26-28% and about 39% at the ductile nucleation step. Measured machine-independently, as a full-mesh-equivalent assembly-work proxy rather than wall-clock, it is competitive with -- not faster than -- monolithic Newton (within about 10%), whereas an always-on sweep adds up to 30%. Nonlinear elimination is thus an iteration-reduction mechanism whose overhead the on-demand gate bounds, with no demonstrated total-work advantage over well-globalized monolithic Newton.
Related
- SAFEGUARDED NEURALLY-ACCELERATED PRECONDITIONING (SNAP) FRAMEWORK FOR NONLINEAR OPTIMIZATION
- Acceleration of Newton's method for nonlinear algebraic systems by preflattening and elimination techniques
- Assessing the Role of Green Premium and Localized Price Spillovers in Budget Hotels : Evidence from Delhi National Capital Region (NCR)
- Comparative Performance Analysis of Optimization Solvers for Linear Support Vector Machines: Impact of Preconditioning and Dimensionality An Empirical Study Using the Benchopt Framework
- A parameterized block LU preconditioning for double saddle point problems
BibTeX
@misc{hu2026assessing,
title = {{Assessing Nonlinear Elimination Preconditioning for Trust-Region Phase-Field Fracture}},
author = {Tianchen Hu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05458},
eprint = {2609.05458},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05458},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Assessing Nonlinear Elimination Preconditioning for Trust-Region Phase-Field Fracture
AU - Tianchen Hu
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.05458
UR - https://arxiv.org/abs/2609.05458
AB - Each quasi-static load step of phase-field fracture is a bound-constrained minimization of a nonconvex, coupled displacement-damage energy under an irreversibility bound on the damage. Monolithic Newton stalls once the nonlinearity localizes at the advancing crack front, and staggered (alternate-minimization) schemes converge slowly there. We present an on-demand nonlinear-elimination preconditioned trust-region Newton method: an energy Steihaug-Toint trust region, a primal-dual active set for irreversibility, and a bound-constrained field-split sweep that eliminates an algebraically-identified "hard set" spanning both fields before each step. The elimination is applied on demand -- triggered by the coupled Newton's own stalling and otherwise skipped -- so the method reduces to monolithic Newton at no surcharge where the step is already healthy. We find the robustness to come from the energy trust region: with that globalization fixed, monolithic Newton already completes every loading history without cutbacks, where residual-merit Newton death-spirals, alternate minimization stalls, and the full-field sweep loses robustness. Against that well-globalized baseline, the on-demand elimination cuts outer nonlinear iterations by 19-25% (brittle) and 17% (ductile), with always-on elimination reaching 26-28% and about 39% at the ductile nucleation step. Measured machine-independently, as a full-mesh-equivalent assembly-work proxy rather than wall-clock, it is competitive with -- not faster than -- monolithic Newton (within about 10%), whereas an always-on sweep adds up to 30%. Nonlinear elimination is thus an iteration-reduction mechanism whose overhead the on-demand gate bounds, with no demonstrated total-work advantage over well-globalized monolithic Newton.
ER -