SearcharxivSearch

arXiv · 2601.18854

Learning constitutive laws under explicit strain limits: An interpretable strain-limiting elasticity--Kolmogorov Arnold neural network framework

Abstract

A physically consistent framework for modeling materials with saturating deformation, such as elastomers and biological tissues, is provided by strain-limiting elasticity. Fundamental limitations of classical elasticity are addressed through the enforcement of bounded strains; however, significant challenges for data-driven learning are posed by the strong nonlinearity of these laws. In this work, an interpretable hybrid constitutive modeling framework integrating strain-limiting elasticity (SLE) with Kolmogorov-Arnold Networks (KANs) is proposed to balance mechanical admissibility with data-driven flexibility. The dominant nonlinear response is captured by the SLE backbone, while smooth residual corrections are learned exclusively via a KAN. Essential mechanical principles-including symmetry, monotonicity, and bounded strain-are embedded directly into the model structure to ensure physical admissibility. The framework is assessed on synthetic benchmarks, where near-exact recovery is achieved in smooth regimes and consistency is retained under sharp transitions. Application to Treloar's rubber elasticity data demonstrates systematic improvement in stress-stretch agreement while preserving explicit strain limits. A regime-based analysis reveals a transparent trade-off between data fidelity and mechanical admissibility, demonstrating that deviations arise from deliberately imposed physical restrictions rather than unconstrained model expressivity. This SLE-KAN framework offers a robust, physics-consistent alternative to black-box neural networks for constitutive modeling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chandana Pati, S. M. Mallikarjunaiah. 2026-01-26. Learning constitutive laws under explicit strain limits: An interpretable strain-limiting elasticity--Kolmogorov Arnold neural network framework. https://arxiv.org/abs/2601.18854

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

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM