Next Article in Journal
The Paradox Between Correlations and Sign Predictability
Next Article in Special Issue
Improving PINN Convergence in Nonlinear Multiphase Flow Problems Through Weight Gradient Consistency Analysis
Previous Article in Journal
Discrete Quantization on Spherical Geometries: Explicit Models, Computations, and Didactic Exposition
Previous Article in Special Issue
Tractor and Semitrailer Scheduling with Time Windows in Highway Ports with Unbalanced Demand Under Network Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Data-Driven Computation Scheme for Duncan–Chang EB Model

1
PowerChina Guiyang Engineering Corporation Limited, Guiyang 550081, China
2
College of Water Conservancy and Hydropower Engineering, Hohai University, Nanjing 210098, China
3
State Key Laboratory of Water Disaster Prevention, Nanjing 210098, China
4
State Key Laboratory of Hydroscience and Engineering, Tsinghua University, Beijing 100084, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(5), 751; https://doi.org/10.3390/math14050751
Submission received: 15 January 2026 / Revised: 6 February 2026 / Accepted: 21 February 2026 / Published: 24 February 2026

Abstract

This paper extends the data-driven computational mechanics paradigm to nonlinear materials characterized by the Duncan–Chang Elastic-Bulk (E-B) constitutive model. Unlike in linear elastic systems, geotechnical media exhibit stress-dependent tangent moduli and non-convex constitutive manifolds. We propose a recursive nested data-driven solver that dynamically adapts the phase-space distance metric to account for pressure-dependent hardening. A rigorous mathematical analysis of convergence is provided, demonstrating that the solver’s performance is governed by the local transversality between the conservation law constraint set and the nonlinear material manifold. We derive explicit error bounds that couple spatial discretization resolution with material data density. Numerical experiments using triaxial test data from a high-altitude region validate the theoretical predictions, showing that the proposed scheme demonstrates convergence in single-element tests.

1. Introduction

1.1. The Duncan–Chang EB Model: Development and Limitations

The Duncan–Chang EB model represents one of the most widely adopted constitutive frameworks in computational geomechanics. Developed from extensive experimental observations of soil behavior under triaxial loading conditions, the model captures the essential features of granular material response including stress-dependent stiffness, nonlinear stress–strain relationships, and bulk modulus evolution [1]. The model characterizes soil behavior through a hyperbolic relationship between deviatoric stress and axial strain, with stress-dependent tangent moduli that capture the pressure-sensitive nature of granular materials. By virtue of its mathematical formulation, this model has been extensively applied in the analysis of earth dams, foundations, and slopes [2,3].
Since its inception, researchers have proposed numerous modifications and enhancements to the basic model. For example, Wang et al. [2] introduced dilatancy into the traditional Duncan–Chang EB model to develop an EBD constitutive model for rockfill materials, validated against monitoring data from the Aertashi concrete face rockfill dam. Dong et al. [4] modified the model based on triaxial consolidated drained test data for medium–coarse sand with different relative densities, enabling consideration of disturbance effects on soil response—particularly important for stability analysis of sand excavation.
Although the Duncan–Chang model has certain limitations and researchers have continuously proposed modifications to improve it [5,6], it is still extensively used in practice. Furthermore, the numerical implementation of the Duncan–Chang model has been explored using various finite element platforms. Sun et al. [7] and Qing-ming [8] developed implementations based on secondary development interfaces of commercial software, respectively, showing good agreement with experimental results. Nevertheless, the fundamental challenge of parameter calibration remains, motivating interest in alternative approaches.
Despite its empirical success, the Duncan–Chang model requires careful parameter calibration using curve-fitting procedures applied to experimental data—a process that introduces modeling error, parameter uncertainty, and potential loss of information. Traditional calibration methods often rely on selecting specific points from stress–strain curves (e.g., 75% and 90% of failure stress) or regression techniques [9], which may not always yield reasonable parameter values. In some cases, the modulus exponent parameter n can even become negative [1], raising questions about the physical meaning of the fitted parameters.

1.2. Data-Driven Computational Mechanics: A New Paradigm

Data-driven computational mechanics (DDCM) represents a paradigm shift from model-based to data-based approaches in solid mechanics [10]. Three main branches have emerged.

1.2.1. Model-Free Data-Driven Methods

Model-free methods directly incorporate stress–strain data into analysis, completely bypassing material model definition. Stöcker et al. [11] provides a comprehensive comparison of model-free and model-based approaches in constitutive modeling. The foundational work by González et al. [12] established the mathematical framework for consistent data-driven computational mechanics.
Key challenges in model-free DDCM include efficient data structures for nearest-neighbor searches in high-dimensional phase spaces. Eggersmann et al. [13] developed efficient data structures specifically for model-free data-driven computational mechanics, addressing computational bottlenecks. Gebhardt et al. [14] proposed a framework based on nonlinear optimization for data-driven structural analysis in general elasticity.
Wattel et al. [15] introduced mesh d-refinement as a novel data-based computational framework to account for complex material response through abstract phase spaces, avoiding explicit constitutive law definitions. This approach matches physically admissible states with observed material response data.

1.2.2. History-Dependent Behavior

The extension of DDCM to path-dependent and inelastic materials has been an active area of research. Dandin et al. [16] extended the data-driven framework to history-dependent behavior by representing the material response as a directed graph, where vertices represent strain–stress pairs and arcs represent thermodynamically admissible transitions. To account for complex inelastic phenomena such as plasticity and phase transformations, Bartel et al. [17] introduced the concept of history surrogates and propagators, enabling the enrichment of the material database with path-dependent information without altering the core distance-minimization structure. Karapiperis et al. [18] developed a multiscale data-driven framework where the material history of granular media, such as sand, is parameterized through lower-scale computations, effectively capturing non-monotonic loading responses and shear banding.
Beyond deterministic models, the quantification of uncertainty is a crucial frontier. Huang et al. [19] developed a sequential linear programming (SLP) approach for uncertainty analysis in data-driven computational mechanics, providing bound-based structural responses. Zschocke et al. [20] proposed a scheme for handling polymorphic uncertainties in composite materials by incorporating both aleatoric and epistemic uncertainties within a single dataset, thereby allowing for efficient macroscopic structural analysis in the presence of mesoscale heterogeneities.

1.2.3. Neural Network-Based Methods

Alternative data-driven approaches utilize artificial neural networks to approximate constitutive relationships. Zlatić et al. [10] compared neural network-based and model-free approaches for computational mechanics, finding that neural networks can learn material behavior patterns from data effectively. Ciftci and Hackl [21] proposed a physics-informed GAN framework based on model-free data-driven computational mechanics.
To clearly position our proposed framework within the broader landscape of data-driven mechanics, we provide a comparative analysis of the three main branches discussed above. Table 1 highlights the key differences in terms of data requirements, computational efficiency, and applicability to stress-dependent materials.

1.3. Gap in Existing Studies and Current Contributions

The data-driven computing paradigm offers a fundamentally different approach: calculations proceed directly from experimental material data while satisfying conservation laws and kinematic constraints, thereby eliminating the intermediate modeling step [11]. This paradigm, pioneered by Kirchdoerfer and Ortiz [22], represents a transition from standard data-scarce methods to modern data-rich approaches in computational mechanics [10]. While previous work has demonstrated the viability of data-driven methods for linear elasticity [14] and simple nonlinear structures [12], extending this framework to stress-dependent hyperbolic materials presents several theoretical and computational challenges:
  • High-dimensional phase space: The Duncan–Chang model operates in a 12-dimensional local phase space (six independent stress components and six independent strain components), with material response depending nonlinearly on the stress state itself.
  • Pressure-dependent stiffness: Unlike classical elasticity, the tangent moduli in the Duncan–Chang model vary with confining pressure, requiring datasets that adequately sample this additional dimension.
  • Hyperbolic stress–strain behavior: The asymptotic nature of hyperbolic relationships necessitates careful treatment of the failure envelope and appropriate penalty function formulation.
  • Convergence analysis: Establishing convergence requires accounting for the non-polynomial nonlinearity of the constitutive manifold and its transversality properties with respect to equilibrium constraints.
In this work, we develop a comprehensive theoretical framework for data-driven computing with Duncan–Chang materials, including the following:
  • Formulation of the data-driven problem for stress-dependent hyperbolic materials with appropriate distance metrics.
  • Efficient algorithms for local data assignment in high-dimensional phase spaces.
  • Rigorous convergence analysis with explicit error bounds.
  • Extension to finite element discretizations with joint convergence in mesh size and data resolution.
  • Numerical validation using real triaxial test data.
The remainder of this paper is organized as follows. Section 2 presents the classical Duncan–Chang EB model formulation and its phase space characterization. Section 3 develops the data-driven formulation for stress-dependent materials. Section 4 describes the iterative solution algorithm. Section 5 demonstrates the numerical applications and validation using triaxial test data. Section 6 presents the mathematical convergence analysis. Finally, Section 7 discusses the implications, limitations, and future directions of this work.

2. The Duncan–Chang EB Model

2.1. Classical Formulation

The Duncan–Chang EB model characterizes soil behavior through two primary relationships: a hyperbolic stress–strain curve for deviatoric behavior and a separate bulk modulus formulation for volumetric response.

2.1.1. Deviatoric Behavior

Under triaxial compression with axial strain ε 1 and confining pressure σ 3 , the deviatoric stress is given by
σ 1 σ 3 = ε 1 a + b ε 1
where the parameters are defined as
a = 1 E i , b = 1 ( σ 1 σ 3 ) f
The initial tangent modulus is
E i = K P a σ 3 P a n
where K is the modulus number, n is the modulus exponent, and P a is the atmospheric pressure (reference stress). The failure stress difference is
( σ 1 σ 3 ) f = 2 c cos ϕ + 2 σ 3 sin ϕ 1 sin ϕ · R f
where c is cohesion, ϕ is the friction angle, and R f is the failure ratio (typically 0.75–0.95).

2.1.2. Tangent Modulus

The stress-dependent tangent Young’s modulus is given by
E t = K P a σ 3 P a n 1 R f ( 1 sin ϕ ) ( σ 1 σ 3 ) 2 c cos ϕ + 2 σ 3 sin ϕ 2
where R f is the failure ratio. This formulation captures the degradation of stiffness as the stress state approaches the failure envelope.

2.1.3. Bulk Modulus

The volumetric response is characterized by
B = K b P a σ 3 P a m
where K b is the bulk modulus number and m is the bulk modulus exponent.

2.2. Material Datasets

A material dataset for the Duncan–Chang model consists of stress–strain pairs obtained from laboratory testing:
E = { ( ε ( i ) , σ ( i ) ) : i = 1 , , N }
Ideally, these points are obtained from multiple triaxial tests at different confining pressures, consolidated undrained (CU) tests, or isotropic compression tests to capture the full pressure-dependent behavior. Each data point represents a material state that is physically realizable and experimentally verified.
Unlike linear elastic materials where a single test can theoretically determine all material parameters, Duncan–Chang materials require systematic sampling across the relevant stress space to capture pressure-dependent stiffness variations.

2.3. Phase Space and Constitutive Manifold

For three-dimensional problems, the local state is characterized by the pair z = ( ϵ , σ ) Z . We introduce a stress-dependent reference stiffness C r e f (equivalent to the initial stiffness E i in Equation (2)) to define a local metric in the phase space:
| z | C r e f 2 = 1 2 ϵ : C r e f : ϵ + 1 2 σ : C r e f 1 : σ
The Duncan–Chang constitutive manifold E D C Z is rigorously defined as the set of state pairs satisfying the incremental constitutive law:
E D C = { ( ϵ , σ ) Z σ ˙ = C t a n ( σ ) : ϵ ˙ }
where C t a n corresponds to the tangent moduli defined in Equations (5) and (6). This definition explicitly characterizes the target set for the data-driven solver.

2.4. Iterative Tangent Stiffness Update

Crucially, for the Duncan–Chang model, the weighting matrix C e is not constant. We define C e = C e ( E t , B ) , where E t is the tangent modulus and B is the bulk modulus:
E t = 1 R f ( 1 sin ϕ ) ( σ 1 σ 3 ) 2 c cos ϕ + 2 σ 3 sin ϕ 2 K P a σ 3 P a n
In the data-driven solver, C e is updated iteratively using the stress state σ e from the previous iteration, ensuring that the metric is consistent with the local nonlinear physics.

2.5. Notation Clarification

To ensure clarity and avoid confusion, we provide a comprehensive notation table that systematically defines all key symbols used throughout this manuscript in Table 2.

Key Relationships and Clarifications

  • Parameters a and b (Equation (2)): These are not constants. They vary with confining pressure σ 3 through the initial modulus E i ( σ 3 ) and failure stress ( σ 1 σ 3 ) f ( σ 3 ) defined in Equations (3) and (4). For each confining pressure level, different values of a and b apply.
  • Symbol B disambiguation: The symbol B exclusively denotes the bulk modulus throughout this manuscript (Equation (6)). It should not be confused with the strain–displacement matrix B e a , which always appears with subscripts.
  • Reference stiffness notation: The conceptual reference stiffness C ref introduced in Equation (8) is used for theoretical exposition. In actual implementation, we use the element-specific, stress-dependent stiffness tensor C e ( σ ¯ e ) , where σ ¯ e is the reference stress state at element e.
  • Data points: generic vs. optimal:
    -
    ( ε e 0 , σ e 0 ) : Generic candidate data point from database E e .
    -
    ( ε e , σ e ) : Optimal data point that minimizes distance in Equation (14).
    -
    Relationship: ( ε e , σ e ) { ( ε e 0 , σ e 0 ) } , i.e., the optimal point is selected from candidates.
  • Database hierarchy: E e E . The global database E contains all experimental data points. For computational efficiency, each element e accesses a local subset E e containing only data points relevant to its current stress state (typically same confining pressure σ 3 ).
  • Stiffness representations: The same physical quantity (element stiffness) appears in three forms:
    -
    C e : Fourth-order tensor (index notation C i j k l ).
    -
    D : 6 × 6 matrix (Voigt notation for computational implementation, Equation (23)).
    -
    Relationship: D is the Voigt representation of C e , with standard index mapping: 11→1, 22→2, 33→3, 23→4, 13→5, 12→6.
  • Integration weights w e : Standard Gauss quadrature weights multiplied by the determinant of the Jacobian matrix at each integration point. For a regular hexahedral element with 2 × 2 × 2 Gauss points, w e = 1 at each point (after normalization). No additional modifications or scaling factors are applied.
  • Strain-displacement matrix B e a : Standard finite element matrix relating nodal displacements u a to strains ε e at integration point e. For eight-node hexahedral elements, B e a is a 6 × 3 matrix (sic strain components, three displacement DOFs per node). The detailed formulation follows Zienkiewicz et. al. [23].

3. Data-Driven Formulation for Duncan–Chang Materials

3.1. Penalty Function Construction

Following the original data-driven computational mechanic theory [22], we construct a penalty function that measures distance from the material dataset in the phase space. For a material point e with state ( ε e , σ e ) , define
F e ( ε e , σ e ) = min ( ε e 0 , σ e 0 ) E e W e ( ε e ε e 0 ) + W e ( σ e σ e 0 )
The strain energy and complementary energy densities are chosen to reflect the physical structure of the Duncan–Chang model:
W e ( ε ) = 1 2 ε : C e ( σ ¯ e ) : ε
W e ( σ ) = 1 2 σ : C e 1 ( σ ¯ e ) : σ
where C e ( σ ¯ e ) is a reference stiffness tensor evaluated at a reference stress state σ ¯ e , typically chosen as the current iterate stress state or the average of current and data point stresses.
The stress-dependent stiffness necessitates a linearization point for the penalty function. Using the current iterate creates a sequence of locally quadratic problems that adapt to the evolving solution.
To account for the pressure-dependent behavior of the Duncan–Chang EB model, we define an adaptive distance metric in the phase space. The local penalty function F e is constructed using a reference stiffness tensor C e ( σ ¯ e ) that evolves with the stress state. We define the strain and complementary energy-based distance as
F e ( ε e , σ e ) = min ( ε e , σ e ) E e 1 2 ( ε e ε e ) : C e ( σ ¯ e ) : ( ε e ε e ) + 1 2 ( σ e σ e ) : C e 1 ( σ ¯ e ) : ( σ e σ e )
The reference tensor C e ( σ ¯ e ) is an isotropic fourth-order tensor determined by the tangent moduli at the linearization point. In the EB framework, it is expressed with the tangent Young’s modulus E t and tangent bulk modulus B as
C i j k l = ( B 2 3 G t ) δ i j δ k l + G t ( δ i k δ j l + δ i l δ j k )
where C i j k l is the Einstein notation of C e ( σ ¯ e ) and the tangent shear modulus G t is derived from the instantaneous tangent modulus E t and bulk modulus B via the relation:
G t = 3 E t B 9 B E t
This formulation ensures that the reference stiffness tensor C e ( σ ¯ e ) is fully consistent with the local stress state σ ¯ e through the pressure-dependent moduli E t ( σ ¯ e ) and B ( σ ¯ e ) .

3.2. Global Data-Driven Problem

Consider a finite element discretization with m integration points. The global penalty function is
F = e = 1 m w e F e ( ε e , σ e )
where w e are integration weights. The constrained data-driven problem is
Minimize: e = 1 m w e F e ( ε e , σ e )
Subject to
  • Compatibility: ε e = a = 1 n B e a . u a
  • Equilibrium: e = 1 m w e B e a T σ e = f a .
where { u a } are nodal displacements, { f a } are applied nodal forces, and B e a are strain-displacement matrices.

3.3. Euler-Lagrange Equations

Introducing Lagrange multipliers η a for equilibrium constraints, the stationarity conditions are
δ u a : e = 1 m w e B e a T C e ( σ ¯ e ) b = 1 n B e b u b ε e = 0
δ σ e : C e 1 ( σ ¯ e ) ( σ e σ e ) = a = 1 n B e a η a
δ η a : e = 1 m w e B e a T σ e = f a
where ( ε e , σ e ) are optimal data points satisfying the distance minimization condition.

3.4. Linearized System

The Euler-Lagrange equations can be recast as two coupled linear systems:
b = 1 n e = 1 m w e B e a T C e ( σ ¯ e ) B e b u b = e = 1 m w e B e a T C e ( σ ¯ e ) ε e
b = 1 n e = 1 m w e B e a T C e ( σ ¯ e ) B e b η b = f a e = 1 m w e B e a T σ e
These represent equilibrium problems for a comparison solid with stress-dependent stiffness C e ( σ ¯ e ) , driven by optimal strains and out-of-balance stresses, respectively.

3.5. Numerical Implementation: 3D Incremental Matrix

For practical finite element implementation, the reference stiffness tensor is represented as a 6 × 6 constitutive matrix D . Using the tangent moduli E t and B, the symmetric components of D are given by
D = B + 4 3 G t B 2 3 G t B 2 3 G t 0 0 0 B 2 3 G t B + 4 3 G t B 2 3 G t 0 0 0 B 2 3 G t B 2 3 G t B + 4 3 G t 0 0 0 0 0 0 G t 0 0 0 0 0 0 G t 0 0 0 0 0 0 G t
To ensure numerical stability in the solver, the tangent Poisson’s ratio ν t = 1 2 E t 6 B must be constrained within [ 0 , 0.49 ] . When E t 0 near failure, the bulk modulus B maintains the positive definiteness of the global stiffness matrix, a key advantage of the EB model over constant Poisson’s ratio formulations.

4. Iterative Solution Algorithm

4.1. Nested Iteration Structure

The stress-dependent nature of the Duncan–Chang model necessitates a nested iteration strategy:
  • Outer iteration (stress–state update): Updates the reference stress σ ¯ e used in penalty function construction.
  • Inner iteration (data assignment): Determines optimal data points ( ε e , σ e ) for fixed reference stress.
At each outer iteration k, the tangent moduli E t and B are computed from the current stress state:
  • Step 1: Extract principal stresses from σ ¯ e ( k ) : σ I , σ I I , σ I I I .
  • Step 2: Compute mobilization level:
    S L = σ I σ I I I ( σ 1 σ 3 ) f
    where ( σ 1 σ 3 ) f from Equation (4).
  • Step 3: Update tangent modulus E t ( k ) using Equation (5).
  • Step 4: Update bulk modulus B ( k ) using Equation (6).
  • Step 5: Assemble C e ( k ) using Equations (15) and  (16) with E t ( k ) and B ( k ) .
The material parameters K, n, K b , m, c, ϕ and R f are NOT calibrated. They are only used to define the reference metric for distance measurement. The actual material response comes entirely from the database.

4.2. Parameter Identification for Metric Construction

It is crucial to distinguish between the role of material parameters in traditional FEM and in our DDCM framework. In traditional FEM, the parameters ( K , n , c , ϕ , R f ) define the constitutive law used to predict stress. In our DDCM framework, these parameters are strictly used to define the distance metric (the local geometry of the phase space). They do not generate the stress response; the stress response comes directly from the experimental database E .
The initial values of parameters K , n , R f , c , ϕ required for Equations (5) and (6) are identified once from the experimental dataset using standard linear regression on the ϵ 1 / ( σ 1 σ 3 ) vs. ϵ 1 plots (see Appendix A). These parameters are then fixed and used solely to update the tangent stiffness tensor C e ( k ) in the outer loop of Algorithm 1.
Algorithm 1 Adaptive Data-Driven Solver for Duncan–Chang EB Materials
Require: 
Material database E , Nodal forces f a , Mesh B e a
  1:
Initialize:  k = 0 , σ ¯ e ( 0 ) = geostatic stress, random assignment ( ϵ e ( 0 ) , σ e ( 0 ) ) E
  2:
while outer convergence not met do
  3:
    Update C e ( k ) using ( σ ¯ e ( k ) , E t , B ) according to Equations (15) and (16).
  4:
    while inner assignment not converged ( j < j m a x ) do
  5:
         Solve global displacement:
K ( k ) u ( k , j ) = e w e B e a T C e ( k ) ϵ e ( k , j )
  6:
         Solve dual multipliers:
K ( k ) η ( k , j ) = f e w e B e a T σ e ( k , j )
  7:
         Update IP states:
ϵ e ( k , j ) = B e a u a ( k , j ) , σ e ( k , j ) = σ e ( k , j ) + C e ( k ) B e a η a ( k , j )
  8:
         Local mapping:
( ϵ e , j + 1 , σ e , j + 1 ) = arg min z E | z ( k , j ) z | C e
  9:
     end while
10:
     Update reference stress: σ ¯ e ( k + 1 ) = σ e ( k , j )
11:
       k k + 1
12:
end while
13:
return  u a , ϵ e , σ e

4.3. Detailed Algorithm

The theoretical framework developed in the previous sections is consolidated into a robust computational procedure designed to navigate the non-convex material manifold of the Duncan–Chang EB model. To effectively handle the inherent nonlinearity, the solver employs a double-loop structure: the inner loop solves the distance-minimization problem for a fixed reference stiffness, while the outer loop updates the tangent moduli based on the newly converged stress states. This ensures that the distance metric in phase space remains physically consistent with the material’s pressure-dependent behavior.
The algorithmic flow integrates the linearized Euler–Lagrange systems derived in Equations (18)–(20) with an efficient local data assignment step. For the local mapping, we utilize the principal stress space to minimize computational cost, as the triaxial experimental data is naturally organized along these axes. The comprehensive iterative scheme is summarized in Algorithm 1, where τ i n and τ o u t denote the user-defined tolerances for the inner data assignment and outer stress-consistency loops, respectively.
  • Algorithmic Parameters:
  • Inner Loop Tolerance ( τ i n ): Controls the convergence of the data-assignment and equilibrium solver. Set to 10 6 relative energy error.
  • Outer Loop Tolerance ( τ o u t ): Controls the stabilization of the distance metric C e . Set to 10 4 change in reference stress.
  • Max Inner Iterations ( j m a x ): Empirically set to 100. Numerical experiments show that for consistent datasets, convergence typically occurs within 20–30 iterations.

4.4. Isotropic Reduction and Search Efficiency

To alleviate the computational burden of searching in the 12-dimensional phase space Z , we exploit the material isotropy inherent in the Duncan–Chang model. The local mapping step (Step 4 in Algorithm 1) is performed in the three-dimensional principal stress space ( σ 1 , σ 2 , σ 3 ) . For each integration point, the trial stress tensor σ e ( k , j ) is diagonalized to obtain its principal values. A nearest-neighbor search is then conducted within the triaxial database E t r i a x . Once the optimal principal pair ( ε i , σ i ) is identified, the tensors are rotated back to the global coordinate system using the eigenvectors of the trial state. This reduction ensures that ρ k (data fill-distance) is evaluated in a lower-dimensional manifold, significantly improving the algebraic convergence rate α presented in Corollary 1.
From a computational complexity perspective, the nearest-neighbor search in the full 12-dimensional phase space would incur a cost of O ( N log N ) (using k-d trees) or O ( N ) (brute force), but with a substantial constant factor due to the “curse of dimensionality”. By performing the search in the three-dimensional principal stress space, we significantly reduce this dimensionality-dependent pre-factor. While the asymptotic class remains O ( N log N ) , the effective search time is drastically reduced, enabling real-time queries even for large experimental databases.

4.5. Search Strategy and Convergence

To handle the multi-dimensionality of the E-B model data, we employ an adaptive K-d tree search. Given the strong dependence on σ 3 , the search space is partitioned primarily along the pressure axis. This “stress-stratified” search significantly improves the nearest-neighbor assignment speed. The convergence is achieved when the data point assignments S = { z e } e = 1 N remain invariant between successive iterations, or the total energy distance falls below a tolerance η .

4.6. Distance Metric and Voronoi Tessellation

The local distance is weighted by the material stiffness matrix C e :
| ( ε , σ ) | e 2 = W e ( ε ) + W e ( σ ) = 1 2 ε : C e : ε + 1 2 σ : C e 1 : σ
For the E-B model, C e is not a constant matrix. It must be updated based on the current stress level σ 3 and the stress level of the matched data point. The material stiffness matrix C e induces a Voronoi tessellation of phase space, with each data point ( ε ( i ) , σ ( i ) ) defining a cell:
V i = { ( ε , σ ) : | ( ε ε ( i ) , σ σ ( i ) ) | e | ( ε ε ( j ) , σ σ ( j ) ) | e , j i }
The data assignment problem reduces to determining which Voronoi cell contains the trial state ( ε e ( k , j ) , σ e ( k , j ) ) .

4.7. Algorithmic Complexity and Optimization

For efficient nearest-neighbor search in the 12-dimensional phase space, we employ
  • K-d trees for moderate-sized datasets ( N < 10 4 ).
  • Locality-sensitive hashing for large datasets ( N 10 4 ).
  • Parallel computation of local data assignments across integration points.

5. Numerical Validation

5.1. Experimental Data

We validate the proposed data-driven framework using conventional triaxial compression test data for a special soil collected from a high-altitude region of Tibet, China. The dataset was collected from Consolidated Drained (CD) triaxial compression tests carried out on saturated cohesive soils according to ASTM D7181-20(2020) [24].
Specimens were isotropically consolidated to effective confining pressures ( σ 3 ) of 100, 300, 500, 900, 1300, and 1800 kPa and then sheared under drained conditions at a constant axial strain rate of 0.1%/min. The dataset comprises pairs of effective stress and total strain, ensuring compatibility with the stress-dependent formulation of the Duncan–Chang EB model.
Table 3 presents the basic physical properties of the test soil. The soil exhibits low plasticity with a plasticity index of 10.9%, characteristic of clayey sands. The specific gravity of 2.70 indicates typical mineralogical composition for terrestrial soils. The optimum moisture content of 10.96% and maximum dry density of 1.98 g/cm3 reflect the compaction characteristics relevant for engineering applications. The mean particle diameter d 50 = 0.073 mm classifies the material as fine-grained according to the Unified Soil Classification System.
Figure 1 presents the experimental data, demonstrating the pressure-dependent stiffness characteristic of Duncan–Chang materials. At higher confining pressures, the material exhibits stiffer response and higher failure stresses.

5.2. Stress-Dependent Stiffness

The initial tangent modulus E i varies systematically with confining pressure according to the Janbu relation E i = K P a ( σ 3 / P a ) n . Using the experimental data, we identify the parameters K = 500 and n = 0.5 .
Figure 2 illustrates the variation of initial modulus with confining pressure, confirming the pressure-dependent nature of the material stiffness.

5.3. Data-Driven Solver Performance

The simulation models a standard single-element triaxial test using a single eight-node isoparametric hexahedral element with 2 × 2 × 2 Gaussian integration points. The boundary conditions are set to model a quarter-symmetry section: roller boundaries are applied to the bottom, left, and back faces, while displacement-controlled loading is applied to the top face.
In this section, we apply the data-driven solver in an element test simulation to predict the material’s response. Specifically, we simulate a triaxial compression test targeting a state of ε 1 = 2 % axial strain under a constant confining pressure of σ 3 = 500 . This validates the algorithm’s ability to recover the correct stress state from the material dataset.
Figure 3 shows the convergence history, with the penalty function (distance from the dataset) decreasing rapidly in the first few iterations and gradually approaching the minimum value. The algorithm exhibits robust convergence characteristics.

5.4. Data Point Assignment and Voronoi Tessellation

A key aspect of the data-driven approach is the assignment of computed states to nearest data points in phase space. Figure 4 illustrates this process for the target state.
The geometric mechanism of data assignment becomes clearer when examining the Voronoi tessellation of phase space. Figure 5 shows how the phase space is partitioned into Voronoi cells, with each cell containing all of the points closest to a particular data point under the energy metric.
The Voronoi tessellation visualization reveals several important features:
  • Each data point controls a region of phase space where it is the nearest-neighbor.
  • The energy metric creates anisotropic Voronoi cells due to the weighting by stiffness C.
  • The solver naturally handles the nonlinear stress–strain relationship by navigating through these cells.
  • Points near failure (high stress, high strain) have smaller cells due to data density in critical regions.
To comprehensively validate the accuracy and robustness of the proposed data-driven algorithm, systematic multi-point validation tests were conducted across six different confining pressures ( σ 3 = 100, 300, 500, 900, 1300, and 1800 kPa). As shown in Figure 6, eight strain levels ( ε 1 = 0.5%, 1.0%, 1.5%, 2.5%, 3.5%, 5.0%, 8.0%, and 12.0%) were tested for each confining pressure, resulting in a total of 48 validation points.The validation results demonstrate that the data-driven algorithm achieves excellent agreement between computed states and assigned experimental data points across all tested conditions. The statistical metrics summarized in each subplot of Figure 6 provide quantitative evidence of the algorithm’s accuracy.
While the theoretical curves provide a smooth approximation of the soil’s behavior, they exhibit noticeable deviations from the experimental data points in certain strain ranges, particularly as the soil approaches the failure stage or under specific confining pressures where the hyperbolic assumption is less ideal. In contrast, the proposed data-driven algorithm does not rely on these predefined functional forms. By directly mapping the computed states to the nearest experimental data points within the phase space, the method bypasses the epistemic uncertainties and modeling errors inherent in traditional constitutive laws.
The majority of test points (approximately 70%) achieved full convergence within the maximum 100 iterations. Even for points that did not fully converge, the algorithm still produced physically reasonable results, demonstrating the stability of the iterative scheme.
The validation statistics reveal several key findings. Each confining pressure was tested with 7–8 strain levels, providing comprehensive validation across the full range of material response from elastic to plastic regimes. The mean relative errors across all confining pressures remain within acceptable limits, typically ranging from 10% to 25%, which is excellent for a data-driven approach that does not rely on predefined constitutive models. The RMSE values vary with confining pressure, ranging from approximately 50–150 kPa for lower confining pressures (100–300 kPa) to 200–400 kPa for higher confining pressures (1300–1800 kPa). The absolute error increase with confining pressure is expected and acceptable given the proportional increase in stress magnitudes. The R 2 values consistently exceed 0.85 across all confining pressures, with most cases showing R2 > 0.90, indicating excellent correlation between computed and assigned stress states.
It is worth noting that, in geotechnical practice, where material variability is high, a relative error of 10–25% across a wide range of confining pressures (100–1800 kPa) is considered robust. This is comparable to the typical fitting errors of traditional constitutive models when a single set of parameters is forced to fit data across large variations in confining pressure. The proposed method achieves this accuracy without pre-fitting global parameters for the prediction step.
The validation results reveal interesting dependencies on confining pressure:
  • Low confining pressures ( σ 3 = 100–300 kPa): The algorithm shows excellent accuracy at low-to-intermediate strain levels. At very high strains (>8%), the material’s response may approach failure conditions, leading to increased scatter.
  • Medium confining pressures ( σ 3 = 500–900 kPa): These conditions represent the optimal range for the data-driven algorithm, with the best combination of accuracy and convergence rate. The R 2 values consistently exceed 0.90.
  • High confining pressures ( σ 3 = 1300–1800 kPa): While absolute errors increase due to the larger stress magnitudes, the relative errors remain within acceptable bounds. The algorithm successfully captures the stress-dependent stiffening behavior characteristic of the Duncan–Chang EB model.
The validation across different strain levels reveals several patterns. For small strains ( ε 1 < 1.5%), some test points in this range did not achieve full convergence, likely due to the sparse experimental data coverage in the elastic region. However, the results still show reasonable agreement with experimental data. Data with strain at 1.5% < ε 1 < 5% exhibits the best performance, with excellent convergence and low relative errors. The material response in this region is well-represented in the experimental database. The algorithm maintains good accuracy even at large strains approaching failure ( ε 1 > 5%). The Voronoi tessellation effectively handles the nonlinear material behavior in this regime.

5.5. Numerical Verification and Computational Efficiency Analysis

To rigorously evaluate the performance of the proposed framework, a single-element compression test was conducted. A critical challenge in comparing our method with the Finite Element Method (FEM) using experimental data is the inherent “model bias”: FEM requires a prescribed constitutive model whose fitting process introduces secondary errors, whereas our method directly utilizes data points. To eliminate these confounding factors and establish a baseline for accuracy, synthetic datasets are employed in this section.
The synthetic data are generated based on a hyperbolic constitutive relationship. The specific material parameters used for the generation are summarized in Table 4.
Figure 7 presents the comparative results between the proposed method and traditional FEM using a high-fidelity synthetic dataset. As shown in the stress–strain response (Figure 7), results using our method exhibit excellent agreement with the FEM solution. This convergence demonstrates that, when provided with sufficiently dense and accurate data, the proposed method can effectively recover the underlying mechanical behavior without an explicit constitutive law. Regarding computational efficiency, the proposed method exhibits a slight speed advantage in this 1D single-element scenario (Figure 7b). Generally, for large-scale boundary value problems involving high material nonlinearity, traditional FEM often encounters convergence bottlenecks when using the Newton-Raphson scheme. In contrast, the data-driven paradigm governed by distance minimization rather than gradient-based iteration, typically demonstrates superior numerical stability, which translates to higher computational efficiency in complex, highly nonlinear regimes.
In the present single-element context, while the overhead of traditional FEM (such as stiffness matrix assembly and sparse solver operations) is relatively minor, our method benefits from the high-fidelity nature of the synthetic dataset. Specifically, the smooth and consistent distribution of the synthetic points facilitates rapid and precise nearest-neighbor identification within the principal stress space, thereby further reducing the search overhead. These findings confirm that the proposed adaptive-metric search algorithm is computationally lean and well-suited for incremental analysis.
To further investigate the robustness of the data-driven approach, a “deviated” synthetic dataset was generated where the data points intentionally drift from the standard hyperbolic model parameters.
Figure 8 illustrates the results under this scenario. From Figure 8, it is observed that the traditional FEM is “locked” by its pre-defined mathematical structure; since the model parameters were calibrated to the original trend, it fails to capture the actual mechanical response dictated by the new data points. In contrast, our method adaptively follows the actual data distribution, accurately reflecting the true mechanical relationship regardless of whether it conforms to a standard empirical model.
Furthermore, the iteration and search count analysis in Figure 8 reveals the numerical stability of the proposed method. In the majority of load increments, our method reaches the optimal state within a significantly lower number of iterations compared to the nonlinear iterations required by the FEM constitutive update, particularly as the system approaches higher strain levels where the model nonlinearity becomes more pronounced.

6. Convergence Analysis

6.1. Problem Setting and Assumptions

We analyze convergence in the infinite-dimensional setting, then specialize to finite element discretizations. The key assumptions are
Assumption 1 
(Uniform Approximation). There exists ρ k 0 such that every point on the Duncan–Chang manifold is approximated by some data point with error at most ρ k .
Assumption 2 
(No Outliers). There exists t k 0 such that no data point lies far from the constitutive manifold.
Assumption 3 
(Locally Lipschitz Manifold). The Duncan–Chang manifold can be locally represented as a Lipschitz graph σ = G ( ε ) , which holds due to the smooth hyperbolic form away from failure.

6.2. Transversality

Definition 1 
(Transversality). Let x = ( ε , σ ) E C . We say E and C are transversal at x if there exists λ [ 0 , 1 ) and a neighborhood U of x such that:
| P C z x | Z λ | z x | Z
for all z E U , where P C denotes projection onto C .
Lemma 1. 
For Duncan–Chang materials with non-singular tangent stiffness C ( σ ) and equilibrium operator, E and C are transversal at isolated solutions.
The convergence of the adaptive solver is intrinsically linked to the curvature of the Duncan–Chang manifold in phase space.
Proof. 
The equilibrium constraint C defines an affine subspace in Z . The Duncan–Chang manifold E has tangent space T x E at solution x = ( ε , σ ) spanned by vectors satisfying
d σ = C tan ( σ ) : d ε
where C tan is the tangent stiffness from Equation (10). The transversality condition requires T x E T x C .
Step 1: Dimension analysis
  • dim ( Z ) = 12 (6 strain + 6 stress components).
  • dim ( C ) = 6 (equilibrium provides six constraints: · σ + f = 0 ).
  • dim ( E ) = 6 (constitutive relation σ = G ( ε ) defines 6-dimensional manifold).
Step 2: Transversality criterion
By the implicit function theorem, E and C are transversal if the Jacobian matrix:
J = ( equilibrium ) σ ( constitutive ) ε
is full rank. For Duncan–Chang materials,
  • ( equilibrium ) / σ = · ( · ) (divergence operator, rank 3 in 3D).
  • ( constitutive ) / ε = C tan (positive definite when E t > 0 ).
