A constrained variational method for crack networks with criterion-based evolution

Abstract A constrained Variational Crack Element Method (VCEM) for interacting crack networks in two-dimensional isotropic elasticity is formulated. The method is variational at the level of crack equilibrium for fixed geometry, while crack advance is treated separately using near-tip propagation criteria. Cracks are represented by distributed Burgers-density fields, preserving the exact crack-tip singular structure within a unified energy-minimization framework. The governing equations follow from a constrained variational problem in which equality constraints enforce Burgers-vector closure and displacement single-valuedness at junctions, while inequality constraints enforce crack-face non-penetration. The resulting system has a Karush–Kuhn–Tucker (KKT) saddle-point structure. Crack geometry is represented by graph-based polylines composed of polarity-carrying half-crack elements, allowing the treatment of tips, kinks, branching, and multi-degree junctions. Elastostatic interactions are expressed through tensor kernels derived from Kelvin’s fundamental solutions, and both strong (collocation) and weak (Galerkin/least-squares) traction enforcement are implemented. The framework provides a sharp-interface, computationally scalable approach for equilibrium and criterion-based evolution of complex crack networks in finite or infinite domains.

Authors

Institutions

Publication Details

Journal
Journal of Materials Science Materials Theory
Published
2026-05-18
DOI
https://doi.org/10.1186/s41313-026-00076-6
Primary Topic
Numerical methods in engineering
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A constrained variational method for crack networks with criterion-based evolution

Nasr Ghoniem
Journal of Materials Science Materials Theory
Numerical methods in engineering
article

A constrained variational method for crack networks with criterion-based evolution

Nasr Ghoniem
article en

Abstract

Abstract A constrained Variational Crack Element Method (VCEM) for interacting crack networks in two-dimensional isotropic elasticity is formulated. The method is variational at the level of crack equilibrium for fixed geometry, while crack advance is treated separately using near-tip propagation criteria. Cracks are represented by distributed Burgers-density fields, preserving the exact crack-tip singular structure within a unified energy-minimization framework. The governing equations follow from a constrained variational problem in which equality constraints enforce Burgers-vector closure and displacement single-valuedness at junctions, while inequality constraints enforce crack-face non-penetration. The resulting system has a Karush–Kuhn–Tucker (KKT) saddle-point structure. Crack geometry is represented by graph-based polylines composed of polarity-carrying half-crack elements, allowing the treatment of tips, kinks, branching, and multi-degree junctions. Elastostatic interactions are expressed through tensor kernels derived from Kelvin’s fundamental solutions, and both strong (collocation) and weak (Galerkin/least-squares) traction enforcement are implemented. The framework provides a sharp-interface, computationally scalable approach for equilibrium and criterion-based evolution of complex crack networks in finite or infinite domains.

Journal of Materials Science Materials TheoryVol. 10(1)
University of California, Los Angeles (US)
U.S. Department of Energy, Fusion Energy Sciences
Openalex Percentile: Top 9%
Numerical methods in engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.