Search arXiv⌕ Search

arXiv · 2610.34565

Constrained neural softening functions for the Mullins effect in parameter-dependent materials

Abstract

Accurately capturing the Mullins effect across varying material compositions remains challenging, as constitutive models must unify flexible representations of stress softening with physical consistency and robust parameter calibration. In this work, we investigate parameter-dependent physics-augmented neural network constitutive models within the pseudo-elastic modeling framework, focusing on structural constraints that ensure physically admissible neural softening functions. This paper has three key contributions: (1) We formulate different neural softening functions within the pseudo-elastic framework, including a multiplicative decomposition of the softening function that enables parameter-dependent ansatz functions satisfying common mechanical constitutive conditions by construction. (2) We derive a sufficient condition for ellipticity of pseudo-elastic constitutive models, which can be enforced in the constitutive models by construction. (3) We systematically investigate how flexibility and structural constraints influence the performance of neural softening functions in terms of prediction accuracy and calibration robustness. For this, we consider multiaxial experimental data of carbon black-filled EPDM rubber synthesized with varying amounts of curatives. The findings of our work suggest that neural softening functions are a promising extension of the classical pseudo-elastic framework and, when subject to suitable constraints, can improve predictive accuracy for highly nonlinear, parameter-dependent materials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominik K. Klein, Jonas Fey, Maximilian Kannapinn, Oliver Weeger. 2026-10-25. Constrained neural softening functions for the Mullins effect in parameter-dependent materials. https://arxiv.org/abs/2610.34565

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Refined Thompson Learning for Adaptive Bandits: Power-Efficient Flexibility Scheduling Across Data Centers

The rapid growth of large-scale AI workloads in data centers has placed increasing pressure on power grids in recent years. Since power systems must continuously balance supply and demand, there is growing interest in leveraging data-center workload flexibility as a grid service. We propose a contextual restless multi-armed bandit (CRMAB) framework in which a grid operator requests load reductions without observing internal job-scheduling decisions. Under an index-ability guarantee, each data center or physical machine is modeled as a Markov decision process (MDP) over a cyclic virtual-machine (VM) job queue, with unknown rewards and transition dynamics that are learned online using Thompson sampling and Whittle-index policies. To improve learning under sparse and noisy observations, the framework augments an adaptive Thompson--Whittle (TW) policy with domain-informed transition priors and gated prior mixing. In baseline experiments, the best refined adaptive variant achieves 91.4\% of the oracle reward after 100 rounds and 96.8\% after 1,000 rounds. Across a 16-setting stress test spanning different state-space sizes and levels of contextual feature noise, the best refined variant consistently outperforms the original TW policy with high confidence while remaining competitive with EXP4. A graph-based prior further incorporates data-center hardware constraints, including operating frequency and computing-resource limits. Overall, our results demonstrate the economic potential of data-center flexibility as a grid service and highlight the importance of high-quality, open-source AI workload traces for developing and evaluating such services.

cs.CE↗

A Topology-Aware Quantum-Classical Framework for Multi-Target Active Debris Removal using Gaussian Boson Sampling

The continued growth of orbital debris threatens the safety and sustainability of near-Earth space, making Active Debris Removal (ADR) an important mitigation strategy. Selecting $k$ targets from $N$ candidates yields a combinatorial search space of size $\binom{N}{k}$, making joint target selection and mission sequencing computationally demanding. We present a topology-aware quantum-classical framework integrating orbital mechanics, weighted orbital-transfer graphs, Gaussian Boson Sampling (GBS), and multi-objective evolutionary optimization. Seven target-prioritization strategies represent physical consequence, orbital persistence, conjunction risk, network centrality, community structure, inferred source families, and random selection. GBS generates candidate target subsets from the weighted graph, which are then evaluated using PyGMO-based evolutionary optimization to identify servicing sequences that jointly minimize total velocity increment ($Δv$) and mission duration, accounting for modeled timing, propulsion, and mass feasibility. We evaluate the framework across three benchmark environments, SOCRATES Minefield, Collision Cloud, and Random, with candidate-pool sizes $N\in\{15,18,22,25\}$ and target cardinalities $k\in\{3,5\}$. The experiments characterize how benchmark topology, prioritization strategy, and problem scale relate to sampling behavior and downstream mission performance. By separating candidate-subset generation from detailed trajectory optimization, the framework offers a topology-aware approach to focusing computational effort on a limited set of candidate ADR missions.

cs.CE↗

Faster Polyhedral Intersections in 3D

The operation of intersecting two polyhedra, which can be reduced to clipping one polyhedron with a series of planes formed from another polyhedron, is central to intersection based mesh interpolation and material interface reconstruction. R3D is a robust library for such operation which implements the algorithm of Sugihara. In this paper, we present J3D, a new implementation of the clipping algorithm of Sugihara that provides substantial performance improvements over R3D.

cs.CE↗