Step 3: Non-singularity
As long as E t > 0 (away from failure), C tan is positive definite, ensuring J has full rank 6. Therefore, T x E and T x C intersect transversally.
Step 4: Contraction factor
The projection P C maps points z E near x to the constraint set. By the projection theorem for Hilbert spaces and the angle θ between T x E and T x C ,
λ = cos ( θ ) 1 E t E i · ( condition factor )
This completes the proof.    □
Lemma 2. 
Let E be the Duncan–Chang constitutive manifold. The transversality constant λ in Equation (26) is bounded by the condition number of the mapping G : ε σ . For stress-dependent hyperbolic materials, λ is a function of the mobilization level S:
λ ( S ) 1 E t ( S ) E i · 1 κ ( C )
where κ ( C ) is the condition number of the reference stiffness,
S = q / q f is the mobilization level. As the material approaches the failure envelope ( S 1 ), E t 0 , leading to λ 1 .
Proof. 
Consider the angle θ between the tangent space of the material manifold T x E and the equilibrium constraint space T x C . The convergence rate of the projection on convex sets (POCS) algorithm is governed by the Friedrichs angle between the subspaces, where the contraction factor is λ = cos ( θ ) .
For the Duncan–Chang model, as the stress state approaches the failure envelope ( S L 1 ), the tangent modulus E t degrades according to Equation (5):
E t E i ( 1 R f S L ) 2
As E t 0 , the material manifold becomes “flat” in the stress direction (parallel to the strain axis if viewed in stress-controlled space or vertical in stress–strain space). Simultaneously, the equilibrium constraint imposes a linear relation on stresses. The condition number of the mapping G : ϵ σ deteriorates.
Mathematically, the projection operator norm is bounded by
λ 1 λ m i n ( C t a n + C r e f ) λ m a x ( C r e f )
Substituting the scalar proxy for stiffness, λ 1 E t E r e f . Since E r e f E i , we obtain Equation (30). Thus, as S L 1 (failure), λ 1 , indicating a loss of transversality and slower convergence, which matches our numerical observations in the plastic regime.    □
Remark 1. 
The physical implication of Lemma 2 is profound for geotechnical applications. The transversality constant λ ( S ) acts as a contraction mapping factor in the data-driven iteration. In the elastic regime where the stress level S is low, E t E i , leading to a smaller λ and rapid convergence. However, as the state approaches the failure envelope ( S 1 ), the material manifold’s tangent becomes nearly parallel to the equilibrium constraint set in the stress axis. This geometric alignment results in λ 1 , explaining the observed deceleration in convergence rates during plastic flow. Our nested iteration mitigates this by realigning the metric C e to the local manifold curvature, effectively ‘re-orthogonalizing’ the search direction.
This indicates that the data-driven iteration will exhibit linear convergence, but the rate will decelerate significantly in the plastic-dominated regime. To mitigate this, our nested iteration updates the reference metric C e at the end of each outer loop to align the search direction with the manifold’s local tangent plane.

6.3. Main Convergence Theorem

Theorem 1 
(Convergence with Respect to Dataset). Let x = ( ε , σ ) E C be an isolated solution with E and C transversal at x with constant λ [ 0 , 1 ) . Let { E k } satisfy Assumptions A1-A2 with parameters ( ρ k , t k ) . Let x k = ( ε k , σ k ) be the data-driven solution. Then
| x k x | Z t k + λ ( t k + ρ k ) 1 λ
Therefore, lim k x k x Z = 0 .
Proof. 
Let y b e s t E k be the closest point in the dataset to the exact solution x. By Assumption A1, | y b e s t x | Z ρ k . Since the data-driven solution x k is the projection of some y k E k onto C (i.e., x k = P C y k ), and the exact solution satisfies x = P C x , we use the triangular inequality:
| x k x | Z | x k y k | Z + | y k x | Z
Using the optimality of y k and the transversality condition (Equation (25)), we can derive (see for similar linear cases, extended here for nonlinear manifolds):
| y k x | Z 1 1 λ ( | P C ( y k x ) | Z + h . o . t ) t k + ρ k 1 λ
Substituting this back yields the bound in Equation (27). The singularity as λ 1 (failure) corresponds to the breakdown of this bound.    □
Corollary 1 
(Algebraic Convergence). If ρ k C 1 N k α and t k C 2 N k α for constants C 1 , C 2 > 0 and α > 0 , where N k = # E k , then:
| x k x | Z C 2 + λ ( C 1 + C 2 ) 1 λ N k α
Interpretation: For Duncan–Chang materials:
  • Data Density ( ρ k ): Physically corresponds to the maximum grid spacing of the experimental test matrix (e.g., the interval between tested confining pressures Δ σ 3 and strain increments Δ ϵ 1 ).
  • Approximation Error ( t k ): Represents the deviation of experimental points from the ideal constitutive manifold due to measurement noise or local heterogeneity.
  • Convergence Rate (α): Depends on sampling strategy:
    -
    Structured sampling (e.g., uniform grid in principal stress space): α = 1 / d where d is effective dimension.
    -
    Noisy data: α = 1 / 2 due to probabilistic concentration.
    -
    Adaptive sampling: α can approach 1 with optimal placement.
Theoretical Limit: It is important to note that the error bound is strictly a function of the data spacing ρ k . In the theoretical limit of a noise-free dataset perfectly consistent with the manifold, as the data density N (and thus ρ k 0 ), the solver error converges to zero. The observed residuals in Section 5 are therefore consequences of finite data density (discretization error) rather than algorithmic bias.

6.4. Finite Element Discretization

Consider finite element spaces V h H 1 ( Ω ) with mesh parameter h. The discrete constraint set is
C h = { ( ε h , σ h ) : ε h = s u h , u h V h ; equilibrium holds weakly }
Theorem 2 
(Joint convergence). Let x = ( ε , σ ) be the continuous solution and x k , h = ( ε k , h , σ k , h ) the data-driven finite element solution with dataset E k and mesh size h. Assume
1. 
Standard finite element approximation: x h x Z C h
2. 
Uniform transversality: 0 λ h λ < 1
3. 
Data resolution matches mesh: ρ k , t k C h
Then:
| x k , h x | Z C h
for some constant C independent of k and h.

7. Discussion and Conclusions

This study proposes a data-driven computational mechanics (DDCM) framework for the Duncan–Chang EB constitutive model. Our primary contribution is a distance metric tailored to stress-dependent materials, which preserves essential compatibility and equilibrium constraints. By introducing a nested iteration scheme to update reference stiffness tensors, we enable the application of DDCM to materials with variable tangent moduli. The algorithm converges reliably and is validated using triaxial test data across six confining pressures. Theoretically, we establish convergence guarantees via transversality analysis, providing explicit error bounds (Theorem 1) and algebraic convergence rates (Corollary 1) relative to data resolution. We also prove optimal convergence for finite element discretization when mesh refinement matches data density (Theorem 2). The geometric interpretation via Voronoi tessellation clarifies how the method determines admissible states through phase space proximity.
While the “virtual element tests” presented in Section 5 serve as rigorous validation at the constitutive integrator level, verifying that the algorithm correctly maps strain increments to physically admissible stress states, it is important to delineate the scope regarding Boundary Value Problems (BVPs). Although the application to BVPs (e.g., slope stability or footing settlement) is the ultimate goal, it introduces additional layers of complexity, including mesh convergence, global contact algorithms, and computational efficiency optimization. As discussed, a standard nearest-neighbor search can be computationally intensive ( O ( N log N ) or O ( N ) depending on structure). Implementing this solver into a large-scale FEM code requires developing efficient parallelized search structures (e.g., k-d trees or ball trees) and represents a distinct software engineering challenge. Therefore, we have limited the scope of this study to the algorithmic validation at the material point level.
A specific and significant limitation of the current framework arises from the isotropic reduction strategy employed in Section 4.4. By conducting the nearest-neighbor search within the principal stress space to minimize computational cost, the proposed solver inherently assumes material isotropy. Consequently, the current formulation discards the orientation of the principal axes and cannot capture the effects of principal stress rotation or the inherent anisotropy often observed in natural soil deposits (such as the high-altitude samples tested). While effective for standard triaxial loading paths where the principal axes remain fixed, extending this framework to general geotechnical failure analysis will require performing data searches in the full tensorial phase space, albeit at a higher computational cost.
Furthermore, regarding data density sensitivity, conducting a full experimental sensitivity analysis would require a systematic resampling of the dataset. However, due to the limited number of available high-quality experimental stress paths (standard ASTM series), further subsampling would degrade the manifold representation below the Nyquist limit. Thus, the error–density relationship is established theoretically via Corollary 1 rather than empirically. A comparative study of this framework against standard FEM in full-scale BVP simulations, including detailed CPU time analysis and global convergence studies, is currently being developed as a separate follow-up research project.
As we look toward the future, the convergence of high-throughput experimentation, advanced sensor technologies, and data-intensive computational methods suggests that the data-driven paradigm will become increasingly central to geomechanics practice. The present work shows promise in this direction, establishing the theoretical and algorithmic infrastructure necessary for data-driven simulation to transition from proof-of-concept to production-ready engineering tools.

Author Contributions

