A mesh-free multiresolution deep energy method with phase-field modeling of brittle fracture

• URL: http://arxiv.org/abs/2608.24126v1
• Date: Tue, 25 Aug 2026 06:36:14 GMT
• Title: A mesh-free multiresolution deep energy method with phase-field modeling of brittle fracture
• Abstract summary: Phase-field modeling of brittle fracture removes the need to track cracks explicitly.<n>We propose a mesh-free discretization in which a single neural network represents the displacement and phase fields.
• Score: 3.177203247615157
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Phase-field modeling of brittle fracture removes the need to track cracks explicitly by recasting their evolution as the minimization of an energy functional. In return it requires a discretization dense enough to resolve a localization band whose width is set by a regularization length and whose path is not known in advance. We propose a mesh-free discretization in which a single neural network represents the displacement and phase fields and is trained by minimizing the incremental energy directly. The coordinates enter the network through a multiresolution feature encoding built from $C^1$ quadratic B-spline grids, so the finest scale the representation can express is set by choice rather than reached through slow training, and the energy is estimated by stratified Monte Carlo integration on points redrawn at every optimizer iteration. This pairing proves critical, since the crack fails to advance both when the integration points are held fixed and when the encoding is too coarse to represent the band, while each ingredient tolerates a wide range of settings once the other is in place. Because the representation is globally $C^1$, the second- and the fourth-order fracture energy densities run on the identical discretization. Across six problems, from single-edge-notched tension and shear to a thick-walled ring on a single spline patch, the computed load-displacement curves follow staggered finite element references at matched regularization length, with peak loads within about 1% on the single-edge-notched tests and within 8% where the crack pattern changes topology. On a public benchmark dataset of random multi-crack configurations the method classifies the active or dormant state of 90% of the seeded cracks in twenty zero-shot runs, where the deep Ritz baseline of the dataset authors fails.

Related papers

• CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants [20.064386074670605]
  We introduce a bidirectional neural framework in which the learned maps induce forward and backward displacement interpolants.<n>Experiments on Swiss roll, MNIST, CelebA, single-cell data, and chest X-ray images evaluate endpoint fidelity, transport cost inverse, consistency, and the geometry of the induced inverts.
  arXiv  Detail & Related papers  (2026-09-12T11:31:53Z)
• Translation-Invariant Tile-Based Phase Unwrapping with Residual-Weighted Multipath Averaging [2.349064979059293]
  Phase unwrapping is a key step in interferometric and coherent imaging.<n>We propose a strategy in which every tile is unwrapped in the frequency domain, through the Discrete Cosine Transform (DCT) and the least squares (LS) formalism of Ghiglia et al.<n>Unwrapping and noise filtering are performed jointly, which regularizes an otherwise ill-posed inverse problem.
  arXiv  Detail & Related papers  (2026-09-11T18:17:51Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• Stochastic Estimation of the Layer-wise Hessian Trace for Monitoring Neural-network Training [45.88028371034407]
  We present a parameter estimator of the trace of the diagonal blocks of the Hessian matrix of the empirical risk of a neural network.<n>The procedure combines the Hutchinson trace estimator with a single Hessian-vector product over the whole parameter vector.<n>We show that correctness under weight sharing requires the layer-wise Hessian to be assembled before the second differentiation.
  arXiv  Detail & Related papers  (2026-05-25T10:24:32Z)
• Finite-size scaling of hetero-associative retrieval in continuous-signal-driven Ising spin systems [0.0]
  Real-world physical signals are continuous and high-dimensional, yet statistical-mechanics of associative memory operates on discrete Ising spins.<n>We bridge this divide through a multilayer Ising framework that couples a geometry-preserving continuous-to-Ising encoder.<n>We reconstruct the macroscopic sleep state on parietal EEG and EOG axes from a single noisy frontal-EEG cue, demonstrating cross-modal recall in the presence of quenched biological disorder.
  arXiv  Detail & Related papers  (2026-05-13T19:33:51Z)
• Neural Networks as Local-to-Global Computations [0.0]
  We construct a sheaf from any ReLU neural network by encoding each computational step as a restriction map on an edge.<n>Unlike the forward pass, the heat equation propagates information bidirectionally across layers, enabling pinned neurons that impose constraints in both directions.<n>We validate the framework experimentally on small synthetic tasks, confirming the convergence theorems and demonstrating that sheaf-based training, while not yet competitive with gradient descent, obeys quantitative scaling laws predicted by the theory.
  arXiv  Detail & Related papers  (2026-03-16T05:23:31Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations [9.32782060570252]
  Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks.<n>We analytically investigate the case of equally-spaced repeaters.<n>We find exact analytic formulae for all moments of the fidelity up to 25 segments.
  arXiv  Detail & Related papers  (2024-04-10T16:24:51Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.