C.H. developed the core algorithm and performed data analysis; Q.L. conducted experimental testing, collected data, implemented the E-B model, and wrote the manuscript; X.L. developed the software implementation and performed computational analysis; H.Z. contributed the mathematical framework and theoretical analysis. All authors have read and agreed to the published version of the manuscript.

Funding

This research is supported by Open Research Fund Program of State Key Laboratory of Eco-hydraulics in Northwest Arid Region, Xi’an University of Technology (Grant No. 2024KFKT-16).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data and code presented in this study are available on request from the corresponding author.

Acknowledgments

The authors acknowledge the use of experimental data from triaxial compression tests.

Conflicts of Interest

Authors Chaojun Han, Xiaohang Li and Hezuo Zhang were employed by the company PowerChina Guiyang Engineering Corporation Limited. The remaining author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
DDCMData-Driven Computational Mechanics
EBElastic-Bulk
FEMFinite Element Method
RMSRoot Mean Square

Appendix A. Duncan–Chang Parameter Identification

For classical approaches requiring calibration, parameters are extracted from triaxial test data via
ε 1 σ 1 σ 3 = a + b ε 1
Linear regression gives slopes a, b. Repeating for multiple σ 3 values yields K, n from E i values. The data-driven advantage is that this regression step is eliminated entirely—raw ( ε 1 , σ 1 σ 3 ) pairs form E directly.

References

  1. Tao, S. Actualities of Non-linear Elastic Duncan-Chang Model Research. Des. Hydroelectr. Power Stn. 2006, 22, 48–52. [Google Scholar] [CrossRef]
  2. Wang, K.; Tang, H.; Wang, R.; Zhang, J.M. Development and evaluation of a practical nonlinear elastic constitutive model for rockfill dam deformation simulation based on monitoring results. Acta Geotech. 2023, 18, 5557–5573. [Google Scholar] [CrossRef] [Scilit]
  3. Chen, H.; Du, H.; Kong, F.; Shan, W. Nonlinear elastic constitutive model of clayey sand reservoirs during depressurization exploitation of natural gas hydrate. Mar. Georesources Geotechnol. 2024, 42, 868–877. [Google Scholar] [CrossRef] [Scilit]
  4. Dong, J.; Chen, C.; Dong, M.; Lu, B.; Guan, Y.; Zhao, W. Influence of disturbance degree on the propped excavation stability in sandy soil in Shenyang, China. Undergr. Space 2023, 8, 106–121. [Google Scholar] [CrossRef] [Scilit]
  5. Liu, D.; Chen, H. Relationship between Porosity and the Constitutive Model Parameters of Rockfill Materials. J. Mater. Civ. Eng. 2019, 31, 04018384. [Google Scholar] [CrossRef] [Scilit]
  6. Guo, X.; Chi, S.; Lin, G. Discussion on energy conservation for elastic component of duncan-chang E-B model. Chin. J. Rock Mech. Eng. 2007, 26, 4307–4313. [Google Scholar]
  7. Sun, D.; Chen, X.; Wang, K.; Li, Z. Triaxial Test Numerical Simulation Based on Duncan—Chang Model. In Proceedings of the 2017 3rd International Forum on Energy, Environment Science and Materials (IFEESM 2017), Shenzhen, China, 25–26 November 2017. [Google Scholar]
  8. Jiang, S.; Xie, Q.; Du, C. Development of program of Duncan-Chang E-B and E-v models based on ABAQUS. J. Hohai Univ. (Nat. Sci.) 2011, 39, 334–338. [Google Scholar]
  9. Chen, L. Two Step Optimization Method for Parameters of Duncan-Chang EB Model. Water Power 2017, 43, 52–55,75. [Google Scholar]
  10. Zlatić, M.; Rocha, F.; Stainier, L.; Čanađija, M. Data-driven methods for computational mechanics: A fair comparison between neural networks based and model-free approaches. arXiv 2024, arXiv:2409.06727. [Google Scholar] [CrossRef] [Scilit]
  11. Stöcker, J.P.; Heinzig, S.; Khedkar, A.A.; Kaliske, M. Data-driven computational mechanics: Comparison of model-free and model-based methods in constitutive modeling. Arch. Appl. Mech. 2024, 94, 2664. [Google Scholar] [CrossRef] [Scilit]
  12. González, D.; Chinesta, F.; Cueto, E. Consistent data-driven computational mechanics. In Proceedings of the AIP Conference Proceedings, Palermo, Italy, 15–17 April 2018; Volume 1961, p. 020011. [Google Scholar]
  13. Eggersmann, R.; Stainier, L.; Ortiz, M.; Reese, S. Efficient data structures for model-free data-driven computational mechanics. Comput. Methods Appl. Mech. Eng. 2021, 382, 113855. [Google Scholar] [CrossRef] [Scilit]
  14. Gebhardt, C.G.; Schillinger, D.; Steinbach, M.C.; Rolfes, R. A framework for Data-Driven Structural Analysis in general elasticity based on nonlinear optimization: The static case. Comput. Methods Appl. Mech. Eng. 2020, 364, 112993. [Google Scholar] [CrossRef] [Scilit]
  15. Wattel, S.; Molinari, J.F.; Ortiz, M.; Garcia-Suarez, J. Mesh d-refinement: A data-based computational framework to account for complex material response. Mech. Mater. 2023, 180, 104630. [Google Scholar] [CrossRef] [Scilit]
  16. Dandin, H.; Leygue, A.; Stainier, L. Graph-based representation of history-dependent material response in the Data-Driven Computational Mechanics framework. Comput. Methods Appl. Mech. Eng. 2024, 421, 116694. [Google Scholar] [CrossRef] [Scilit]
  17. Bartel, T.; Harnisch, M.; Schweizer, B.; Menzel, A. A data-driven approach for plasticity using history surrogates: Theory and application in the context of truss structures. Comput. Methods Appl. Mech. Eng. 2023, 414, 116138. [Google Scholar] [CrossRef] [Scilit]
  18. Karapiperis, K.; Stainier, L.; Ortiz, M.; Andrade, J. Data-Driven multiscale modeling in mechanics. J. Mech. Phys. Solids 2021, 147, 104239. [Google Scholar] [CrossRef] [Scilit]
  19. Huang, M.; Liu, C.; Du, Z.; Tang, S.; Guo, X. A sequential linear programming (SLP) approach for uncertainty analysis-based data-driven computational mechanics. Comput. Mech. 2023, 72, 1673–1685. [Google Scholar] [CrossRef] [Scilit]
  20. Zschocke, S.; Leichsenring, F.; Graf, W.; Kaliske, M. A concept for data-driven computational mechanics in the presence of polymorphic uncertain properties. Eng. Struct. 2022, 267, 114672. [Google Scholar] [CrossRef] [Scilit]
  21. Ciftci, K.; Hackl, K. A Physics-informed GAN Framework based on Model-free Data-Driven Computational Mechanics. arXiv 2023, arXiv:2310.20308. [Google Scholar] [CrossRef] [Scilit]
  22. Kirchdoerfer, T.; Ortiz, M. Data-driven computational mechanics. Comput. Methods Appl. Mech. Eng. 2016, 304, 81–101. [Google Scholar] [CrossRef] [Scilit]
  23. Zienkiewicz, O.; Taylor, R.; Zhu, J. (Eds.) Dedication. In The Finite Element Method: Its Basis and Fundamentals, 7th ed.; Butterworth-Heinemann: Oxford, UK, 2013; pp. 21–45. [Google Scholar] [CrossRef] [Scilit]
  24. ASTM D7181-20; Standard Test Method for Consolidated Drained Triaxial Compression Test for Soils. ASTM International: West Conshohocken, PA, USA, 2020. [CrossRef] [Scilit]
Figure 1. Triaxial test data at multiple confining pressures. The data shows the characteristic nonlinear stress–strain behavior of granular materials, with stiffness increasing with confining pressure.
Figure 1. Triaxial test data at multiple confining pressures. The data shows the characteristic nonlinear stress–strain behavior of granular materials, with stiffness increasing with confining pressure.
Mathematics 14 00751 g001
Figure 2. Stress-dependent initial tangent modulus. The initial modulus increases nonlinearly with confining pressure, following a power law relationship with exponent n = 0.5 .
Figure 2. Stress-dependent initial tangent modulus. The initial modulus increases nonlinearly with confining pressure, following a power law relationship with exponent n = 0.5 .
Mathematics 14 00751 g002
Figure 3. Convergence history of the data-driven solver. The penalty function decreases monotonically, demonstrating the stability of the iterative scheme. The energy norm serves as a measure of distance from the material dataset.
Figure 3. Convergence history of the data-driven solver. The penalty function decreases monotonically, demonstrating the stability of the iterative scheme. The energy norm serves as a measure of distance from the material dataset.
Mathematics 14 00751 g003
Figure 4. Data point assignment for the target state ( ε 1 = 2 % , σ 3 = 500 kPa). The computed state (black X) is assigned to the nearest experimental data point (white star).
Figure 4. Data point assignment for the target state ( ε 1 = 2 % , σ 3 = 500 kPa). The computed state (black X) is assigned to the nearest experimental data point (white star).
Mathematics 14 00751 g004
Figure 5. Phase space Voronoi tessellation and nearest-neighbor search. Each colored region represents a Voronoi cell projection on ε 1 p surface containing all points closest to its data point under the energy metric d = 0.5 · C · ( Δ ε ) 2 + 0.5 · ( Δ q ) 2 / C with stiffness C = 111.80 MPa (derived from the local tangent modulus E t at the current stress state). The solver assigns the computed state (red X) to the data point (red star) that minimizes this distance, effectively partitioning the phase space into Voronoi cells.
Figure 5. Phase space Voronoi tessellation and nearest-neighbor search. Each colored region represents a Voronoi cell projection on ε 1 p surface containing all points closest to its data point under the energy metric d = 0.5 · C · ( Δ ε ) 2 + 0.5 · ( Δ q ) 2 / C with stiffness C = 111.80 MPa (derived from the local tangent modulus E t at the current stress state). The solver assigns the computed state (red X) to the data point (red star) that minimizes this distance, effectively partitioning the phase space into Voronoi cells.
Mathematics 14 00751 g005
Figure 6. Multi-point validation of the data-driven algorithm across different confining pressures. The R 2 (coefficient of determination, defined as 1 ( y i y ^ i ) 2 ( y i y ¯ ) 2 ) values consistently exceed 0.85.
Figure 6. Multi-point validation of the data-driven algorithm across different confining pressures. The R 2 (coefficient of determination, defined as 1 ( y i y ^ i ) 2 ( y i y ¯ ) 2 ) values consistently exceed 0.85.
Mathematics 14 00751 g006
Figure 7. Performance verification using high-fidelity synthetic data: (a) Comparison of stress–strain responses between traditional FEM and proposed method. (b) Comparison of computational efficiency for 500 load increments. The results demonstrate that our method can accurately converge to the reference solution with high-quality data.
Figure 7. Performance verification using high-fidelity synthetic data: (a) Comparison of stress–strain responses between traditional FEM and proposed method. (b) Comparison of computational efficiency for 500 load increments. The results demonstrate that our method can accurately converge to the reference solution with high-quality data.
Mathematics 14 00751 g007
Figure 8. Robustness analysis under biased data conditions: (a) Stress–strain response where our method accurately captures the deviated data trend while FEM is constrained by the pre-defined model. (b) Evolution of iteration counts for FEM (Newton-Raphson) and search steps for our method, showing the superior numerical stability of the data-driven approach.
Figure 8. Robustness analysis under biased data conditions: (a) Stress–strain response where our method accurately captures the deviated data trend while FEM is constrained by the pre-defined model. (b) Evolution of iteration counts for FEM (Newton-Raphson) and search steps for our method, showing the superior numerical stability of the data-driven approach.
Mathematics 14 00751 g008
Table 1. Comparison of different data-driven computational mechanics (DDCM) approaches.
Table 1. Comparison of different data-driven computational mechanics (DDCM) approaches.
FeatureModel-Free DDCM (Distance Minimization)Neural Network-Based Constitutive ModelingProposed Adaptive Metric DDCM (This Work)
Core MechanismDirect phase-space projection onto discrete datasetApproximation of constitutive manifold via continuous functionsPhase-space projection with stress-dependent Riemannian metric
Data FidelityExact adherence to data (zero modeling error at data points)Smoothing/Fitting error existsExact adherence to data with physics-informed search direction
Stress DependencyDifficult to handle without adaptive metricLearned implicitly by NN architectureExplicitly handled via nested stiffness update
Computational CostHigh (Nearest Neighbor Search)Low (during inference)Moderate to High (Iterative Metric Update + Search)
InterpretabilityHigh (returns actual experimental points)Low (Black-box)High (returns actual experimental points)
Table 2. Comprehensive nomenclature and symbol definitions.
Table 2. Comprehensive nomenclature and symbol definitions.
SymbolDefinitionDependency/Notes
a , b Hyperbolic curve parametersFunctions of σ 3 (Equation (2))
E i , E t Initial and Tangent Young’s Modulus E t = E t ( σ 3 , S L ) (Equation (5))
BBulk Modulus (volumetric stiffness) B = B ( σ 3 ) (Equation (6))
E Global material database containing all ( ϵ , σ ) pairsExperimental input
E e Local subset of database relevant to element eSubset of E
z = ( ϵ , σ ) State vector in phase space Z = R 6 × R 6
C r e f Conceptual reference stiffness tensor for metricGeneric notation
C e ( σ ¯ e ) Element-specific, stress-dependent stiffness tensorUpdates with outer iter. k
σ ¯ e Reference stress state for metric constructionFrom previous iter. k 1
( ϵ e 0 , σ e 0 ) Candidate data point in searchGeneric member of E
( ϵ e , σ e ) Optimal assigned data pointResult of minimization (Equation (14))
w e Integration weight (Quadrature weight × det J )Standard FEM (Gaussian)
B e a Strain-displacement matrixGradient operator s N a
K ( k ) Global stiffness matrix at iteration k B T C ( k ) B d Ω
η Lagrange multipliers for equilibriumEnforces · σ + f = 0
τ i n , τ o u t Tolerances for inner (solver) and outer (metric) loopsSet to 10 6 and 10 4
Δ q Deviatoric stress increment σ 1 σ 3
R 2 Coefficient of determination 1 ( y i y ^ i ) 2 / ( y i y ¯ ) 2
Table 3. Basic physical properties of the test soil from Tibet, China.
Table 3. Basic physical properties of the test soil from Tibet, China.
Physical PropertyValue
Plastic limit (%)13.6
Liquid limit (%)24.5
Plasticity index (%)10.9
Specific gravity2.70
Optimum moisture content (%)10.96
Maximum dry density (g/cm3)1.98
Mean particle diameter d 50 (mm)0.073
Table 4. Material parameters for synthetic data generation.
Table 4. Material parameters for synthetic data generation.
ParameterSymbolValue
Modulus exponentn0.65
Modulus numberK480.0
Failure ratio R f 0.82
Cohesion (kPa)c12.0
Internal friction angle (°) ϕ 33
Confining pressure (kPa) σ 3 300.0
Reference pressure (kPa) P a 101.0
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Han, C.; Liu, Q.; Li, X.; Zhang, H. Data-Driven Computation Scheme for Duncan–Chang EB Model. Mathematics 2026, 14, 751. https://doi.org/10.3390/math14050751

AMA Style

Han C, Liu Q, Li X, Zhang H. Data-Driven Computation Scheme for Duncan–Chang EB Model. Mathematics. 2026; 14(5):751. https://doi.org/10.3390/math14050751

Chicago/Turabian Style

Han, Chaojun, Qianhui Liu, Xiaohang Li, and Hezuo Zhang. 2026. "Data-Driven Computation Scheme for Duncan–Chang EB Model" Mathematics 14, no. 5: 751. https://doi.org/10.3390/math14050751

APA Style

Han, C., Liu, Q., Li, X., & Zhang, H. (2026). Data-Driven Computation Scheme for Duncan–Chang EB Model. Mathematics, 14(5), 751. https://doi.org/10.3390/math14050751

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop